Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks

DOI10.1007/978-3-319-59776-8_21zbMath1492.90145OpenAlexW2620179678MaRDI QIDQ2011598

Duc Minh Vu, Mike Hewitt, Natashia Boland, Savelsbergh, Martin W. P.

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_21

zbMATH Keywords

mixed integer programmingtraveling salesman problemtime windowsdynamic discretization discoverytime-expanded networks

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, A general variable neighborhood search for the traveling salesman problem with time windows under various objectives, A continuous‐time service network design and vehicle routing problem, Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Rejoinder on: ``Perspectives on integer programming for time-dependent models, A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints, Branch-and-refine for solving time-expanded MILP formulations, Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version

Uses Software

• TSPTW

Cites Work

• A general VNS heuristic for the traveling salesman problem with time windows
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
• A Hybrid Exact Algorithm for the TSPTW
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows