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: | , , |
|---|---|
| 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/5737 https://doi.org/10.1016/j.ejor.2022.01.029 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!