Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
From MaRDI portal
Recommendations
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- scientific article; zbMATH DE number 947471
- scientific article; zbMATH DE number 956787
Cited in
(45)- An algorithm for the traveling salesman problem with pickup and delivery customers
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
- Shipping problems with body clock constraints.
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- Sequential and parallel local search for the time-constrained traveling salesman problem
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
- Minimization of travel time and weighted number of stops in a traffic-light network
- Time-constrained Chinese postman problems
- Routing problems: A bibliography
- Perspectives on integer programming for time-dependent models
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- 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
- Beam-ACO for the travelling salesman problem with time windows
- Solving the single crane scheduling problem at rail transshipment yards
- On the computational complexity of the probabilistic traveling salesman problem with deadlines
- A LP-based heuristic for a time-constrained routing problem
- 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
- scientific article; zbMATH DE number 4131978 (Why is no real title available?)
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
- Pricing routines for vehicle routing with time windows on road networks
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- The delivery man problem with time windows
- Shuffling heuristics for the storage location assignment in an AS/RS
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- scientific article; zbMATH DE number 947471 (Why is no real title available?)
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
- A model for the traveling salesman problem including the EC regulations on driving hours
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- The bus sightseeing problem
- A branch-and-bound approach for a vehicle routing problem with customer costs
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework
- Invariant graph propagation in constraint-based local search
- Beware of the classical benchmark instances for the traveling salesman problem with time windows
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
This page was built for publication: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342216)
