Home The vehicle routing problem in the dairy sector: a case study
Article
Licensed
Unlicensed Requires Authentication

The vehicle routing problem in the dairy sector: a case study

  • Marta Rinaldi ORCID logo EMAIL logo , Eleonora Bottani , Federico Solari and Roberto Montanari
Published/Copyright: November 22, 2021

Abstract

The vehicle routing problem is one of the most studied NP-hard combinatorial problem. In the food sector, the complexity of the issue grows because of the presence of strict constraints. Taking into account the variability and the restrictions typical of the dairy sector, the aim of this paper is to provide a practical tool for solving the milk collection problem in real scenarios. A heuristic approach has been proposed to determine a feasible solution for a real-life problem, including capacity and time constraints. Two different applications of the Nearest Neighbor algorithm have been modelled and compared with the current system. Different tests have been implemented for evaluating the suitability of the outcomes. Results show that the greedy approach allows for involving less vehicles and reducing the travel time. Moreover, the tool has been proved to be flexible, able to solve routing problems with stochastic times and high supply variability.


Corresponding author: Marta Rinaldi, Department of Engineering, University of Campania “Luigi Vanvitelli”, via Roma 29, 81031, Aversa, Italy, E-mail:

  1. Author contributions: All the authors have accepted responsibility for the entire content of this submitted manuscript and approved submission.

  2. Research funding: None declared.

  3. Conflict of interest statement: The authors declare no conflicts of interest regarding this article.

References

1. Lahrichi, N, Gabriel Crainic, T, Gendreau, M, Rei, W, Rousseau, LM. Strategic analysis of the dairy transportation problem. J Oper Res Soc 2015;66:44–56, https://doi.org/10.1057/jors.2013.147.Search in Google Scholar

2. Das, K, Chowdhury, AH. Designing a reverse logistics network for optimal collection, recovery and quality-based product-mix planning. Int J Prod Econ 2012;135:209–21, https://doi.org/10.1016/j.ijpe.2011.07.010.Search in Google Scholar

3. Jozefowiez, N, Semet, F, Talbi, EG. Multi-objective vehicle routing problems. Eur J Oper Res 2008;189:293–309, https://doi.org/10.1016/j.ejor.2007.05.055.Search in Google Scholar

4. Schnitzer, H, Brunner, C, Gwehenberger, G. Minimizing greenhouse gas emissions through the application of solar thermal energy in industrial processes. J Clean Prod 2007;15:1271–86, https://doi.org/10.1016/j.jclepro.2006.07.023.Search in Google Scholar

5. Marchini, D, Rinaldi, M, Montanari, R, Bottani, E, Solari, F. Performance analysis of the water supply system of a dairy company by means of an advanced simulation tool. Int J Food Eng 2014;10:557–71, https://doi.org/10.1515/ijfe-2013-0067.Search in Google Scholar

6. Claassen, GDH, Hendriks, TH. An application of special ordered sets to a periodic milk collection problem. Eur J Oper Res 2007;180:754–69, https://doi.org/10.1016/j.ejor.2006.03.042.Search in Google Scholar

7. Toth, P, Vigo, D. The vehicle routing problem. Philadelphia, PA, USA: SIAM; 2002.10.1137/1.9780898718515Search in Google Scholar

8. Elshaer, R, Awad, H. A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Comput Ind Eng 2020;140:106242, https://doi.org/10.1016/j.cie.2019.106242.Search in Google Scholar

9. Ostermeier, M, Henke, T, Hübner, A, Wäscher, G. Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions. Eur J Oper Res 2021;292:799–817, https://doi.org/10.1016/j.ejor.2020.11.009.Search in Google Scholar

10. Wang, Y. Research review of green vehicle routing optimization. In: Paper presented at the IOP Conference Series: Earth and Environmental Science; IOP Publishing, Bristol, UK; 2021. vol 632, 032031 p.10.1088/1755-1315/632/3/032031Search in Google Scholar

11. Pisinger, D, Ropke, S. A general heuristic for vehicle routing problems. Comput Oper Res 2007;34:2403–35, https://doi.org/10.1016/j.cor.2005.09.012.Search in Google Scholar

12. Amorim, P, Parragh, SN, Sperandio, F, Almada-Lobo, B. A rich vehicle routing problem dealing with perishable food: a case study. Top 2014;22:489–508, https://doi.org/10.1007/s11750-012-0266-4.Search in Google Scholar

