New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
From MaRDI portal
Publication:5746675
DOI10.1080/02331934.2013.824445zbMath1282.90107MaRDI QIDQ5746675
Fulya Altiparmak, Imdat Kara, Berna Dengiz, Ozge Nimet Koc
Publication date: 7 February 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.824445
90C10: Integer programming
Related Items
A general variable neighborhood search for the traveling salesman problem with time windows under various objectives, Unconstrained binary models of the travelling salesman problem variants for quantum optimization
Cites Work
- A general VNS heuristic for the traveling salesman problem with time windows
- Beam-ACO for the travelling salesman problem with time windows
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- A Hybrid Exact Algorithm for the TSPTW
- A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- An ant colony system approach for variants of the traveling salesman problem with time windows
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- State-space relaxation procedures for the computation of bounds to routing problems
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
