Abstract
This paper considers the planning of the collection of fresh milk from local farms with a fleet of refrigerated vehicles. The problem is formulated as a version of the Periodic Vehicle Routing Problem with Time Windows. The objective function is oriented to the quality of service by minimizing the service times to the customers within their time windows. We developed a hybrid metaheuristic that combines GRASP and VNS to find solutions. In order to help the hybrid GRASP-VNS find high-quality and feasible solutions, we consider infeasible solutions during the search using different penalty functions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
De Armas, J., Lalla, E., Expósito, C., Landa, D., Melián, B.: A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows. Eng. Appl. Artif. Intell. 45, 350–360 (2015)
Claassen, G., Hendriks, T.: An application of special ordered sets to a periodic milk collection problem. Eur. J. Oper. Res. 180(2), 754–769 (2007)
Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52(8), 928–936 (2001)
Lahrichi, N., Gabriel Crainic, T., Gendreau, M., Rei, W., Rousseau, L.M.: Strategic analysis of the dairy transportation problem. J. Oper. Res. Soc. 66(1), 44–56 (2015)
Pirkwieser, S., Raidl., G.: A variable neighborhood search for the periodic vehicle routing problem with time windows. In: Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing, pp. 23–24 (2008)
Pirkwieser, S., Raidl, G.R.: Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 45–59. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04918-7_4
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109–133 (1995)
Hansen, P., Mladenović, N., Moreno, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367–407 (2010)
Beltrami, E.J., Bodin, L.D.: Networks and vehicle routing for municipal waste collection. Networks 4(1), 65–94 (1974)
Acknowledgment
This work has been partially funded by the Spanish Ministry of Economía y Competitividad with FEDER funds (TIN2015-70226-R) and by Fundación Cajacanarias (2016TUR19).
Contributions from Airam Expósito-Márquez are supported by la Agencia Canaria de Investigación, Innovación y Sociedad de la Información de la Consejería de Economía, Industria, Comercio y Conocimiento and by the Fondo Social Europeo (FSE).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Expósito, A., Raidl, G.R., Brito, J., Moreno-Pérez, J.A. (2018). GRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2017. EUROCAST 2017. Lecture Notes in Computer Science(), vol 10671. Springer, Cham. https://doi.org/10.1007/978-3-319-74718-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-74718-7_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74717-0
Online ISBN: 978-3-319-74718-7
eBook Packages: Computer ScienceComputer Science (R0)