13. Kang, HY, Lee, AH. An enhanced approach for the multiple vehicle routing problem with heterogeneous vehicles and a soft time window. Symmetry 2018;10:650, https://doi.org/10.3390/sym10110650.Search in Google Scholar

14. Chen, J, Gui, P, Ding, T, Na, S, Zhou, Y. Optimization of transportation routing problem for fresh food by improved ant colony algorithm based on tabu search. Sustainability 2019;11:6584, https://doi.org/10.3390/su11236584.Search in Google Scholar

15. Chen, HK, Hsueh, CF, Chang, MS. Production scheduling and vehicle routing with time windows for perishable food products. Comput Oper Res 2009;36:2311–9, https://doi.org/10.1016/j.cor.2008.09.010.Search in Google Scholar

16. Osvald, A, Stirn, LZ. A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. J Food Eng 2008;85:285–95, https://doi.org/10.1016/j.jfoodeng.2007.07.008.Search in Google Scholar

17. Zulvia, FE, Kuo, RJ, Nugroho, DY. A many-objective gradient evolution algorithm for solving a green vehicle routing problem with time windows and time dependency for perishable products. J Clean Prod 2020;242:118428, https://doi.org/10.1016/j.jclepro.2019.118428.Search in Google Scholar

18. Amorim, P, Almada-Lobo, B. The impact of food perishability issues in the vehicle routing problem. Comput Ind Eng 2014;67:223–33, https://doi.org/10.1016/j.cie.2013.11.006.Search in Google Scholar

19. Tarantilis, CD, Kiranoudis, CT. A meta-heuristic algorithm for the efficient distribution of perishable foods. J Food Eng 2001;50:1–9, https://doi.org/10.1016/s0260-8774(00)00187-4.Search in Google Scholar

20. Liang, Y, Liu, F, Lim, A, Zhang, D. An integrated route, temperature and humidity planning problem for the distribution of perishable products. Comput Ind Eng 2020;147:106623, https://doi.org/10.1016/j.cie.2020.106623.Search in Google Scholar

21. Paraskevopoulos, DC, Repoussis, PP, Tarantilis, CD, Ioannou, G, Prastacos, GP. A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. J Heuristics 2008;14:425–55, https://doi.org/10.1007/s10732-007-9045-z.Search in Google Scholar

22. Belfiore, P, Yoshizaki, HTY. Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil. Eur J Oper Res 2009;199:750–8, https://doi.org/10.1016/j.ejor.2008.08.003.Search in Google Scholar

23. Li, D, Cao, Q, Zuo, M, Xu, F. Optimization of green fresh food logistics with heterogeneous fleet vehicle route problem by improved genetic algorithm. Sustainability 2020;12:1946, https://doi.org/10.3390/su12051946.Search in Google Scholar

24. Wang, Y, Yang, C, Hou, H. Risk management in perishable food distribution operations. Ind Manag Data Syst 2019;120:291–311, https://doi.org/10.1108/imds-03-2019-0149.Search in Google Scholar

25. Rinaldi, M, Bottani, E, Solari, F, Montanari, R. The Milk Collection Problem with Time Constraint: an Optimization Study Integrating Simulation. ISSN 2724-0355, ISBN 978-88-85741-54-6; 2020.Search in Google Scholar

26. Gonzalez, EC, Adarme-Jaimes, W, Orjuela-Castro, JA. Stochastic mathematical model for vehicle routing problem in collecting perishable products. Dyna 2015;82:199–206, https://doi.org/10.15446/dyna.v82n189.48549.Search in Google Scholar

27. Calabrò, G, Torrisi, V, Inturri, G, Ignaccolo, M. Improving inbound logistic planning for large-scale real-world routing problems: a novel ant-colony simulation-based optimization. Eur Transp Res Rev 2020;12:1–11, https://doi.org/10.1186/s12544-020-00409-7.Search in Google Scholar

28. Ban, HB, Nguyen, PK. A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem. Comput Soc Networks 2021;8:1–19, https://doi.org/10.1186/s40649-020-00084-7.Search in Google Scholar

29. Jouzdani, J, Fathian, M. A linear MmTSP formulation of robust location-routing problem: a dairy products supply chain case study. Int J Appl Decis Sci 2014;7:327–42, https://doi.org/10.1504/ijads.2014.063231.Search in Google Scholar

