An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem

DOI10.1051/ro/2019006zbMath1423.90204OpenAlexW2906863681MaRDI QIDQ5242274

Ha-Bang Ban

Publication date: 6 November 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2019006

zbMATH Keywords

Tabu searchvariable neighborhood searchtime dependent traveling salesman problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

An assign-and-route matheuristic for the time-dependent inventory routing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• Exact algorithms for the minimum latency problem
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• Scheduling examinations to reduce second-order conflicts
• Variable neighborhood search
• The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005.
• Greedy randomized adaptive search procedures
• A simple and effective metaheuristic for the minimum latency problem
• The time dependent traveling salesman problem: polyhedra and algorithm
• The minimum latency problem
• Approximation schemes for minimum latency problems
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• A Faster, Better Approximation Algorithm for the Minimum Latency Problem
• Tabu Search—Part II
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Time‐dependent traveling salesman problem–the deliveryman case
• Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem

This page was built for publication: An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem