Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
From MaRDI portal
Publication:2174903
Recommendations
- The vehicle routing problem with flexible time windows and traveling times
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- scientific article; zbMATH DE number 947471
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
Cites work
- 2-path cuts for the vehicle routing problem with time windows
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A column generation algorithm for the vehicle routing problem with soft time windows
- A metaheuristic for the vehicle-routeing problem with soft time windows
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- A reoptimization algorithm for the shortest path problem with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A vehicle routing problem with flexible time windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3950233 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- Job shop scheduling with setup times, deadlines and precedence constraints
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- Network flows. Theory, algorithms, and applications.
- New classes of efficiently solvable generalized traveling salesman problems
- New state-space relaxations for solving the traveling salesman problem with time windows
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- Timing problems and algorithms: time decisions for sequences of activities
- TSPLIB—A Traveling Salesman Problem Library
Cited in
(12)- A stochastic dynamic traveling salesman problem with hard time windows
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
- A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- scientific article; zbMATH DE number 947471 (Why is no real title available?)
- Heuristic approaches to minimize tour duration for the TSP with multiple time windows
- 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
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
- A harmony search-based memetic algorithm for vehicle routing problem with order release dates and flexible time windows
This page was built for publication: Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174903)
