A POPMUSIC approach for the Multi-Depot Cumulative Capacitated Vehicle Routing Problem
The Multi-Depot Cumulative Capacitated Vehicle Routing Problem is a variation of the recently proposed Capacitated Cumulative Vehicle Routing Problem, where several depots can be considered as starting points of routes. Its objective aims at minimizing the sum of arrival times at customers for providing service. Practical considerations imply to address the delivery of customers from multiple depots where the service quality level depends on the customer waiting time and the delivering vehicles may be able to depart from different points. Those scenarios require theoretical models to support the decision-making process as well as for measuring the quality of the solutions provided by approximate approaches. In the present work, we formalize this new problem variant by means of a mathematical formulation and propose a matheuristic approach (POPMUSIC) for solving it.
KeywordsMulti-Depot Cumulative Vehicle Routing Problem POPMUSIC Matheuristic Disaster logistics Customer-oriented applications
- 2.Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the 26th Annual ACM Symposium on Theory of computing, pp. 163–171. ACM (1994)Google Scholar
- 12.Lalla-Ruiz, E., Schwarze, S., Voß, S.: A matheuristic approach for the p-cable trench problem. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) Learning and Intelligent Optimization, pp. 247–252. Springer (2016)Google Scholar
- 23.Taillard, É.D., Voß, S.: Popmusic. In: Martí, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 687–701. Springer, Berlin (2017). https://doi.org/10.1007/978-3-319-07124-4_31