TSP race: minimizing completion time in time-sensitive applications

DOI10.1016/J.EJOR.2014.12.022MaRDI QIDQ319282zbMATHOpenAlexFDO

Authors Bahar Çavdar, Joel Sokol

Publication date 6 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.2014.12.022

zbMATH Keywords

heuristiccomputation-implementation parallelizationTSP race

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Numerical methods for mathematical programming, optimization and variational techniques (65K99)

Recommendations

• An integer programming approach for the time-dependent TSP
• The parameterized approximability of TSP with deadlines
• Minimizing completion time for a class of scheduling problems
• Reoptimization of the metric deadline TSP
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Online and offline algorithms for the time-dependent TSP with time zones
• scientific article; zbMATH DE number 1839476
• The time-dependent quickest path problem: properties and bounds
• On the complexity of time-dependent shortest paths
• On the complexity of time-dependent shortest paths

Cites work

• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A method for solving traveling-salesman problems
• A survey of hard real-time scheduling for multiprocessor systems
• Algorithms for the on-line quota traveling salesman problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• Chained Lin-Kernighan for large traveling salesman problems
• Computing and Combinatorics
• Efficient scheduling strategies for processing multiple divisible loads on bus networks
• Expanding neighborhood GRASP for the traveling salesman problem
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: TSP race: minimizing completion time in time-sensitive applications

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