An enhanced lower bound for the time-dependent travelling salesman problem
DOI10.1016/J.COR.2019.104795zbMATH Open1458.90597OpenAlexW2971416083WikidataQ127291010 ScholiaQ127291010MaRDI QIDQ2333147FDOQ2333147
Authors: Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero 
Publication date: 11 November 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.104795
Recommendations
- Time‐dependent traveling salesman problem–the deliveryman case
- scientific article; zbMATH DE number 947471
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
- An integer programming approach for the time-dependent TSP
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- A classification of formulations for the (time-dependent) traveling salesman problem
- Vehicle dispatching with time-dependent travel times
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
- An integer programming approach for the time-dependent TSP
- Vehicle Routing
- 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.
- Title not available (Why is that?)
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- The moving-target traveling salesman problem
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- The time-dependent traveling salesman problem
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Time-dependent routing problems: a review
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Natural and extended formulations for the time-dependent traveling salesman problem
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- A time-dependent no-overlap constraint: application to urban delivery problems
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
Cited In (15)
- Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
- Branch-and-refine for solving time-expanded MILP formulations
- Facets and valid inequalities for the time-dependent travelling salesman problem
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
- Title not available (Why is that?)
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
- The traveling salesman problem with job-times (\textit{TSPJ})
- On path ranking in time-dependent graphs
- A hybrid mathematical model for flying sidekick travelling salesman problem with time windows
- A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
- Tight lower bounds for the traveling salesman problem with draft limits
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: An enhanced lower bound for the time-dependent travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333147)
