A Subpath Ejection Method for the Vehicle Routing Problem

References

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