A Tabu Search Heuristic for the Vehicle Routing Problem

@inproceedings{Hertz1991ATS,
  title={A Tabu Search Heuristic for the Vehicle Routing Problem},
  author={Alain Hertz and Gilbert Laporte and Michel Gendreau},
  year={1991}
}
The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algorithm considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route, and reinserting it into another route. This is done by means of a generalized insertion procedure previously developed by the authors. During the course of the algorithm, infeasible solutions are allowed. Numerical tests… 
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
TLDR
A tabu search algorithm for the vehicle routing problem with split deliveries is described, and the results are compared with those obtained by the algorithm proposed by Dror and Trudeau.
A new tabu search heuristic for the open vehicle routing problem
TLDR
The open vehicle routing problem (OVRP) is studied, in which the vehicles are not required to return to the depot, but if they do, it must be by revisiting the customers assigned to them in the reverse order.
Using Tabu Search and the Petal Method to Solve Vehicle Routing Problems
In this talk we will present a new tabu search heuristic for the Vehicle Routing Problem. The algorithm uses tabu search to direct an optimal but overconstrained vehicle routing method, namely the
A Voronoi Tabu Search Algorithm for the Capacitated Vehicle Routing Problem
【This paper focuses on the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer must be visited exactly once by one vehicle starting and
Tabu Search heuristics for the Vehicle Routing Problem with Time Windows
TLDR
This paper surveys the research on the Tabu Search heuristics for the Vehicle Routing Problem with Time Windows and describes basic features of each method, and experimental results for Solomon's benchmark test problems are presented and analyzed.
Heuristic Procedures for the Capacitated Vehicle Routing Problem
TLDR
Two new heuristics for the Capacitated Vehicle Routing Problem (CVRP) are presented, the first one solves the problem from scratch, while the second one uses the information provided by a strong linear relaxation of the original problem.
A tabu search algorithm for the vehicle routing problem
...
...

References

SHOWING 1-10 OF 21 REFERENCES
VEHICLE ROUTING PROBLEMS VIA TABU SEARCH METAHEURISTIC
This paper addresses the application of the Tabu Search technique to the vehicle routing problem with time windows constraints. A simple adaptation of Tabu Search which uses only a short term memory
Solving real-life vehicle routing problems efficiently using tabu search
TLDR
This paper presents a tabu search based method for finding good solutions to a real-life vehicle routing problem that takes the heterogeneous character of the fleet into account and obtains solutions that are significantly better than those previously developed and implemented in practice.
Parallel Savings Based Heuristics for the Delivery Problem
TLDR
The paper presents parallel savings algorithms PSAs for generating feasible solutions to the delivery problem, and the average quality of solutions generated by PSAs is shown to be significantly superior on large sets of test problems.
A generalized assignment heuristic for vehicle routing
TLDR
This paper presents a heuristic for this problem in which an assignment of customers to vehicles is obtained by solving a generalized assignment problem with an objective function that approximates delivery cost and shows that it has outperformed the best existing heuristics on a sample of standard test problems.
Bounds and Heuristics for Capacitated Routing Problems
TLDR
Asymptotically optimal bounds and heuristics are developed for a capacitated routing problem that will find a solution with relative error at most (epsilon) in time polynomial in the number of customers.
A Dual Heuristic for Vehicle Scheduling
TLDR
A heuristic method is used to solve the vehicle scheduling problem by maintaining local optimality whilst approaching the feasible region and giving results comparable with the best published algorithms.
Polyhedral study of the capacitated vehicle routing problem
TLDR
The capacitated vehicle routing problem (CVRP) considered in this paper occurs when goods must be delivered from a central depot to clients with known demands, usingk vehicles of fixed capacity, and a cutting plane algorithm that only uses inequalities from the above classes is reported on.
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
TLDR
An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
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.
A Sequential Route-building Algorithm Employing a Generalised Savings Criterion
TLDR
A new method for vehicle scheduling, based upon sequential generation of vehicle routes, is described in this paper, and the possibility of several journeys being made by each vehicle is actively considered, and vehicle utilisation is high in consequence.
...
...