Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:5060801
DOI10.1287/ijoc.2022.1236OpenAlexW4298001495MaRDI QIDQ5060801
Francisco J. Soulignac, Gonzalo Lera-Romero, Juan José Miranda-Bront
Publication date: 11 January 2023
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2022.1236
dynamic programmingtraveling salesman problemtime windowstime-dependent travel timesstate-space relaxationcompletion bounds
Related Items (4)
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 ⋮ Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
Cites Work
- Time-dependent routing problems: a review
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints
- Vehicle dispatching with time-dependent travel times
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- An enhanced lower bound for the time-dependent travelling salesman problem
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- A Generalized Insertion Heuristic 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
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- A Compressed-Annealing Heuristic for the 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
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows
This page was built for publication: Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
