Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
From MaRDI portal
Publication:2011598
DOI10.1007/978-3-319-59776-8_21zbMATH Open1492.90145OpenAlexW2620179678MaRDI QIDQ2011598FDOQ2011598
Authors: Natashia Boland, Mike Hewitt, Duc Minh Vu, Martin W. P. Savelsbergh 
Publication date: 4 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_21
Recommendations
- New state-space relaxations for solving the traveling salesman problem with time windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- An ant colony system approach for variants of the traveling salesman problem with time windows
- scientific article; zbMATH DE number 947471
time windowstraveling salesman problemmixed integer programmingdynamic discretization discoverytime-expanded networks
Cites Work
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A polyhedral study of the asymmetric 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 general VNS heuristic for the traveling salesman problem with time windows
- A hybrid exact algorithm for the TSPTW
Cited In (11)
- 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
- New state-space relaxations for solving the traveling salesman problem with time windows
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- Rejoinder on: ``Perspectives on integer programming for time-dependent models
- The traveling salesman problem with time-dependent service times
- A continuous‐time service network design and vehicle routing problem
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
Uses Software
This page was built for publication: Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011598)
