Heuristics for the lexicographic max-ordering vehicle routing problem

Central European Journal of Operations Research

Volumn 14, Issue 3, 2006, Pages 313-336

  Saliba, Sleman ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750919782     PISSN: 1435246X     EISSN: 16139178     Source Type: Journal    
DOI: 10.1007/s10100-006-0007-6     Document Type: Article

References (35)

1. Balinski M, Quandt R (1964) On an integer program for a delivery problem. Oper Res 12:300-304
2. Van Breedam A (1994) An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related and time-related constraints. PhD Dissertation, University of Antwerp
3. Bullnheimer B, Hartl RF, Strauss C (1999) An improved ant system for the vehicle routing problem. Ann Oper Res 89:319-328
4. Christofides N, Eilon S (1969) An algorithm for the vehicle dispatching problem. Oper Res Q 20:309-318
5. Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 315-338
6. Clarke G, Wright JV (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568-581
7. Cordeau JF, Gendreau M, Hertz A, Laporte G, Sormany JS (2004) New heuristics for the vehicle routing problem, Le cahiers du GERAD G-2004-33
8. Ehrgott M (1997) Multiple criteria optimization: classification and methodology. Shaker Verlag, Aachen
9. Ehrgott M (2000) Multicriteria Optimization. Lecture notes in economics and mathematical systems. Springer, Berlin Heidelberg New York
10. Fisher ML, Jaikumar R (1981) A generalized assignment heuristic for the vehicle routing problem. Networks 11:109-124
11. Garvin WM, Crandall HW, John JB, Spellman RA (1957) Applications of linear programming in the oil industry. Manage Sci 3:407-430
12. Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manage Sci 40:1276-1290
13. Ghaziri H (1991) Solving routing problems by a self-organising map. In: Kohonen T, Makisara K, Simula O, Kangas J (eds) Artificial neural networks. North-Holland, Amsterdam
14. Ghaziri H (1996) Supervision in the self-organizing map: applications to the vehicle routing probelem. In: Osman IH, Kelly JP (eds) Meta-heuristics: theory and applications. Kluwer, Boston
15. Gillet BE, Miller LR (1974) A heuristic algorithm for the vehicle dispatch problem. Oper Res 22:340-349
16. Golden BL und Assad AA (1988) Vehicle routing: methods and studies. North Holland, Amsterdam
17. Golden BL, Wasil EA, Kelly JP, Chao IM (1998) Metaheuristics vehicle routing. In: Crainic TG, Laporte G (eds) Fleet management and logistics. Kluwer, Boston
18. Groetschel M, Krumke SO, Rambau J, Torres LM (2002) Making the yellow angels fly: online Dispatching of service vehicles in real time. SIAM Newsl 35:10-11
19. Jozefowiez N, Semet F, Talbi E-G (2002) Parallel and hybrid models for multi-objective optimization: application to the vehicle routing problem. Lecture Notes in Computer Science, vol 2439, Springer, Berlin Heidelberg New York, pp 271-280
20. Kindervater GAP, Savelsbergh MWP (1997) Vehicle routing: Handling edge exchanges. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chichester
21. Laporte G, Nobert Y (1987) Exact algorithms for the vehicle routing problem. Ann Discrete Math 31:147-184
22. Laporte G (1998) Exact algorithms for the traveling salesman problem and the vehicle routing problem. Les cahiers du GERARD G-98-37
23. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498-516
24. Mole RH, Jameson SR (1976) A sequential route-building algorithm employing a generalized savings criterion. Oper Res Q 27:503-511
25. Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41:421-451
26. Rego C (1998) A subpath ejection method for the vehicle routing problem. Manage Sci 44:1447-1459
27. Reimann M, Doerner K, Hartl RF (2004) D-Ants: savings based ants divide and conquer the vehicle routing problem. Comput Oper Res 31:563-591
28. Renaud J, Doctor FF, Laporte G (1996) An improved petal heuristic for the vehicle routing problem. J Oper Res Soc 47:329-336
29. Schumann M, Retzko R (1995) Self-organising maps for vehicle routing problems - minimizing an explizit cost function. In: Fogelmann-Soulie F (ed) Proceedings of the international conference on artificial neural networks, Paris
30. Taillard ED (1993) Parallel iterative search methods for vehicle routing problems. Networks 23:661-673
31. Thompson PM, Psaraftis HN (1993) Cycling transfer algorithms for multi-vehicle routing and scheduling problems. Oper Res 41:935-946
32. Toth P, Vigo D (2002a) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl Math 123:487-512
33. Toth P, Vigo D (2002b) The vehicle routing problem. SIAM Monogr Discrete Math Appl, Society for Industrial and Applied Mathematics, Philadelphia, Pennsylavania.
34. Vigo D (2000) VRPLIB: a vehicle routing problem instances library. Technical Report OR/00/3, Università di Bologna, Italy
35. Xu J, Kelly JP (1996) A network flow-based tabu search heuristic for the vehicle routing problem. Transp Sci 30:379-393