Skip to main content
SpringerLink
Log in

Comparison the Genetic Algorithm and Selected Heuristics for the Vehicle Routing Problem with Capacity Limitation

  • Chapter
  • First Online:
Developments in Information & Knowledge Management for Business Applications

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 377))

  • 887 Accesses

Abstract

The main objective of the research was to compare the operation of the genetic algorithm with selected heuristics (savings heuristics, Dijkstra heuristic, Christofides heuristics) for the routing problem with capacity constraints, for which the following comparison criteria were defined: time to find a solution, filling the fleet and accuracy of the solution. The article analyzes five random data sets differing in the location of points (cities) and the size of orders. Such a variety of data made it possible to analyze the effectiveness of selected heuristics. Results from genetic algorithm was compared with other heuristic. The results are presented in appropriate graphs, which facilitates the analysis of the results and their comparison.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. https://developers.google.com/optimization/routing

  2. https://developers.google.com/optimization/routing/cvrp

  3. Gutin, G., Punnen, A.P.: The traveling salesman problem and its variations (2001). https://doi.org/10.1007/b101971

  4. Suthikarnnarunai, N.: A Sweep Algorithm for the Mix Fleet Vehicle Routing Problem. IMECS (2008). ISBN: 978-988-17012-1-3

    Google Scholar 

  5. Ding, D., Zou, X.: The Optimization of Logistics Distribution Route Based on Dijkstra’s Algorithm and C-W Savings Algorithm, pp. 957–958 (2016). https://doi.org/10.2991/mmebc-16.2016.200

  6. Letchford, A., Lysgaard, J., Eglese, R.: A branch-and-cut algorithm for the capacitated open vehicle routing problem. J. Oper. Res. Soc. 1642–1651 (2007)

    Google Scholar 

  7. Chepuri, K., Homem-de-Mello, T.: Solving the vehicle routing problem with stochastic demands using the cross-entropy method. Ann. Oper. Res. 153–181 (2005)

    Google Scholar 

  8. Dror, M., Trudeau, P.: Savings by Split Delivery Routing. Transportation Science 23(2), 141–145 (1989)

    Article  Google Scholar 

  9. Dror, M., Trudeau, P.: Split delivery routing. Naval Research Logistics 37, 383–402 (1990). https://doi.org/10.1002/nav.3800370304

  10. Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with split deliveries (1994). https://doi.org/10.1016/0166-218X(92)00172-I

  11. Golden, B.L., Raghavan, S., Wasil, E.: The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 422–426 (2008). https://doi.org/10.1007/978-0-387-77778-8

  12. Dror, M.: Arc Routing: Theory, Solutions and Applications. Springer (2000). https://doi.org/10.1007/978-1-4615-4495-1

  13. Zanjirani Farahani, R., Miandoabchi, E.: Graph Theory for Operations Research and Management: Applications in Industrial Engineering. IGI Global (2012). ISBN: 978-1466626614

    Google Scholar 

  14. Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics 123(1–3), 487–512 (2002). https://doi.org/10.1016/S0166-218X(01)00351-1

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

    Google Scholar 

  16. Daglayan, H., Karakaya, M.: The Impact of Crossover and Mutation Operators on a GA Solution for the Capacitated Vehicle Routing Problem. Universal Journal of Engineering Science 4(3), 39–44 (2016). https://doi.org/10.13189/ujes.2016.040301

  17. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  Google Scholar 

  18. Nazifa, H., Lee, L.S.: Optimised crossover genetic algorithm for capacitated vehicle routing problem. Applied Mathematical Modelling 36(5), 2110–2117 (2012)

    Article  MathSciNet  Google Scholar 

  19. Crevier, B., Cordeau, J.F., Laporte, G.: The multi-depot vehicle routing problem with inter-depot routes. Eur. J. Oper. Res. 756–773 (2007)

    Google Scholar 

  20. Malandraki, C., Daskin, M.: Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp. Sci. 185–200 (1992)

    Google Scholar 

  21. Zeimpekis, V., Giaglis, G.: Urban dynamic real-time distribution services: insights from SMEs. J. Enterp. Inf. Manag. 367–388 (2006)

    Google Scholar 

  22. Mourgaya, M., Vanderbeck, F.: Column generation based heuristic for tactical planning in multi-period vehicle routing. Eur. J. Oper. Res. 1028–1041 (2007)

    Google Scholar 

  23. Brandão, J.: A new tabu search algorithm for the vehicle routing problem with backhauls. Eur. J. Oper. Res. 540–555 (2006)

    Google Scholar 

  24. Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 455–472 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Technology, Lodz University of Technology, Wolczanska 215 Street, Lodz, Poland

    Joanna Ochelska-Mierzejewska & Przemysław Zakrzewski

Authors
  1. Joanna Ochelska-Mierzejewska
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Przemysław Zakrzewski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joanna Ochelska-Mierzejewska .

Editor information

Editors and Affiliations

  1. Department of Information Systems, Faculty of Management, Comenius University, Bratislava, Slovakia

    Natalia Kryvinska

  2. Institute of Information Technology, Lodz University of Technology, Łódź, Poland

    Aneta Poniszewska-Marańda

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ochelska-Mierzejewska, J., Zakrzewski, P. (2022). Comparison the Genetic Algorithm and Selected Heuristics for the Vehicle Routing Problem with Capacity Limitation. In: Kryvinska, N., Poniszewska-Marańda, A. (eds) Developments in Information & Knowledge Management for Business Applications . Studies in Systems, Decision and Control, vol 377. Springer, Cham. https://doi.org/10.1007/978-3-030-77916-0_10

Download citation

Publish with us

Policies and ethics

Search

Navigation