The traveling salesman problem with time-dependent service times

DOI10.1016/J.EJOR.2015.07.048MaRDI QIDQ320683zbMATH OpenOpenAlexFDO

Authors Duygu Taş, Michel Gendreau, Ola Jabali, G. Laporte

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)

Recommendations

• Models and algorithms for the traveling salesman problem with time-dependent service times
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
• Time‐dependent traveling salesman problem–the deliveryman case
• The traveling salesman problem with job-times (\textit{TSPJ})
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks

Cites work

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

Cited in

(15)

• Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
• Electric vehicle routing problem with time-dependent waiting times at recharging stations
• A comparison of algorithms for finding an efficient theme park tour
• Scheduling activities with time-dependent durations and resource consumptions
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
• Models and algorithms for the traveling salesman problem with time-dependent service times
• A minmax regret version of the time-dependent shortest path problem
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
• Time‐dependent traveling salesman problem–the deliveryman case
• Modifying Soyster's model for the symmetric traveling salesman problem with interval travel times
• Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms
• scientific article; zbMATH DE number 4160472 (Why is no real title available?)
• The traveling salesman problem with job-times (\textit{TSPJ})
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
• scientific article; zbMATH DE number 5864729 (Why is no real title available?)

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: The traveling salesman problem with time-dependent service times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320683)