A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem

A.D. Lopez-Sanchez, A.G. Hernandez-Diaz, D. Vigo, R. Caballero, J. Molina

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

The aim of this paper is to solve a real-world problem proposed by an international company operating in Spain and modeled as a variant of the Open Vehicle Routing Problem in which the makespan, i.e., the maximum time spent on the vehicle by one person, must be minimized. A competitive multi-start algorithm, able to obtain high quality solutions within reasonable computing time is proposed. The effectiveness of the algorithm is analyzed through computational testing on a set of 19 school-bus routing benchmark problems from the literature, and on 9 hard real-world problem instances. © 2014 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)104-113
JournalEuropean Journal of Operational Research
Volume238
Issue number1
DOIs
Publication statusPublished - 2014

Fingerprint

Multistart
Vehicle routing
Vehicle Routing Problem
Person
Testing
Routing
Benchmark
Industry
Computing
Vehicle routing problem
Makespan
Spain
Bus

Cite this

Lopez-Sanchez, A.D. ; Hernandez-Diaz, A.G. ; Vigo, D. ; Caballero, R. ; Molina, J. / A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem. In: European Journal of Operational Research. 2014 ; Vol. 238, No. 1. pp. 104-113.
@article{0a634148479e4abaa5c5b3f4d51a2140,
title = "A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem",
abstract = "The aim of this paper is to solve a real-world problem proposed by an international company operating in Spain and modeled as a variant of the Open Vehicle Routing Problem in which the makespan, i.e., the maximum time spent on the vehicle by one person, must be minimized. A competitive multi-start algorithm, able to obtain high quality solutions within reasonable computing time is proposed. The effectiveness of the algorithm is analyzed through computational testing on a set of 19 school-bus routing benchmark problems from the literature, and on 9 hard real-world problem instances. {\circledC} 2014 Elsevier B.V. All rights reserved.",
author = "A.D. Lopez-Sanchez and A.G. Hernandez-Diaz and D. Vigo and R. Caballero and J. Molina",
year = "2014",
doi = "10.1016/j.ejor.2014.04.008",
language = "English",
volume = "238",
pages = "104--113",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem. / Lopez-Sanchez, A.D.; Hernandez-Diaz, A.G.; Vigo, D.; Caballero, R.; Molina, J.

In: European Journal of Operational Research, Vol. 238, No. 1, 2014, p. 104-113.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem

AU - Lopez-Sanchez, A.D.

AU - Hernandez-Diaz, A.G.

AU - Vigo, D.

AU - Caballero, R.

AU - Molina, J.

PY - 2014

Y1 - 2014

N2 - The aim of this paper is to solve a real-world problem proposed by an international company operating in Spain and modeled as a variant of the Open Vehicle Routing Problem in which the makespan, i.e., the maximum time spent on the vehicle by one person, must be minimized. A competitive multi-start algorithm, able to obtain high quality solutions within reasonable computing time is proposed. The effectiveness of the algorithm is analyzed through computational testing on a set of 19 school-bus routing benchmark problems from the literature, and on 9 hard real-world problem instances. © 2014 Elsevier B.V. All rights reserved.

AB - The aim of this paper is to solve a real-world problem proposed by an international company operating in Spain and modeled as a variant of the Open Vehicle Routing Problem in which the makespan, i.e., the maximum time spent on the vehicle by one person, must be minimized. A competitive multi-start algorithm, able to obtain high quality solutions within reasonable computing time is proposed. The effectiveness of the algorithm is analyzed through computational testing on a set of 19 school-bus routing benchmark problems from the literature, and on 9 hard real-world problem instances. © 2014 Elsevier B.V. All rights reserved.

U2 - 10.1016/j.ejor.2014.04.008

DO - 10.1016/j.ejor.2014.04.008

M3 - Article

VL - 238

SP - 104

EP - 113

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -