Multistart Evolutionary Local Search for a Disaster Relief Problem - Archive ouverte HAL Access content directly
Book Sections Year : 2014

Multistart Evolutionary Local Search for a Disaster Relief Problem

(1) , (1) , (1)
1

Abstract

This paper studies the multitrip cumulative capacitated vehicle routing problem (mt-CCVRP), a variant of the classical capacitated vehicle routing problem (CVRP). In the mt-CCVRP the objective function becomes the minimization of the sum of arrival times at required nodes and each vehicle may perform more than one trip. Applications of this NP-Hard problem can be found in disaster logistics. This article presents a Multistart Evolutionary Local Search (MS-ELS) that alternates between giant tour and mt-CCVRP solutions, and uses an adapted split procedure and a variable neighborhood descent (VND). The results on two sets of instances show that this approach finds very good results in relatively short computing time compared with a multistart iterated local search which works directly on the mt-CCVRP solution space.
Not file

Dates and versions

hal-02485552 , version 1 (20-02-2020)

Identifiers

Cite

Juan Carlos Rivera, Hasan Murat Afsar, Christian Prins. Multistart Evolutionary Local Search for a Disaster Relief Problem. Artificial Evolution, 8752, pp.129-141, 2014, Lecture Notes in Computer Science, 978-3-319-11682-2. ⟨10.1007/978-3-319-11683-9_11⟩. ⟨hal-02485552⟩

Collections

CNRS UTT LOSI
23 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More