Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
From MaRDI portal
(Redirected from Publication:5060801)
Recommendations
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- New state-space relaxations for solving the traveling salesman problem with time windows
- scientific article; zbMATH DE number 947471
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
Cites work
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- A compressed-annealing heuristic for the traveling salesman problem with time windows
- A generalized insertion heuristic for the travelling salesman problem with time windows
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- A time bucket formulation for the traveling salesman problem with time windows
- An enhanced lower bound for the time-dependent travelling salesman problem
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows
- New route relaxation and pricing strategies for the vehicle routing problem
- New state-space relaxations for solving the traveling salesman problem with time windows
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- State-space relaxation procedures for the computation of bounds to routing problems
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- Time-dependent routing problems: a review
- Vehicle dispatching with time-dependent travel times
Cited in
(12)- The time-dependent capacitated profitable tour problem with time windows and precedence constraints
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- scientific article; zbMATH DE number 5864729 (Why is no real title available?)
- Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
- scientific article; zbMATH DE number 2202185 (Why is no real title available?)
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows
- A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- Traveling salesman problem with drone and bicycle: multimodal last-mile e-mobility
- Beware of the classical benchmark instances for the traveling salesman problem with time windows
This page was built for publication: Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060801)
