Skip to main content

Hybrid PSO-TS-CHR Algorithm Applied to the Vehicle Routing Problem for Multiple Perishable Products Delivery

  • Conference paper
  • First Online:
Applied Computer Sciences in Engineering (WEA 2018)

Abstract

In this paper, we dealt with the routing of refrigerated and non-refrigerated vehicles for the delivery of multiple perishable products, with known demands, the capacity of vehicles in the heterogeneous fleet, and a number of available vehicles of both types. We propose a mathematical model that seeks to minimize the loss of freshness by perishable products, considering the time they remain in the vehicles and the vehicles’ storage door openings on the route, from the moment they leave the depot until they arrive at the final customer. The most important contribution of this work is the implementation of the hybrid PSO-TS-CHR algorithm to solve this problem, which is compared with a Genetic Algorithm (GA). The results showed that the metaheuristic that gives the greatest quality solutions for the stated problem of both is the hybrid algorithm.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Batista, B.M., Glover, F.: Introducción a la Búsqueda Tabú. Rev. Electrón. Comun. Trab. ASEPUMA 03, 1–36 (2007)

    Google Scholar 

  2. Clerc, M.: Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: Clerc, M. (ed.) New Optimization Techniques in Engineering. STUDFUZZ, vol. 141, pp. 219–239. Springer, Berlin (2004). https://doi.org/10.1007/978-3-540-39930-8_8

    Chapter  MATH  Google Scholar 

  3. Dorigo, M., Stützle, T.: Ant Colony Optmization. Massachusetts Institute of Technology, Cambridge (2004)

    MATH  Google Scholar 

  4. Dyer, M., Stougie, L.: Computational complexity of stochastic programming problems. Math. Program. 106, 423–432 (2006)

    Article  MathSciNet  Google Scholar 

  5. Galarcio, J.: Ruteo de vehiculos refrigerantes y de tipo general para la entrega de multiples productos perecederos. Universidad de Cordoba (CO) (2018)

    Google Scholar 

  6. Galarcio, J.D., Buelvas, M.P., Nisperuza, P.A., López, J.M., Hernández, H.E.: A New Metaheuristic Applied to the Capacited Vehicle Routing Problem (CVRP) for the Distribution of Perishable Products. Ing e innov. 5(1) (2017)

    Google Scholar 

  7. Glover, F.: Tabu search part I. ORSA J. Comput. 1, 190–206 (1989). https://doi.org/10.1287/ijoc.1.3.190

    Article  MATH  Google Scholar 

  8. Glover, F.: Tabu search, part II. ORSA J. Comput. 2, 4–32 (1990). https://doi.org/10.1287/ijoc.2.1.4

    Article  MATH  Google Scholar 

  9. Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, Reading and Menlo Park (1989)

    MATH  Google Scholar 

  10. Goyal, S.K., Giri, B.C.: Recent trends in modeling of deteriorating inventory. Eur. J. Oper. Res. 134, 1–16 (2001). https://doi.org/10.1016/S0377-2217(00)00248-4

    Article  MathSciNet  MATH  Google Scholar 

  11. Hernández, F., Poveda, J.: Aplicación de la metaheurística cromática al problema de secueciación de proyectos con recursos limitados (RCPSP). Universidad de Córdoba (2014)

    Google Scholar 

  12. Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Oxford (1975)

    MATH  Google Scholar 

  13. Homberger, J., Gehring, H.: Extended Solomon’s VRPTW instances (1999). http://www.fernuni-hagen.de/WINF/touren/menuefrm/probinst.htm

  14. Hsu, C.-I., Hung, S.-F., Li, H.-C.: Vehicle routing problem with time-windows for perishable food delivery. J. Food Eng. 80, 465–475 (2007)

    Article  Google Scholar 

  15. Kennedy, J.F., Eberhart, R.C., Shi, Y.: Swarm Intelligence. Morgan Kaufmann, Los Altos (2001)

    Google Scholar 

  16. Marinakis, Y., Marinaki, M.: A hybrid genetic - particle swarm optimization algorithm for the vehicle routing problem. Expert Syst. Appl. 37, 1446–1455 (2010). https://doi.org/10.1016/j.eswa.2009.06.085

    Article  MATH  Google Scholar 

  17. Montgomery, D.C.: Diseño Y Análisis De Experimentos, pp. 21–692. Limusa Wiley, London (2004)

    Google Scholar 

  18. Ngueveu, S.U., Prins, C., Wolfler Calvo, R.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37, 1877–1885 (2010). https://doi.org/10.1016/j.cor.2009.06.014

    Article  MathSciNet  MATH  Google Scholar 

  19. Osvald, A., Stirn, L.Z.: A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. J. Food Eng. 85, 285–295 (2008). https://doi.org/10.1016/j.jfoodeng.2007.07.008

    Article  Google Scholar 

  20. Prindezis, N., Kiranoudis, C.T., Marinos-Kouris, D.: A business-to-business fleet management service provider for central food market enterprises. J. Food Eng. 60, 203–210 (2003). https://doi.org/10.1016/S0260-8774(03)00041-4

    Article  Google Scholar 

  21. Ruiz, R., Maroto, C., Alcaraz, J.: Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur. J. Oper. Res. 165, 34–54 (2005)

    Article  Google Scholar 

  22. Sabie, R., Mestra, A.: Un nuevo método de optimización que se fundamenta a través de un algoritmo de búsqueda basado en la escala cromática de las notas musicales. Universidad de Córdoba (2011)

    Google Scholar 

  23. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1987)

    Article  MathSciNet  Google Scholar 

  24. Song, B.D., Ko, Y.D.: A vehicle routing problem of both refrigerated - and general-type vehicles for perishable food products delivery. J. Food Eng. 169, 61–71 (2016). https://doi.org/10.1016/j.jfoodeng.2015.08.027

    Article  Google Scholar 

  25. Tarantilis, C.D., Kiranoudis, C.T.: A meta-heuristic algorithm for the efficient distribution of perishable foods. J. Food Eng. 50, 1–9 (2001). https://doi.org/10.1016/S0260-8774(00)00187-4

    Article  Google Scholar 

  26. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234, 658–673 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jesus David Galarcio Noguera .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Galarcio Noguera, J.D., Hernández Riaño, H.E., López Pereira, J.M. (2018). Hybrid PSO-TS-CHR Algorithm Applied to the Vehicle Routing Problem for Multiple Perishable Products Delivery. In: Figueroa-García, J., Villegas, J., Orozco-Arroyave, J., Maya Duque, P. (eds) Applied Computer Sciences in Engineering. WEA 2018. Communications in Computer and Information Science, vol 916. Springer, Cham. https://doi.org/10.1007/978-3-030-00353-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00353-1_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00352-4

  • Online ISBN: 978-3-030-00353-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics