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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Memetic Algorithm Approach for Solving the Truck and Trailer Routing Problem


    Additional title:

    EcoProduction




    Publication date :

    2015-06-10


    Size :

    16 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    A memetic algorithm for the open capacitated arc routing problem

    Fung, Richard Y.K. / Liu, Ran / Jiang, Zhibin | Elsevier | 2012


    A memetic algorithm for the open capacitated arc routing problem

    Fung, Richard Y.K. | Online Contents | 2013


    Memetic algorithm with adaptive local search for Capacitated Arc Routing Problem

    Yao, Tingting / Yao, Xin / Han, Shuangshuang et al. | IEEE | 2017


    A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots

    Belenguer, José Manuel / Benavent, Enrique / Martínez, Antonio et al. | British Library Online Contents | 2016