This chapter considers a truck and trailer routing problem (TTRP) where the fleet consists of trucks and trailers, and some customers can be served by a truck pulling a trailer, while the other may be accessible by a truck only. A memetic algorithm is proposed by dividing the TTRP into two VRPs in the construction phase and then uses the alternating edge crossover with several local search methods. It is tested on TTRP benchmark instances in the literature and corresponding numerical results are presented.
A Memetic Algorithm Approach for Solving the Truck and Trailer Routing Problem
EcoProduction
Toward Sustainable Operations of Supply Chain and Logistics Systems ; Kapitel : 24 ; 345-360
2015-06-10
16 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
A memetic algorithm for the open capacitated arc routing problem
Online Contents | 2013
|A memetic algorithm for the open capacitated arc routing problem
Elsevier | 2012
|A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
British Library Online Contents | 2016
|A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
Online Contents | 2016
|