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

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

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

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.

LanguageEnglish
JournalOptimization Letters
Early online date3 Jan 2019
DOIs
Publication statusE-pub ahead of print - 3 Jan 2019

Fingerprint

Vehicle Routing Problem
Customers
Time of Arrival
Service Quality
Waiting Time
Theoretical Model
Decision Making
Imply
Scenarios
Formulation

Keywords

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

Cite this

@article{061e90c943b74d70ae1be2db18f2dda5,
title = "A POPMUSIC approach for the Multi-Depot Cumulative Capacitated Vehicle Routing Problem",
abstract = "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.",
keywords = "UT-Hybrid-D, Disaster logistics, Matheuristic, Multi-Depot Cumulative Vehicle Routing Problem, POPMUSIC, Vehicle routing, Mathematical Modeling, Mathematical Programming, Logistics, heuristics, Metaheuristics, Customer-oriented applications",
author = "Eduardo Lalla-Ruiz and Stefan Vo{\ss}",
note = "Springer deal",
year = "2019",
month = "1",
day = "3",
doi = "10.1007/s11590-018-1376-1",
language = "English",
journal = "Optimization Letters",
issn = "1862-4472",
publisher = "Springer",

}

A POPMUSIC approach for the Multi-Depot Cumulative Capacitated Vehicle Routing Problem. / Lalla-Ruiz, Eduardo (Corresponding Author); Voß, Stefan.

In: Optimization Letters, 03.01.2019.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

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

AU - Lalla-Ruiz, Eduardo

AU - Voß, Stefan

N1 - Springer deal

PY - 2019/1/3

Y1 - 2019/1/3

N2 - 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.

AB - 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.

KW - UT-Hybrid-D

KW - Disaster logistics

KW - Matheuristic

KW - Multi-Depot Cumulative Vehicle Routing Problem

KW - POPMUSIC

KW - Vehicle routing

KW - Mathematical Modeling

KW - Mathematical Programming

KW - Logistics

KW - heuristics

KW - Metaheuristics

KW - Customer-oriented applications

UR - http://www.scopus.com/inward/record.url?scp=85059557489&partnerID=8YFLogxK

U2 - 10.1007/s11590-018-1376-1

DO - 10.1007/s11590-018-1376-1

M3 - Article

JO - Optimization Letters

T2 - Optimization Letters

JF - Optimization Letters

SN - 1862-4472

ER -