The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms

Identificadores

URI: http://hdl.handle.net/10498/38363

DOI: 10.1016/J.COR.2021.105662

ISSN: 0305-0548

Files
Statistics
Metrics and citations
 
Share
Export
EndNoteBibTexRIS
Metadata
Show full item record
Author/s
Huerta-Muñoz, Diana L.; Archetti, Claudia; Fernández Areizaga, ElenaAuthority UCA; Perea, Federico
Date
2022
Department
Estadística e Investigación Operativa
Source
Computers and Operations Research - 2022, vol. 141, 105662
Abstract
The aim of this paper is to introduce the Flexible Periodic Vehicle Routing Problem with Heterogeneous Fleet, a variant of the Periodic Vehicle Routing Problem. Flexibility is introduced in service schedules and delivered quantities, heterogeneity comes from different vehicles capacities and speeds. Three Mixed-Integer Linear Programming formulations and a matheuristic, based on Kernel Search, are proposed. Computational tests are made to evaluate the performance of the three formulations and to assess the quality of the solutions provided by the matheuristic.
Subjects
Heterogeneous fleet; Kernel Search; Matheuristics; Vehicle Routing
Collections