An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:4849335
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
Cited in
(75)- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives
- Optimizing time slot allocation in single operator home delivery problems
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
- The intermittent travelling salesman problem
- scientific article; zbMATH DE number 5864729 (Why is no real title available?)
- scientific article; zbMATH DE number 2202185 (Why is no real title available?)
- Solving the single crane scheduling problem at rail transshipment yards
- The first AI4TSP competition: learning to solve stochastic routing problems
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- Mixed integer programming formulations for the generalized traveling salesman problem with time windows
- Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures
- Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows
- Scheduling tasks on moving executors to minimise the maximum lateness
- Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- Local search with annealing-like restarts to solve the VRPTW
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- An ant colony system approach for variants of the traveling salesman problem with time windows
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- The vehicle routing problem with floating targets: formulation and solution approaches
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- Ship scheduling with soft time windows: An optimisation based approach
- Finding \(K\) shortest looping paths in a traffic-light network
- The rural postman problem with deadline classes
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- A metaheuristic for the delivery man problem with time windows
- A stochastic dynamic traveling salesman problem with hard time windows
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence
- Minimization of travel time and weighted number of stops in a traffic-light network
- 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
- A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- Pricing routines for vehicle routing with time windows on road networks
- 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
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
- Deep policy dynamic programming for vehicle routing problems
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Hybrid optimization methods for time-dependent sequencing problems
- Dynamic programming based metaheuristics for the dial-a-ride problem
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
- Beam-ACO for the travelling salesman problem with time windows
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- 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 single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
- Traveling salesman problem with clustering
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
- Shipping problems with body clock constraints.
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
- A general VNS heuristic for the traveling salesman problem with time windows
- The delivery man problem with time windows
- Routing problems: A bibliography
- Compact formulations of the Steiner traveling salesman problem and related problems
- A soft dynamic programming approach for on-line aircraft 4D-trajectory optimization
- A compressed-annealing heuristic for the traveling salesman problem with time windows
- Single-vehicle scheduling with time window constraints
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- An enhanced branch-and-bound algorithm for the talent scheduling problem
- Improving the filtering of branch-and-bound MDD solver
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- Scheduled penalty variable neighborhood search
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
- Branch-and-check approaches for the tourist trip design problem with rich constraints
- Multi-objective optimisation models for the travelling salesman problem with horizontal cooperation
- The first \(K\) shortest unique-arc walks in a traffic-light network
- A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
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)
