Skip to main content

A Self-adapting Immigrational Genetic Algorithm for Solving a Real-Life Application of Vehicle Routing Problem

  • Conference paper
  • First Online:
Computational Statistics and Mathematical Modeling Methods in Intelligent Systems (CoMeSySo 2019 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1047))

Included in the following conference series:

Abstract

The present article presents the research for optimizing a real-life instance of heterogeneous vehicle routing problem, used intensively by shipping companies. The experiments have been carried out on the data provided by real companies, with constrains on the number and capacity of the vehicles, minimum and maximum number of stops for each route, along with the margins which can be take into account when optimizing the load of each truck. The optimization is performed using genetic algorithms hybridized with techniques for avoiding local optima, such as self adaptation and immigration. It turns out that more sophisticate approaches perform better, with very little compromise on execution time. It is a new proof of the importance of immigration techniques in bringing diversity in the genetic population.1.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

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

    Article  Google Scholar 

  2. Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80–91 (1959)

    Article  MathSciNet  Google Scholar 

  3. Dror, M.: Note on the complexity of the shortest path models for column generation in VRPTW. Oper. Res. 42(5), 977–978 (1994)

    Article  Google Scholar 

  4. Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63(3), 437–461 (1996)

    Article  Google Scholar 

  5. Gendreau, M., Potvin, J.Y., et al.: Handbook of Metaheuristics, vol. 2. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Golden, B., Assad, A., Levy, L., Gheysens, F.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11(1), 49–66 (1984)

    Article  Google Scholar 

  7. Golden, B.L., Raghavan, S., Wasil, E.A.: The vehicle routing problem: latest advances and new challenges, vol. 43. Springer, Heidelberg (2008)

    Google Scholar 

  8. Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408–416 (2009)

    Article  Google Scholar 

  9. Laporte, G., Ropke, S., Vidal, T.: Heuristics for the vehicle routing problem. In: Vehicle Routing: Problems, Methods, and Applications, Second Edition, pp. 87–116. SIAM (2014)

    Google Scholar 

  10. Lin, C., Choy, K.L., Ho, G.T., Chung, S.H., Lam, H.: Survey of green vehicle routing problem: past and future trends. Expert Syst. Appl. 41(4), 1118–1138 (2014)

    Article  Google Scholar 

  11. Matei, O., Pop, P.C., Sas, J.L., Chira, C.: An improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem. Neurocomputing 150, 58–66 (2015)

    Article  Google Scholar 

  12. Oliviu, M.: Theoretical and practical applications of evolutionary computation in solving combinatorial optimization problems. Ph.D. thesis, Technical University of Cluj-Napoca (2012)

    Google Scholar 

  13. Pop, P.C., Matei, O., Sitar, C.P.: An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109, 76–83 (2013)

    Article  Google Scholar 

  14. Prins, C.: Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case. J. Math. Model. Algorithms 1(2), 135–150 (2002)

    Article  MathSciNet  Google Scholar 

  15. Semet, F., Taillard, E.: Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. 41(4), 469–488 (1993)

    Article  Google Scholar 

  16. Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)

    Google Scholar 

  17. Yanik, S., Bozkaya, B., deKervenoael, R.: A new VRPPD model and a hybrid heuristic solution approach for e-tailing. Eur. J. Oper. Res. 236(3), 879–890 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Adrian Petrovan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Petrovan, A., Erdei, R., Pop-Sitar, P., Matei, O. (2019). A Self-adapting Immigrational Genetic Algorithm for Solving a Real-Life Application of Vehicle Routing Problem. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Computational Statistics and Mathematical Modeling Methods in Intelligent Systems. CoMeSySo 2019 2019. Advances in Intelligent Systems and Computing, vol 1047. Springer, Cham. https://doi.org/10.1007/978-3-030-31362-3_15

Download citation

Publish with us

Policies and ethics