Vehicle routeing with multiple use of vehicles

Journal of the Operational Research Society

Volumn 47, Issue 8, 1996, Pages 1065-1070

  Taillard, Éric D ^a   Laporte, Gilbert ^a   Gendreau, Michel ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Heuristic; Tabu search; Vehicle routeing problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; PLANNING; PROBLEM SOLVING; TRANSPORTATION ROUTES; VEHICLES;

TABU SEARCH; VEHICLE ROUTEING;

OPERATIONS RESEARCH;

EID: 0030216724     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.133     Document Type: Article

References (15)

1. G. Laporte (1992) The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Opl Res. 59, 345-358.
2. A. A. Assad (1988) Modeling and implementation issues in vehicle routing. In Vehicle Routing: Methods and Studies. (B. L. Golden and A. A. Assad, Eds) pp. 7-45. North-Holland, Amsterdam.
3. G. Laporte and I. H. Osman (1995) Routing problems: A bibliography. Ann. of Opns. Res. 61, 227-262.
4. B. Fleischmann (1990) The vehicle routing problem with multiple use of vehicles. Working paper, Fachbereich Wirts- chaftswissenschaften, Universitat Hamburg.
5. E. Taillard (1993) Parallel iterative search methods for vehicle routing problems. Networks 23, 661-676.
6. M. Gendreau, A. Hertz and G. Laporte (1994) A tabu search heuristic for the vehicle routing problem. Mgmt Sci. 40, 1276-1290.
7. Y. Rochat and fi. Taillard (1995) Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147-167.
8. J. H. Holland (1976) Adaptations in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan.
9. J.-Y. Potvin and S. Bengio (1996) The vehicle routing problem with time windows—Part II: Genetic Search. INFORMS J. Computing. Forthcoming.
10. B. A. Foster and D. M. Ryan (1976) An integer programming approach to the vehicle scheduling problem. Opl Res. Q. 27, 367-384.
11. D. M. Ryan, C. Hjorring and F. Glover (1993) Extension of the petal method for vehicle routeing. J. Opl Res. Soc. 44, 289-296.
12. J. Renaud, F. F. Boctor and G. Laporte (1996) An improved petal heuristic for the vehicle routeing problem. J. Opl Res. Soc. 47, 329-336.
13. S. Martello and P. Toth (1990) Knapsack Problems. Wiley, Chichester.
14. N. Christofides, A. Mingozzi and P. Toth (1979) The vehicle routing problem. In Combinatorial Optimization. (N. Christofides, A. Mingozzi, P. Toth and C. Sandi, Eds) pp. 313-338. Wiley, Chichester.
15. M. L. Fisher (1994) Optimal solution of vehicle routing problems using minimum K-trees. Opns Res. 42, 626-642.