A POPMUSIC approach for the Multi-Depot Cumulative Capacitated Vehicle Routing Problem

Eduardo Lalla-Ruiz* (Corresponding Author), Stefan Voß

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

30 Citations (Scopus)
419 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)671-691
JournalOptimization Letters
Early online date3 Jan 2019
Publication statusPublished - 1 Apr 2020


  • Disaster logistics
  • Matheuristic
  • Multi-Depot Cumulative Vehicle Routing Problem
  • Vehicle routing
  • Mathematical Modeling
  • Mathematical Programming
  • Logistics
  • heuristics
  • Metaheuristics
  • Customer-oriented applications


Dive into the research topics of 'A POPMUSIC approach for the Multi-Depot Cumulative Capacitated Vehicle Routing Problem'. Together they form a unique fingerprint.

Cite this