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. The authors 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 they 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. This paper is organized as follows. Section 2 presents an integer programming formulation of the STTRPSD. Section 3 describes two metaheuristics based on greedy randomized adaptive search procedures and evolutionary local search. Section 4 presents a computational evaluation of the proposed methods. Finally, the authors conclude and outline future work in Section 5. Appendix A summarizes the notation used through the paper.
GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots
Engineering Applications of Artificial Intelligence ; 23 , 5 ; 780-794
2010
15 Seiten, 8 Bilder, 8 Tabellen, 41 Quellen
Article (Journal)
English
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
Online Contents | 2016
|A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
British Library Online Contents | 2016
|A Memetic Algorithm Approach for Solving the Truck and Trailer Routing Problem
Springer Verlag | 2015
|Truck News - Beer unites Dover depots
Online Contents | 2002