The traveling salesman problem with time-dependent service times
From MaRDI portal
Publication:320683
DOI10.1016/J.EJOR.2015.07.048zbMATH Open1346.90721OpenAlexW1421911707MaRDI QIDQ320683FDOQ320683
G. 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
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
- TSPLIB—A Traveling Salesman Problem Library
- A classification of formulations for the (time-dependent) traveling salesman problem
- Integer Programming Formulation of Traveling Salesman Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Title not available (Why is that?)
- Vehicle dispatching with time-dependent travel times
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A result on projection for the vehicle routing problem
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Title not available (Why is that?)
- Arc routing problems with time-dependent service costs
- Classification of travelling salesman problem formulations
Cited In (13)
- 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
- Title not available (Why is that?)
- The traveling salesman problem with job-times (\textit{TSPJ})
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- Title not available (Why is that?)
Uses Software
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)
