Item Infomation


Title: 
Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
Authors: 
Duc Minh, Vu
Mike, Hewitt
Duc D.Vuc
Issue Date: 
2022
Publisher: 
Elsevier
Abstract: 
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.
URI: 
https://www.sciencedirect.com/science/article/abs/pii/S0377221722000674?via%3Dihub
https://dlib.phenikaa-uni.edu.vn/handle/PNK/5877
Appears in Collections
Bài báo khoa học
ABSTRACTS VIEWS

10

FULLTEXT VIEWS

0

Files in This Item:

There are no files associated with this item.