Skip to main content

Advertisement

SpringerLink
Log in

A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm

  • Original Article
  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The Vehicle Routing Problem (VRP) is one of the most well studied problems in operations research, both in real life problems and for scientific research purposes. During the last 50 years a number of different formulations have been proposed, together with an even greater number of algorithms for the solution of the problem. In this paper, the VRP is formulated as a problem of two decision levels. In the first level, the decision maker assigns customers to the vehicles checking the feasibility of the constructed routes (vehicle capacity constraints) and without taking into account the sequence by which the vehicles will visit the customers. In the second level, the decision maker finds the optimal routes of these assignments. The decision maker of the first level, once the cost of each routing has been calculated in the second level, estimates which assignment is the better one to choose. Based on this formulation, a bilevel genetic algorithm is proposed. In the first level of the proposed algorithm, a genetic algorithm is used for calculating the population of the most promising assignments of customers to vehicles. In the second level of the proposed algorithm, a Traveling Salesman Problem (TSP) is solved, independently for each member of the population and for each assignment to vehicles. The algorithm was tested on two sets of benchmark instances and gave very satisfactory results. In both sets of instances the average quality is less than 1%. More specifically in the set with the 14 classic instances proposed by Christofides, the quality is 0.479% and in the second set with the 20 large scale vehicle routing problems, the quality is 0.826%. The algorithm is ranked in the tenth place among the 36 most known and effective algorithms in the literature for the first set of instances and in the sixth place among the 16 algorithms for the second set of instances. The computational time of the algorithm is decreased significantly compared to other heuristic and metaheuristic algorithms due to the fact that the Expanding Neighborhood Search Strategy is used.

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

  1. Baker B.M., Ayechew M.A. (2003) A genetic algorithm for the vehicle routing problem. Comput. Oper. Res. 30(5): 787–800

    Article  Google Scholar 

  2. Barbarosoglu G., Ozgur D. (1999) A tabu search algorithm for the vehicle routing problem. Comput. Oper. Res. 26, 255–270

    Article  Google Scholar 

  3. Berger J., Mohamed B.: A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 646–656. Chicago (2003)

  4. Bodin L., Golden B. (1981) Classification in vehicle routing and scheduling. Networks 11, 97–108

    Article  Google Scholar 

  5. Bodin L., Golden B., Assad A., Ball M. (1983) The state of the art in the routing and scheduling of vehicles and crews. Comput. and Oper. Res. 10, 63–212

    Article  Google Scholar 

  6. Bullnheimer B., Hartl P.F., Strauss C. (1999) An improved ant system algorithm for the vehicle routing problem. Ann. Oper. Res. 89, 319–328

    Article  Google Scholar 

  7. Christofides N.: Vehicle routing. In: Lawer E.L., Lenstra J.K., Rinnoy Kan A.H.G., (ed.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, pp. 431–448. New York (1985)

  8. Cordeau J.F., Gendreau M., Laporte G., Potvin J.Y., Semet F. (2002) A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53, 512–522

    Article  Google Scholar 

  9. Coy S.P., Golden B.L., Runger G.C., Wasil E.A. (2001) Using experimental design to effective parameter settings for heuristics. J. Heuristics 7(1): 77–97

    Article  Google Scholar 

  10. Fisher M.L., Jaikumar R. (1979) A generalized assignment heuristic for vehicle routing. In: Golden B., Bodin L.(ed) Proceedings of the International Workshop on Current and Future Directions in the Routing and Scheduling of Vehicles and Crews. New York, Wiley, pp. 109–124

    Google Scholar 

  11. Fisher M.L.: Vehicle routing. In: Ball M.O., Magnanti T.L., Momma C.L., Nemhauser G.L. (eds.) Network Routing, Handbooks in Operations Research and Management Science, vol. 8, pp. 1–33 (1995)

  12. Garfinkel R., Nemhauser G. (1972) Integer Programming. J Wiley, New York

    Google Scholar 

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

    Google Scholar 

  14. Gendreau M., Laporte G., Potvin, J-Y. (1997) Vehicle routing: modern heuristics. In: Aarts E.H.L., Lenstra J.K. (eds) Local Search in Combinatorial Optimization. Wiley, Chichester, pp. 311–336

    Google Scholar 

  15. Gendreau M., Laporte G., Potvin J.Y.: Metaheuristics for the capacitated VRP. In: Toth P., Vigo. D. The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications, Philadelphia, MA SIAM, pp.129–154.

  16. Golden B.L., Assad A.A. (1988) Vehicle Routing: Methods and Studies. North Holland, Amsterdam

    Google Scholar 

  17. Golden B.L., Wasil E.A., Kelly J.P., Chao I.M. (1998) The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic T.G., Laporte G. (eds) Fleet Management and Logistics. Kluwer Academic Publishers, Boston, pp. 33–56

    Google Scholar 

  18. Hansen P., Mladenovic N. (2001) Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467

    Article  Google Scholar 

  19. Held M., Karp R.M. (1970) The traveling salesman problem and minimum spanning trees. Oper. Res. 18, 1138–1162

    Google Scholar 

  20. Laporte G., Gendreau M., Potvin J.-Y., Semet F. (2000) Classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7, 285–300

    Article  Google Scholar 

  21. Laporte G., Semet F. (2002) Classical heuristics for the capacitated VRP. In: Toth P., Vigo D. (eds) The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia PA, pp. 109–128

    Google Scholar 

  22. Lawer E.L., Lenstra J.K., Rinnoy Kan A.H.G., Shmoys D.B. (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York

    Google Scholar 

  23. Li F., Golden B., Wasil E. (2005) Very large-scale vehicle routing: new test problems, algorithms and results, Comput. Oper. Res. 32(5): 1165–1179

    Google Scholar 

  24. Lin S. (1965) Computer solutions of the traveling salesman problem. Bell Sys. Tech. J. 44, 2245–2269

    Google Scholar 

  25. Marinakis Y.: Vehicle Routing in Distribution Problems. Ph. D. Thesis. Department of Production Engineering and Management, Technical University of Crete, Chania, Greece (2005)

  26. Marinakis Y., Migdalas A., (2002) Heuristic Solutions of Vehicle Routing Problems in Supply Chain Management. In: Pardalos P.M., Migdalas A., Burkard R. (eds) Combinatorial and Global Optimization. World Scientific Publishing Co, Singapore, pp. 205–236

    Google Scholar 

  27. Marinakis Y., Migdalas A., Pardalos P.M. (2005) Expanding neighborhood GRASP for the traveling salesman problem. Comput. Optim. Appl. 32, 231–257

    Article  Google Scholar 

  28. Marinakis Y., Migdalas A., Pardalos P.M. (2005) A Hybrid Genetic-GRASP algortihm using langrangean relaxation for the traveling salesman problem. J. Comb. Optim. 10, 311–326

    Article  Google Scholar 

  29. Marinakis Y., Migdalas A., Pardalos P.M.: Multiple phase neighborhood search GRASP based on Lagrangian relaxation and random backtracking Lin–Kernighan for the traveling salesman problem (submitted in Optimization Methods and Software (2006))

  30. Migdalas A., Pardalos P. (1995) Nonlinear bilevel problems with convex second level problem—Heuristics and descent methods. In: Du D.-Z. et al., (eds) Operations Research and its Application. World Scientific, Singapore, pp. 194–204

    Google Scholar 

  31. Osman I.H. (1993) Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems. Ann. Oper. Res. 41, 421–451

    Article  Google Scholar 

  32. Prins C. (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31, 1985–2002

    Article  Google Scholar 

  33. Reimann M., Stummer M., Doerner K.: A savings based ant system for the vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, 1317–1326. New York (2002)

  34. Reimann M., Doerner K., Hartl R.F. (2004) D-Ants: savings based ants divide and conquer the vehicle routing problem. Comput. Oper. Res. 31(4): 563–591

    Article  Google Scholar 

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

    Google Scholar 

  36. Rego C. (2001) Node-ejection chains for the vehicle routing problem: sequential and parallel algorithms. Parallel Comput. 27(3): 201–222

    Article  Google Scholar 

  37. Resende M.G.C., Ribeiro C.C. (2003) Greedy Randomized Adaptive Search Procedures. In: Glover F., Kochenberger G.A. (eds) Handbook of Metaheuristics. Kluwer Academic Publishers, Boston, pp. 219–249

    Chapter  Google Scholar 

  38. Rochat Y., Taillard E.D. (1995) Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147–167

    Article  Google Scholar 

  39. Taillard E.D. (1993) Parallel iterative search methods for vehicle routing problems. Networks 23, 661–672

    Article  Google Scholar 

  40. Tarantilis C.D. (2005) Solving the vehicle routing problem with adaptive memory programming methodology. Comput. Oper. Res. 32(9): 2309–2327

    Article  Google Scholar 

  41. Tarantilis C.D., Kiranoudis C.T., Vassiliadis V.S. (2002) A backtracking adaptive threshold accepting metaheuristic method for the Vehicle Routing Problem. Sys. Anal. Model. Simul. (SAMS) 42(5): 631–644

    Google Scholar 

  42. Tarantilis C.D., Kiranoudis C.T., Vassiliadis V.S. (2002) A list based threshold accepting algorithm for the capacitated vehicle routing problem. Int. J. Comput. Math. 79(5): 537–553

    Article  Google Scholar 

  43. Tarantilis C.D., Kiranoudis C.T. (2002) BoneRoute: an adaptive memory-based method for effective fleet management. Ann. Oper. Res. 115(1): 227–241

    Article  Google Scholar 

  44. Toth P., Vigo D. (2002a) The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications. SIAM Philadelphia, PA

    Google Scholar 

  45. Toth P., Vigo D. (2002b) An overview of Vehicle Routing Problems. In: Toth P., Vigo D. (eds) The Vehicle Routing Problem, Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia MA, pp. 1–26

    Google Scholar 

  46. Toth P., Vigo D. (2003) The granular tabu search (and its application to the vehicle routing problem). INFORMS J. Comput. 15(4): 333–348

    Article  Google Scholar 

  47. Xu J., Kelly J.P. (1996) A new network flow-based tabu search heuristic for the vehicle routing problem. Transportation Sci. 30, 379–393

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Decision Support Systems Laboratory, Department of Production Engineering and Management, Technical University of Crete, 73100, Chania, Greece

    Yannis Marinakis & Athanasios Migdalas

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

Authors
  1. Yannis Marinakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Athanasios Migdalas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yannis Marinakis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marinakis, Y., Migdalas, A. & Pardalos, P.M. A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. J Glob Optim 38, 555–580 (2007). https://doi.org/10.1007/s10898-006-9094-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-006-9094-0

Keywords

Search

Navigation