Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
From MaRDI portal
Publication:4367231
Recommendations
- Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
Cited in
(39)- Single-vehicle scheduling with time window constraints
- Shipping problems with body clock constraints.
- A tabu search algorithm for scheduling a single robot in a job-shop environment
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints
- Exact and heuristic algorithms for routing AGV on path with precedence constraints
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- A hybrid algorithm for the vehicle routing problem with AND/OR precedence constraints and time windows
- Deep policy dynamic programming for vehicle routing problems
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- Nodal aggregation of resource constraints in a shortest path problem
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- 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
- On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- An enhanced branch-and-bound algorithm for the talent scheduling problem
- Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
- The delivery man problem with time windows
- scientific article; zbMATH DE number 1070403 (Why is no real title available?)
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- scientific article; zbMATH DE number 2086966 (Why is no real title available?)
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- The vehicle routing problem with floating targets: formulation and solution approaches
- Network-based approximate linear programming for discrete optimization
- Call-based dynamic programming for the precedence constrained line traveling salesman
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
- Scheduling tasks on moving executors to minimise the maximum lateness
- Beware of the classical benchmark instances for the traveling salesman problem with time windows
- A mission planning algorithm inspired by temporal difference learning for minimizing makespan
This page was built for publication: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367231)
