Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery

In this paper, we present exact methods for solving the Time Dependent Minimum Tour Duration Problem (TD-MTDP) and the Time Dependent Delivery Man Problem (TD-DMP). Both methods are based on a Dynamic Discretization Discovery (DDD) approach for solving the Time Dependent Traveling Salesman Problem w...

Mô tả chi tiết

Lưu vào:

Hiển thị chi tiết
Tác giả chính:	Duc Minh, Vu, Mike, Hewitt, Duc D.Vuc
Định dạng:	Bài trích
Ngôn ngữ:	English
Thông tin xuất bản:	Elsevier 2022
Chủ đề:	Tour Duration Problem Dynamic Discretization Discovery
Truy cập trực tuyến:	https://www.sciencedirect.com/science/article/abs/pii/S0377221722000674?via%3Dihub https://dlib.phenikaa-uni.edu.vn/handle/PNK/5877 https://doi.org/10.1016/j.ejor.2022.01.029
Từ khóa:	Thêm từ khóa bạn đọc Không có từ khóa, Hãy là người đầu tiên gắn từ khóa cho biểu ghi này!

id	oai:localhost:PNK-5877
record_format	dspace
spelling	oai:localhost:PNK-58772022-08-17T05:54:54Z Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery Duc Minh, Vu Mike, Hewitt Duc D.Vuc Tour Duration Problem Dynamic Discretization Discovery In this paper, we present exact methods for solving the Time Dependent Minimum Tour Duration Problem (TD-MTDP) and the Time Dependent Delivery Man Problem (TD-DMP). Both methods are based on a Dynamic Discretization Discovery (DDD) approach for solving the Time Dependent Traveling Salesman Problem with Time Windows (TD-TSPTW). Unlike the TD-TSPTW, these problems involve objective functions that depend in part on the time at which the vehicle departs the depot. As such, optimizing these problems adds a scheduling dimension to the problem. We present multiple enhancements to the DDD method, including enabling it to dynamically determine which waiting opportunities at the depot to model. With an extensive computational study we demonstrate that the resulting methods outperform all known methods for both the TD-MTDP and TD-DMP on instances taken from the literature. 2022-07-13T01:59:47Z 2022-07-13T01:59:47Z 2022 Bài trích https://www.sciencedirect.com/science/article/abs/pii/S0377221722000674?via%3Dihub https://dlib.phenikaa-uni.edu.vn/handle/PNK/5877 https://doi.org/10.1016/j.ejor.2022.01.029 en Elsevier
institution	Trường Đại học Phenikaa
collection	DSpace
language	English
topic	Tour Duration Problem Dynamic Discretization Discovery
spellingShingle	Tour Duration Problem Dynamic Discretization Discovery Duc Minh, Vu Mike, Hewitt Duc D.Vuc Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
description	In this paper, we present exact methods for solving the Time Dependent Minimum Tour Duration Problem (TD-MTDP) and the Time Dependent Delivery Man Problem (TD-DMP). Both methods are based on a Dynamic Discretization Discovery (DDD) approach for solving the Time Dependent Traveling Salesman Problem with Time Windows (TD-TSPTW). Unlike the TD-TSPTW, these problems involve objective functions that depend in part on the time at which the vehicle departs the depot. As such, optimizing these problems adds a scheduling dimension to the problem. We present multiple enhancements to the DDD method, including enabling it to dynamically determine which waiting opportunities at the depot to model. With an extensive computational study we demonstrate that the resulting methods outperform all known methods for both the TD-MTDP and TD-DMP on instances taken from the literature.
format	Bài trích
author	Duc Minh, Vu Mike, Hewitt Duc D.Vuc
author_facet	Duc Minh, Vu Mike, Hewitt Duc D.Vuc
author_sort	Duc Minh, Vu
title	Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
title_short	Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
title_full	Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
title_fullStr	Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
title_full_unstemmed	Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
title_sort	solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
publisher	Elsevier
publishDate	2022
url	https://www.sciencedirect.com/science/article/abs/pii/S0377221722000674?via%3Dihub https://dlib.phenikaa-uni.edu.vn/handle/PNK/5877 https://doi.org/10.1016/j.ejor.2022.01.029
work_keys_str_mv	AT ducminhvu solvingthetimedependentminimumtourdurationanddeliverymanproblemswithdynamicdiscretizationdiscovery AT mikehewitt solvingthetimedependentminimumtourdurationanddeliverymanproblemswithdynamicdiscretizationdiscovery AT ducdvuc solvingthetimedependentminimumtourdurationanddeliverymanproblemswithdynamicdiscretizationdiscovery
_version_	1768590789119574016

Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery

Tài liệu tương tự