A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows

@article{Ohlmann2007ACH,
  title={A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows},
  author={Jeffrey W. Ohlmann and Barrett W. Thomas},
  journal={INFORMS J. Comput.},
  year={2007},
  volume={19},
  pages={80-90}
}
This paper describes a variant of simulated annealing incorporating a variable penalty method to solve the traveling-salesman problem with time windows (TSPTW). Augmenting temperature from traditional simulated annealing with the concept of pressure (analogous to the value of the penalty multiplier), compressed annealing relaxes the time-window constraints by integrating a penalty method within a stochastic search procedure. Computational results validate the value of a variable-penalty method… Expand
An Iterative Insertion Algorithm and a Hybrid Meta Heuristic for the Traveling Salesman Problem with Time Windows
TLDR
Computational tests performed on 400 benchmark problem instances show that the proposed algorithm generates optimal or near-optimal solutions in most cases. Expand
A Beam Search Heuristic for the Traveling Salesman Problem with Time Windows
TLDR
A beam search (BS) algorithm which is a heuristic based on breadth-first branch-and-bound without backtracking to solve the TSPTW, a NP-hard problem which increases as the number of customers increases. Expand
A General VNS heuristic for the traveling salesman problem with time windows
TLDR
Experimental results show that this approach to the Traveling Salesman Problem with Time Windows is efficient, reducing significantly the computation time and improving some best known results from the literature. Expand
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
TLDR
A new tour relaxation is introduced, called ngL-tour, to compute a valid lower bound on the TSPTW obtained as the cost of a near-optimal dual solution of a problem that seeks a minimum-weight convex combination of nonnecessarily elementary tours. Expand
A variable iterated greedy algorithm for the traveling salesman problem with time windows
TLDR
A variable iterated greedy algorithm for solving the traveling salesman problem with time windows (TSPTW) to identify a tour minimizing the total travel cost or the makespan, separately is presented. Expand
Beam-ACO for the travelling salesman problem with time windows
TLDR
An extensive experimental evaluation shows that the proposed Beam-ACO algorithm is currently a state-of-the-art technique for the travelling salesman problem with time windows when travel-cost optimization is concerned. Expand
Scheduled penalty Variable Neighborhood Search
TLDR
This paper proposes a general heuristic framework that extends the well known Variable Neighborhood Search algorithm to include dynamic constraint penalization and calls the new algorithm scheduled-penalty Variable neighborhood Search. Expand
Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows
TLDR
This work uses stochastic sampling as an alternative to bounding information in the Beam-ACO algorithm for the travelling salesman problem with time windows and demonstrates that the proposed algorithm is currently a state-of-the-art method for the tackled problem. Expand
Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
TLDR
Because computing the deadline violations is the most time consuming part of the objective, this work focuses on developing approximations for the computation of deadline violations that lead to significant runtime improvements without loss in quality. Expand
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
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
TLDR
Tests performed on 375 instances indicate that the proposed heuristic compares very well with alternative methods and very often produces optimal or near-optimal solutions. Expand
Job Shop Scheduling by Simulated Annealing
TLDR
An approximation algorithm based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems, that can find shorter makespans than two recent approximation approaches that are more tailored to the job shop scheduling 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
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
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
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
A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
TLDR
A new two-commodity flow formulation for the traveling salesman problem, where each commodity corresponds to a resource that is either distributed or picked-up along the tour of all nodes. Expand
An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
TLDR
New elimination tests are presented which greatly enhance the performance of a relatively well established dynamic programming approach and its application to the minimization of the total traveling cost for the traveling salesman problem with time windows. Expand
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
TLDR
This work shows what needs to be done in order to adapt a constraint programming algorithm for the traveling salesman problem with time windows so that it can handle multiple time windows. Expand
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
TLDR
A new insertion procedure and a new post- optimization routine for the traveling salesman problem results in an efficient algorithm (GENIUS) which outperforms known alternative heuristics in terms of solution quality and computing time. Expand
...
1
2
3
4
...