The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms
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.
- Record URL:
- Record URL:
-
Availability:
- Find a library where document is available. Order URL: http://worldcat.org/oclc/1793974
-
Supplemental Notes:
- © 2021 Elsevier Ltd. All rights reserved. Abstract reprinted with permission of Elsevier.
-
Authors:
- Huerta-Muñoz, Diana L
-
0000-0002-4818-9311
- Archetti, Claudia
-
0000-0002-3524-1600
- Fernández, Elena
- Perea, Federico
- Publication Date: 2022-5
Language
- English
Media Info
- Media Type: Web
- Features: Appendices; Figures; References; Tables;
- Pagination: 105662
-
Serial:
- Computers & Operations Research
- Volume: 141
- Issue Number: 0
- Publisher: Elsevier
- ISSN: 0305-0548
- Serial URL: https://www.sciencedirect.com/journal/computers-and-operations-research
Subject/Index Terms
- TRT Terms: Algorithms; Heterogeneity; Heuristic methods; Mixed integer programming; Routing; Vehicle fleets
- Identifier Terms: Vehicle Routing Problem
- Subject Areas: Highways; Operations and Traffic Management; Planning and Forecasting;
Filing Info
- Accession Number: 01837449
- Record Type: Publication
- Files: TRIS
- Created Date: Feb 28 2022 9:40AM