Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery-Reference-Cited by-同舟云学术

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

Published:2022-11 Issue:3 Volume:302 Page:831-846
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Vu Duc Minh^ORCID,Hewitt Mike^ORCID,Vu Duc D.^ORCID

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference46 articles.

1. The time dependent traveling salesman problem: Polyhedra and algorithm;Abeledo;Mathematical Programming Computation,2013

2. An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation;Albiach;European Journal of Operational Research,2008

3. Recent challenges in routing and inventory routing: E-commerce and last-mile delivery;Archetti;Networks,2021

4. Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm;Arigliano;Discrete Applied Mathematics,2018

5. A polyhedral study of the asymmetric traveling salesman problem with time windows;Ascheuer;Networks,2000

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exact and anytime approach for solving the time dependent traveling salesman problem with time windows;European Journal of Operational Research;2023-12

2. Moving-target travelling salesman problem for a helicopter patrolling suspicious boats in antipiracy escort operations;Expert Systems with Applications;2023-03

3. Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation;Transportation Research Part B: Methodological;2022-12