A subpath ejection method for the vehicle routine problem

Management Science

Volumn 44, Issue 10, 1998, Pages 1447-1459

  Rego, César ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Ejection Chains; Tabu Search; Vehicle Routing

Indexed keywords

GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; SET THEORY;

CONSTRUCTIVE ALGORITHMS; SUBPATH EJECTION METHOD; VEHICLE ROUTING PROBLEM;

ALGORITHMS;

EID: 0032181671     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.44.10.1447     Document Type: Article

References (29)

1. K. Altinkemer, B. Gavish. 1991. Parallel savings based heuristic for the delivery problem. Oper. Res. 39 456-469.
2. J. Bramel, D. Simchi-Levi. 1995. A location based heuristic for general routing problems. Oper. Res. 43 649-660.
3. N. Christofides, A. Mingozzi, P. Toth. 1979. N. Christofides, A. Mingozzi, P. Toth, C. Sandi, eds. The Vehicle Routing Problem. Combinatorial Optimisation, chapter 11, pages 315-338. Wiley, Chichester.
4. G. Clarke, J. W. Wright. 1964. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12 568-581.
5. M. Desrochers, T. Verhoog. 1989. A matching based algorithm for the vehicle routing problem. Technical Report Cahier du GERAD G-89-04, Ecole de Haultes Etudes Commerciales de Montréal.
6. M. L. Fisher. 1994. Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42 626-642.
7. _, R. Jaikumar. 1981. A generalized assignment heuristic for vehicle routing. Networks 11 109-124.
8. B. Foster, D. Ryan. 1976. An integer programming approach to the vehicle scheduling problem. Oper. Res. Quart. 27 307-384.
9. M. Gendreau, A. Hertz, G. Laporte. 1994. Tabu search heuristic for the vehicle routing problem. Management Sci. 40 1276-1290.
10. _, G. Laporte, J.-Y. Potvin. 1994. Metaheuristics for the vehicle routing problem. Technical Report CRT-963, Centre de Recherche sur les Transports, Université de Montréal.
11. B. E. Gillett, L. R. Miller. 1974. A heuristic algorithm for the vehicle dispatch problem. Oper. Res. 22 340-349.
12. F. Glover. 1992. New ejection chain and alternating path methods for traveling salesman problems. Computer Sci. and Oper. Res. 449-509.
13. _. 1995a. Tabu search fundamentals and uses. Technical Report, Graduate School of Business and Administration, University of Colorado at Boulder.
14. _. 1995b. Tabu thresholding: Improved search by nonmonotonic trajectories. ORSA J. Comput. 7 426-442.
15. E. Hadjiconstantinou, N. Christofides, A. Mingozzi. 1996. A new exact algorithm for the vehicle routing problem based on q-path and k-shortest path relaxations. Ann. Oper. Res. 61 21-43.
16. F. Harche, P. Raghavan. 1991. A generalised exchange heuristic for the capacited vehicle problem. Technical Report, Stern School of Business, New York University.
17. G. Laporte. 1992. The vehicle routing problem: An overview of exact and approximate algorithms. European J. Oper. Res. 59 345-358.
18. _, I. H. Osman. 1995. Routing problems: A bibliography. Ann. Oper. Res. 61 227-262.
19. _, I. H. Osman. 1996. Metaheuristics in combinatorial optimization: A bibliography. Ann. Oper. Res. 63 513-628.
20. R. H. Mole, S. R. Jameson. 1976. A sequential route-building algorithm employing a generalised savings criterion. Oper. Res. Quart. 27 503-511.
21. I. H. Osman. 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41 421-451.
22. C. Rego. 1998. Relaxed tours and path ejections for the traveling salesman problem. European J. Oper. Res. 106 522-538.
23. _, C. Roucairol. 1994. An efficient implementation of ejection chain procedures for the vehicle routing problem. Technical Report 44, PRiSM Laboratory, University of Versailles.
24. _, C. Roucairol. 1994. Le problème de tournées de véhicules: étude et résolution approchée. Technical Report 2197, INRIA - Institut National de Recherche en Informatique et en Automatique.
25. _, C. Roucairol. 1995. Using tabu search for solving a dynamic multi-terminal truck dispatching problem. European J. Oper. Res. 83 411-429.
26. J. Renaud, F. Boctor, G. Laporte. 1996. An improved petal heuristic for the vehicle routing problem. J. Oper. Res. Soc. 17 329-336.
27. Y. Rochat, E. Taillard. 1995. Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1 147-167.
28. W. Stewart Jr., B. Golden. 1984. A Lagrangian relaxation heuristic for vehicle routing. European J. Oper. Res. 15 84-88.
29. E. Taillard. 1993. Parallel iterative search methods for vehicle routing problems. Networks 23 661-673.