The vehicle routing problem in the dairy sector: a case study
- 22 November 2021
- journal article
- research article
- Published by Walter de Gruyter GmbH in International Journal of Food Engineering
- Vol. 18 (3), 239-252
- https://doi.org/10.1515/ijfe-2021-0295
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.Keywords
This publication has 44 references indexed in Scilit:
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in BrazilEuropean Journal of Operational Research, 2009
- The vehicle routing problem: A taxonomic reviewComputers & Industrial Engineering, 2009
- Production scheduling and vehicle routing with time windows for perishable food productsComputers & Operations Research, 2009
- Multi-objective vehicle routing problemsEuropean Journal of Operational Research, 2008
- A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable foodJournal of Food Engineering, 2008
- Minimizing greenhouse gas emissions through the application of solar thermal energy in industrial processesJournal of Cleaner Production, 2007
- A general heuristic for vehicle routing problemsComputers & Operations Research, 2007
- An application of Special Ordered Sets to a periodic milk collection problemEuropean Journal of Operational Research, 2007
- Vehicle routing problem with time-windows for perishable food deliveryJournal of Food Engineering, 2007
- A meta-heuristic algorithm for the efficient distribution of perishable foodsJournal of Food Engineering, 2001