GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots - Archive ouverte HAL Access content directly
Journal Articles Engineering Applications of Artificial Intelligence Year : 2010

GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots

(1, 2, 3) , (1) , (1) , (2) , (2)
1
2
3

Abstract

In the single truck and trailer routing problem with satellite depots (STTRPSD) a vehicle composed of a truck with a detachable trailer serves the demand of a set of customers reachable only by the truck without the trailer. This accessibility constraint implies the selection of locations to park the trailer before performing the trips to the customers. We propose two metaheuristics based on greedy randomized adaptive search procedures (GRASP), variable neighborhood descent (VND) and evolutionary local search (ELS) to solve this problem. To evaluate these metaheuristics we test them on a set of 32 randomly generated problems. The computational experiment shows that a multi-start evolutionary local search outperforms a GRASP/VND. Moreover, it obtains competitive results when applied to the multi-depot vehicle routing problem (MDVRP), that can be seen as a special case of the STTRPSD.
Not file

Dates and versions

hal-02493914 , version 1 (28-02-2020)

Identifiers

Cite

Juan Villegas, Christian Prins, Caroline Prodhon, Andrés Medaglia, Nubia Velasco. GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Engineering Applications of Artificial Intelligence, 2010, 23 (5), pp.780-794. ⟨10.1016/j.engappai.2010.01.013⟩. ⟨hal-02493914⟩

Collections

CNRS UTT LOSI
18 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More