New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:2815450
DOI10.1287/ijoc.1110.0456zbMath1462.90102OpenAlexW2158762372MaRDI QIDQ2815450
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti
Publication date: 29 June 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/20ae5bfc56c71bec464a0f330da26674552e251d
Related Items
A column generation approach for a multi-attribute vehicle routing problem, Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows, Pricing routines for vehicle routing with time windows on road networks, Scheduled penalty variable neighborhood search, Stochastic decision diagrams, Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows, Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, Mixed integer programming formulations for the generalized traveling salesman problem with time windows, A branch-and-cut algorithm for the generalized traveling salesman problem with time windows, The bus sightseeing problem, Decision Diagrams for Discrete Optimization: A Survey of Recent Advances, Exact and anytime approach for solving the time dependent traveling salesman problem with 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, An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows, Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams, Network-Based Approximate Linear Programming for Discrete Optimization, Bounding, filtering and diversification in CP-based local branching, Hybrid optimization methods for time-dependent sequencing problems, Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems, Perspectives on integer programming for time-dependent models, Comments on: ``Perspectives on integer programming for time-dependent models, Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks, Discrete Optimization with Decision Diagrams, An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP, Unconstrained binary models of the travelling salesman problem variants for quantum optimization, Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding, Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
Uses Software
Cites Work
- An exact solution framework for a broad class of vehicle routing problems
- Beam-ACO for the travelling salesman problem with time windows
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- A New Heuristic for the Traveling Salesman Problem with Time Windows
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
- A Hybrid Exact Algorithm for the TSPTW
- A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- State-space relaxation procedures for the computation of bounds to routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
