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...
Saved in:
Main Authors: | Duc Minh, Vu, Mike, Hewitt, Duc D.Vuc |
---|---|
Format: | Bài trích |
Language: | English |
Published: |
Elsevier
2022
|
Subjects: | |
Online Access: | 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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
by: Duc, Minh Vua, et al.
Published: (2022) -
Economic policy uncertainty: The probability and duration of economic recessions in major European Union countries
by: Thanh Cong, Nguyen
Published: (2022) -
Textbook of drug design and discovery /
by: Larsen, Povl Krogsgaard
Published: (2017) -
ReLU Neural Network Galerkin BEM
by: Rubén, Aylwin, et al.
Published: (2023) -
Design, synthesis and evaluation of novel 2-oxoindoline-based acetohydrazides as antitumor agents
by: Dung, Do T. M., et al.
Published: (2022)