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
Ficheros
Estadísticas
Métricas y Citas
Metadatos
Mostrar el registro completo del ítemFecha
2022Departamento/s
Estadística e Investigación OperativaFuente
Computers and Operations Research - 2022, vol. 141, 105662Resumen
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.
Materias
Heterogeneous fleet; Kernel Search; Matheuristics; Vehicle RoutingColecciones
- Artículos Científicos [12059]