30. Tirkolaee, EB, Goli, A, Bakhsi, M, Mahdavi, I. A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows. Numer Algebra Control Optim 2017;7:417. https://doi.org/10.3934/naco.2017026.Search in Google Scholar

31. Rahbari, A, Nasiri, MM, Werner, F, Musavi, M, Jolai, F. The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: two robust bi-objective models. Appl Math Model 2019;70:605–25, https://doi.org/10.1016/j.apm.2019.01.047.Search in Google Scholar

32. Devapriya, P, Ferrell, W, Geismar, N. Integrated production and distribution scheduling with a perishable product. Eur J Oper Res 2017;259:906–16. https://doi.org/10.1016/j.ejor.2016.09.019.Search in Google Scholar

33. Yu, S, Tai, C, Liu, Y, Gao, L. An improved artificial bee colony algorithm for vehicle routing problem with time windows: a real case in Dalian. Adv Mech Eng 2016;8:1–9, https://doi.org/10.1177/1687814016665298.Search in Google Scholar

34. Marandi, F, Zegordi, SH. Integrated production and distribution scheduling for perishable products. Sci Iran 2017;24:2105–18, https://doi.org/10.24200/sci.2017.4298.Search in Google Scholar

35. Ma, ZJ, Wu, Y, Dai, Y. A combined order selection and time-dependent vehicle routing problem with time widows for perishable product delivery. Comput Ind Eng 2017;114:101–13, https://doi.org/10.1016/j.cie.2017.10.010.Search in Google Scholar

36. Li, P, He, J, Zheng, D, Huang, Y, Fan, C. Vehicle routing problem with soft time windows based on improved genetic algorithm for fruits and vegetables distribution. Discrete Dynam Nat Soc, 2015, https://doi.org/10.1155/2015/483830.Search in Google Scholar

37. Govindan, K, Jafarian, A, Khodaverdi, R, Devika, K. Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int J Prod Econ 2014;152:9–28, https://doi.org/10.1016/j.ijpe.2013.12.028.Search in Google Scholar

38. Emeç, U, Çatay, B, Bozkaya, B. An adaptive large neighborhood search for an e-grocery delivery routing problem. Comput Oper Res 2016;69:109–25, https://doi.org/10.1016/j.cor.2015.11.008.Search in Google Scholar

39. Belo-Filho, MAF, Amorim, P, Almada-Lobo, B. An adaptive large neighbourhood search for the operational integrated production and distribution problem of perishable products. Int J Prod Res 2015;53:6040–58, https://doi.org/10.1080/00207543.2015.1010744.Search in Google Scholar

40. Hsu, CI, Hung, SF, Li, HC. Vehicle routing problem with time-windows for perishable food delivery. J Food Eng 2007;80:465–75, https://doi.org/10.1016/j.jfoodeng.2006.05.029.Search in Google Scholar

41. Utama, DM, Dewi, SK, Wahid, A, Santoso, I. The vehicle routing problem for perishable goods: a systematic review. Cogent Eng 2020;7:1816148, https://doi.org/10.1080/23311916.2020.1816148.Search in Google Scholar

42. Meesuptaweekoon, K, Chaovalitwongse, P. Dynamic vehicle routing problem with multiple depots. Eng J 2014;18:135–49, https://doi.org/10.4186/ej.2014.18.4.135.Search in Google Scholar

43. Montoya-Torres, JR, López Franco, J, Nieto Isaza, S, Felizzola Jiménez, H, Herazo-Padilla, N. A literature review on the vehicle routing problem with multiple depots. Comput Ind Eng 2015;79:115–29, https://doi.org/10.1016/j.cie.2014.10.029.Search in Google Scholar

44. Masson, R, Lahrichi, N, Rousseau, LM. A two-stage solution method for the annual dairy transportation problem. Eur J Oper Res 2016;251:36–43, https://doi.org/10.1016/j.ejor.2015.10.058.Search in Google Scholar

45. Eksioglu, B, Vural, AV, Reisman, A. The vehicle routing problem: a taxonomic review. Comput Ind Eng 2009;57:1472–83, https://doi.org/10.1016/j.cie.2009.05.009.Search in Google Scholar

Received: 2021-03-24
Accepted: 2021-11-04
Published Online: 2021-11-22

© 2021 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 13.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/ijfe-2021-0295/html
Scroll to top button