Skip to main content
SpringerLink
Log in

Heuristics for the lexicographic max-ordering vehicle routing problem

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we propose fast heuristics for the vehicle routing problem (VRP) with lexicographic max-order objective. A fixed number of vehicles, which are based at a depot, are to serve customers with known demands. The lexicographic max-order objective is introduced by asking to minimize lexicographically the sorted route lengths. Based on a model for this problem, several approaches are studied and new heuristic solution procedures are discussed resulting in the development of a sequential insertion heuristic and a modified savings algorithm in several variants. Comparisons between the algorithms are performed on instances of the VRP library VRPLIB. Finally, based on the results from the computational experiments, conclusions about the applicability and efficiency of the presented algorithms are drawn.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Balinski M, Quandt R (1964) On an integer program for a delivery problem. Oper Res 12:300–304

    Google Scholar 

  • 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

  • Bullnheimer B, Hartl RF, Strauss C (1999) An improved ant system for the vehicle routing problem. Ann Oper Res 89:319–328

    Article  Google Scholar 

  • Christofides N, Eilon S (1969) An algorithm for the vehicle dispatching problem. Oper Res Q 20:309–318

    Google Scholar 

  • 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

    Google Scholar 

  • Clarke G, Wright JV (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581

    Google Scholar 

  • 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

  • Ehrgott M (1997) Multiple criteria optimization: classification and methodology. Shaker Verlag, Aachen

    Google Scholar 

  • Ehrgott M (2000) Multicriteria Optimization. Lecture notes in economics and mathematical systems. Springer, Berlin Heidelberg New York

    Google Scholar 

  • Fisher ML, Jaikumar R (1981) A generalized assignment heuristic for the vehicle routing problem. Networks 11:109–124

    Article  Google Scholar 

  • Garvin WM, Crandall HW, John JB, Spellman RA (1957) Applications of linear programming in the oil industry. Manage Sci 3:407–430

    Google Scholar 

  • Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manage Sci 40:1276–1290

    Google Scholar 

  • 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

    Google Scholar 

  • 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

    Google Scholar 

  • Gillet BE, Miller LR (1974) A heuristic algorithm for the vehicle dispatch problem. Oper Res 22:340–349

    Google Scholar 

  • Golden BL und Assad AA (1988) Vehicle routing: methods and studies. North Holland, Amsterdam

    Google Scholar 

  • Golden BL, Wasil EA, Kelly JP, Chao IM (1998) Metaheuristics vehicle routing. In: Crainic TG, Laporte G (eds) Fleet management and logistics. Kluwer, Boston

    Google Scholar 

  • 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

    Google Scholar 

  • 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

  • Kindervater GAP, Savelsbergh MWP (1997) Vehicle routing: Handling edge exchanges. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chichester

    Google Scholar 

  • Laporte G, Nobert Y (1987) Exact algorithms for the vehicle routing problem. Ann Discrete Math 31:147–184

    Google Scholar 

  • Laporte G (1998) Exact algorithms for the traveling salesman problem and the vehicle routing problem. Les cahiers du GERARD G-98-37

  • Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498–516

    Google Scholar 

  • Mole RH, Jameson SR (1976) A sequential route-building algorithm employing a generalized savings criterion. Oper Res Q 27:503–511

    Article  Google Scholar 

  • Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41:421–451

    Article  Google Scholar 

  • Rego C (1998) A subpath ejection method for the vehicle routing problem. Manage Sci 44:1447–1459

    Google Scholar 

  • 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

    Article  Google Scholar 

  • Renaud J, Boctor FF, Laporte G (1996) An improved petal heuristic for the vehicle routing problem. J Oper Res Soc 47:329–336

    Article  Google Scholar 

  • 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

  • Taillard ED (1993) Parallel iterative search methods for vehicle routing problems. Networks 23:661–673

    Article  Google Scholar 

  • Thompson PM, Psaraftis HN (1993) Cycling transfer algorithms for multi-vehicle routing and scheduling problems. Oper Res 41:935–946

    Google Scholar 

  • Toth P, Vigo D (2002a) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl Math 123:487–512

    Article  Google Scholar 

  • Toth P, Vigo D (2002b) The vehicle routing problem. SIAM Monogr Discrete Math Appl, Society for Industrial and Applied Mathematics, Philadelphia, Pennsylavania.

  • Vigo D (2000) VRPLIB: a vehicle routing problem instances library. Technical Report OR/00/3, Università di Bologna, Italy

  • Xu J, Kelly JP (1996) A network flow-based tabu search heuristic for the vehicle routing problem. Transp Sci 30:379–393

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Optimization, Dynamical Systems and Discrete Mathematics, Graz University of Technology, Steyrergasse 30, 8010, Graz, Austria

    Sleman Saliba

Authors
  1. Sleman Saliba
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sleman Saliba.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Saliba, S. Heuristics for the lexicographic max-ordering vehicle routing problem. 14, 313–336 (2006). https://doi.org/10.1007/s10100-006-0007-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-006-0007-6

Keywords

Search

Navigation