The traveling salesman problem with time-dependent service times

DOI10.1016/j.ejor.2015.07.048zbMath1346.90721OpenAlexW1421911707MaRDI QIDQ320683

Gilbert Laporte, Duygu Taş, Michel Gendreau, Ola Jabali

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.07.048

zbMATH Keywords

traveling salesman problemlower and upper boundsservice timestime-dependency

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Scheduling activities with time-dependent durations and resource consumptions, The traveling salesman problem with job-times (\textit{TSPJ}), Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, Electric vehicle routing problem with time-dependent waiting times at recharging stations, A comparison of algorithms for finding an efficient theme park tour, Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics, A minmax regret version of the time-dependent shortest path problem, Models and algorithms for the traveling salesman problem with time-dependent service times

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Arc routing problems with time-dependent service costs
• Classification of travelling salesman problem formulations
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A result on projection for the vehicle routing problem
• A classification of formulations for the (time-dependent) traveling salesman problem
• Vehicle dispatching with time-dependent travel times
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• TSPLIB—A Traveling Salesman Problem Library
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Solution of a Large-Scale Traveling-Salesman Problem