Abstract
Purchase PDF (303 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (19)
Purchase PDF (199 K)
doi:10.1016/S0377-2217(03)00238-8 
Copyright © 2003 Elsevier B.V. All rights reserved.
Discrete Optimization
A tabu search algorithm for the open vehicle routing problem
José Brandão
Received 19 March 2001;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The problem studied in this paper is different from the basic vehicle routing problem in that the vehicles do not return to the distribution depot after delivering the goods to the customers or, if they do so, they must visit the same customers, for the collection of goods, in the reverse order. The practical importance of this problem has been established some decades ago, but it has received very little attention from researchers. In this paper we present a new tabu search algorithm that explores the structure of this type of problem and we compare its performance with another heuristic designed for the same purpose, which has been published recently.
Author Keywords: Vehicle routing; Tabu search; Open vehicle routing; Hamiltonian path
Article Outline
- 1. Introduction
- 2. The initial solution
- 3. The tabu search algorithm
- 4. Computational experiments
- 4.1. Influence of the tabu tenure and the trial swap moves
- 4.2. Influence of the initial solution
- 4.3. Influence of the improving procedures of the routes NN and US
- 4.4. Comparison of the TSA algorithm with an algorithm from the literature
- 5. Conclusions
- Acknowledgements
- References
