A tabu search algorithm for the open vehicle routing problem

European Journal of Operational Research

Volumn 157, Issue 3, 2004, Pages 552-564

  Brandão, José ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

Hamiltonian path; Open vehicle routing; Tabu search; Vehicle routing

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; HAMILTONIANS; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

HAMILTONIAN PATH; OPEN VEHICLE ROUTING; TABU SEARCH; VEHICLE ROUTING PROBLEMS (VRP);

OPERATIONS RESEARCH;

EID: 2342542416     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00238-8     Document Type: Article

References (21)

1. Bodin L., Golden B., Assad A., Ball M. Routing and scheduling of vehicles and crews: The state of the art. Computers and Operations Research. 10(2):1983;63-211.
2. Brandão J. A lower bound based meta-heuristic for the vehicle routing problem. Ribeiro C., Hansen P. Essays and Surveys in Metaheuristics. 2001;151-168 Kluwer Academic Publishers.
3. Brandão J., Mercer A. A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. European Journal of Operational Research. 100(1):1997;180-191.
4. Brandão J., Mercer A. The multi-trip vehicle routing problem. Journal of the Operational Research Society. 49:1998;799-805.
5. Christofides N., Mingozzi A., Toth P. The vehicle routing problem. Christofides N., Mingozzi A., Toth P., Sandi C. Combinatorial Optimization. 1979;313-338 Wiley, Chichester.
6. Christofides N., Mingozzi A., Toth P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relations. Mathematical Programming. 20:1981;255-282.
7. Crainic T., Laporte G. Fleet Management and Logistics. 1998;Kluwer Academic Publishers.
8. Fisher M. Optimal solution of vehicle routing problems using minimum k-trees Operations Research. 42(4):1994;626-642.
9. Fisher M. A polynomial algorithm for the degree-constrained minimum. k -tree problem Operations Research. 42(4):1994;775-779.
10. Gendreau M., Hertz A., Laporte G. New insertion and post-optimization procedures for the traveling salesman problem. Operations Research. 40(6):1992;1086-1094.
11. Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing. Management Science. 40(10):1994;1276-1290.
12. Laporte G. The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research. 59(3):1992;345-358.
13. Osman I. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Glover F., Laguna M., Taillard E., Werra D. Annals of Operations Research. vol. 41:1993;421-451 J.C. Baltzer AG, Science Publishers, Basel-Switzerland.
14. Rochat Y., Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics. 1:1995;147-167.
15. Sariklis D., Powell S. A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society. 51:2000;564-573.
16. Schrage L. Formulation and structure of more complex/realistic routing and scheduling problems. Networks. 11:1981;229-232.
17. Syslo M., Deo N., Kowaklik J. Discrete Optimization Algorithms with Pascal Programs. 1983;Prentice Hall, Inc.
18. Taillard E. Parallel iterative search methods for the vehicle routing problems. Networks. 23:1993;661-673.
19. Toth, P., Vigo, D., submitted. The granular tabu search (and its application to the vehicle routing problem). INFORMS Journal on Computing, submitted for publication.
20. Van Breedam A. Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers and Operations Research. 28:2001;289-315.
21. Xu J., Kelly J. A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science. 30:1996;379-393.