Abstract
The multi-compartment vehicle routing problem (MC-VRP) consists of designing a set of routes to perform the collection of different product types from customer locations with minimal costs. The MC-VRP arises in several practical situations, such as selective waste collection or different color of glass collection. Compartment sizes can be either set as fixed or as flexible. Often in practice, the collection quantity from customers is stochastic in nature, that is, the exact value is not available during route planning and is known only once the vehicles are at the customers’ locations. Our work introduces the MC-VRP with stochastic customer demands and with flexible compartment sizes. We propose a genetic algorithm (GA) to solve this problem and investigate the benefits of setting the compartment sizes to be flexible instead of fixed with pre-defined sizes. By using flexible compartment sizes, the GA shows an overall average improvement of 7.8%, compared to the state-of-the-art approach for fixed compartment sizes.
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
Henke, T., Speranza, M. G., & Wäscher, G. (2015). The multi-compartment vehicle routing problem with flexible compartment sizes. European Journal of Operational Research, 246(3), 730–743. https://doi.org/10.1016/j.ejor.2015.05.020
Koch, H., Tino, H., & Gerhard, W. (2016). A genetic algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes. Working Paper Series.
Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L., & Velasco, N. (2011). Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands. Transportation Science, 45(3), 346–363. https://doi.org/10.1287/trsc.1100.0353
Ostermeier, M., Henke, T., Hübner, A., & Wäscher, G. (2021). Multi-compartment vehicle routing problems: State-of-the-art, modeling framework and future directions. European Journal of Operational Research, 292(3), 799–817. https://doi.org/10.1016/j.ejor.2020.11.009
Pereira, F. B., Tavares, J., Machado, P., & Costa, E. (2002). GVR: A new genetic representation for the vehicle routing problem. In Irish Conference on Artificial Intelligence and Cognitive Science (pp. 95–102). https://doi.org/10.1007/3-540-45750-X_12
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Chamurally, S., Rieck, J. (2023). A Genetic Algorithm for the Multi-compartment Vehicle Routing Problem with Stochastic Demands and Flexible Compartment Sizes. In: Grothe, O., Nickel, S., Rebennack, S., Stein, O. (eds) Operations Research Proceedings 2022. OR 2022. Lecture Notes in Operations Research. Springer, Cham. https://doi.org/10.1007/978-3-031-24907-5_50
Download citation
DOI: https://doi.org/10.1007/978-3-031-24907-5_50
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-24906-8
Online ISBN: 978-3-031-24907-5
eBook Packages: Business and ManagementBusiness and Management (R0)