An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:4849335
DOI10.1287/OPRE.43.2.367zbMATH Open0837.90036OpenAlexW2109405343MaRDI QIDQ4849335FDOQ4849335
Éric Gélinas, Jacques Desrosiers, Yvan Dumas, Marius M. Solomon
Publication date: 25 September 1995
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.2.367
Recommendations
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- New state-space relaxations for solving the traveling salesman problem with time windows
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
Programming involving graphs or networks (90C35) Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06)
Cited In (74)
- Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows
- 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
- Optimizing Time Slot Allocation in Single Operator Home Delivery Problems
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
- The intermittent travelling salesman problem
- Scheduling tasks on moving executors to minimise the maximum lateness
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- The first AI4TSP competition: learning to solve stochastic routing problems
- Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving the single crane scheduling problem at rail transshipment yards
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- Beam-ACO for the travelling salesman problem with time windows
- Compact formulations of the Steiner traveling salesman problem and related problems
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
- 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
- Minimization of travel time and weighted number of stops in a traffic-light network
- 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
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- Hybrid optimization methods for time-dependent sequencing problems
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- A stochastic dynamic traveling salesman problem with hard time windows
- Branch-and-check approaches for the tourist trip design problem with rich constraints
- Shipping problems with body clock constraints.
- Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Pricing routines for vehicle routing with time windows on road networks
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location
- A soft dynamic programming approach for on-line aircraft 4D-trajectory optimization
- The first \(K\) shortest unique-arc walks in a traffic-light network
- An ant colony system approach for variants of the traveling salesman problem with time windows
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- What are the worst cases in constrained last-in-first-out pick-up and delivery problems?
- The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
- Dynamic programming based metaheuristics for the dial-a-ride problem
- Traveling salesman problem with clustering
- An enhanced branch-and-bound algorithm for the talent scheduling problem
- The rural postman problem with deadline classes
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
- Ship scheduling with soft time windows: An optimisation based approach
- Scheduled penalty variable neighborhood search
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
- A metaheuristic for the delivery man problem with time windows
- A general VNS heuristic for the traveling salesman problem with time windows
- The delivery man problem with time windows
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
- Routing problems: A bibliography
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
- Single-vehicle scheduling with time window constraints
- Improving the filtering of branch-and-bound MDD solver
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows
- Local search with annealing-like restarts to solve the VRPTW
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- Deep policy dynamic programming for vehicle routing problems
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- Finding \(K\) shortest looping paths in a traffic-light network
This page was built for publication: An Optimal Algorithm for the 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 Q4849335)
