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

Ana D. López‐Sánchez

doi:10.1016/j.ejor.2014.04.008

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

2014-10-01

45

PRE

AI

A

Ana D. López‐Sánchez *

A

Alfredo G. Hernández‐Díaz

DOI：10.1016/j.ejor.2014.04.008

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2014 Elsevier B.V. All rights reserved.

Keywords:

Open Vehicle Routing Problem

Multi-start algorithm

Local search algorithm

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

Abstract

Journal

Organization