New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows

@article{Baldacci2012NewSR,
  title={New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows},
  author={Roberto Baldacci and Aristide Mingozzi and Roberto Roberti},
  journal={INFORMS J. Comput.},
  year={2012},
  volume={24},
  pages={356-371}
}
The traveling salesman problem with time windows (TSPTW) is the problem of finding in a weighted digraph a least-cost tour starting from a selected vertex, visiting each vertex of the graph exactly once according to a given time window, and returning to the starting vertex. This nP-hard problem arises in routing and scheduling applications. This paper introduces a new tour relaxation, called ngL-tour, to compute a valid lower bound on the TSPTW obtained as the cost of a near-optimal dual… Expand
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
TLDR
Two integer linear programming formulations for GTSPTW are provided as well as several problem-specific valid inequalities and a branch-and-cut algorithm is developed in which the inequalities are separated dynamically. Expand
Mixed integer programming formulations for the generalized traveling salesman problem with time windows
The generalized traveling salesman problem with time windows (GTSPTW) is defined on a directed graph where the vertex set is partitioned into clusters. One cluster contains only the depot. EachExpand
A General Variable Neighborhood Search Heuristic for the Traveling Salesman Problem with Time Windows under Completion Time Minimization
We propose a two-phase general variable neighborhood search (GVNS) heuristic to solve the traveling salesman problem with time windows (TSPTW) when the objective is to minimize the completion timeExpand
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks
TLDR
An approach in which the strength of a time-expanded integer linear programming (IP) formulation is exploited without ever explicitly creating the complete formulation is explored, and results illustrate the potential of the approach as optimal solutions can be identified in only a few iterations. Expand
Dynamic Programming for the Minimum Tour Duration Problem
TLDR
This work presents a new effective dynamic programming (DP)-based approach for the minimum tour duration problem, and defines consistent resource extension functions (REF) so that dominance is straightforward using componentwise comparison for the respective resource vectors. Expand
A Decomposition Algorithm for the Consistent Traveling Salesman Problem with Vehicle Idling
TLDR
This paper addresses the consistent traveling salesman problem via a new, exact algorithm that decomposes the problem into a sequence of single-period traveling salesman problems with time windows within a branch-and-bound search procedure. Expand
Dynamic NG-path Relaxation
In [1] we introduced a new state-space relaxation, called ng-path relaxation, to compute lower bounds to routing problems, such as the Capacitated Vehicle Routing Problem (CVRP) and the VRP with TimeExpand
An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
TLDR
This work extends the use of MDDs for solving routing problems by presenting new construction methods and filtering rules based on capacity restrictions by using the MDDs as a subproblem to a Lagrangian relaxation technique, leading to significant improvements in both bound quality and run-time performance. Expand
An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems: Technical report
TLDR
The implementation of an extension of the Lin-Kernighan-Helsgaun TSP solver, which is able to solve a variety of well-known problems, including the sequential ordering problem, the traveling repairman problem, variants of the multiple travel-ing salesman problem, as well as vehicle routing problems with capacity, time windows, pickup-and-delivery and distance constraints. Expand
Solving the Time Dependent Minimum Tour Duration and Delivery Man Problems with Dynamic Discretization Discovery
In this paper, we present exact methods for solving the Time Dependent Minimum Duration Problem (TDMTDP) and the Time Dependent Delivery Man Problem (TD-DMP). Both methods are based on a DynamicExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
TLDR
This paper describes an exact algorithm to solve the problem that is based on dynamic programming and makes use of bounding functions to reduce the state space graph by means of a new technique that is a generalization of the “State Space Relaxation” for dynamic programming introduced by Christofides et al. Expand
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
TLDR
An extended formulation for the traveling salesman problem with time windows based on partitioning the time windows into subwindows that the authors call buckets is presented and the LP relaxation of this formulation yields strong lower bounds for the TSPTW and provides a good starting point for the branch-and-cut algorithm. Expand
Technical Note - An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
TLDR
The dual of the formulation is shown to be a disjunctive graph model, which is well known from scheduling theory, and a longest path algorithm is used to obtain bounding information for subproblems in a branch and bound solution procedure. Expand
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
TLDR
An implementation of the dynamic-programming algorithm for the general case when the integerk is replaced with city-specific integersk( j),j = 1, . Expand
A polyhedral study of the asymmetric traveling salesman problem with time windows
TLDR
This paper presents a formulation of the ATSP-TW problem involving only 0/1-variables associated with the arcs of the underlying digraph, and shows that determining the dimension of PTW is strongly NP–complete problem, even if only one time window is present. Expand
State-space relaxation procedures for the computation of bounds to routing problems
TLDR
This paper gives a survey of a general relaxation procedure whereby the state-space associated with a given dynamic programming recursion is relaxed in such a way that the solution to the relaxed recursion provides a bound which could be embedded in general branch and bound schemes for the solution of the problem. Expand
Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows
TLDR
A tabu search heuristic is developed that allows, in most iterations, the generation of negative reduced cost columns in a short computation time for the ESPPRC, and a generalization of the k-path inequalities is introduced. Expand
A Hybrid Exact Algorithm for the TSPTW
TLDR
It is shown with extensive computational results that the synergy between Operations Research optimization techniques embedded in global constraints, and Constraint Programming constraint solving techniques, makes the resulting framework effective in the TSPTW context also if these results are compared with state-of-the-art algorithms from the literature. Expand
A New Heuristic for the Traveling Salesman Problem with Time Windows
  • R. W. Calvo
  • Mathematics, Computer Science
  • Transp. Sci.
  • 2000
TLDR
A new heuristic method is presented for the Traveling Salesman Problem with Time Windows, based on the solution of an auxiliary problem to solve an assignment problem with an ad hoc objective function to obtain a solution close enough to a feasible solution of the original problem. Expand
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
This paper presents a constraint logic programming model for the traveling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictiveExpand
...
1
2
3
...