In this paper, we consider the Three-Dimensional Loading Capacitated Vehicle Routing Problem(3L-CVRP) which combines the routing of a fleet of vehicles and the loading of three-dimensional shaped goods into the vehicles while minimizing the total travel distance incurred. Apparently, 3L-CVRP is a combination of capacitated vehicle routing and three-dimensional bin packing problem and thus of high complexity. Different from most of previous works, we propose an innovative approach, called improved least waste heuristic for solving the loading subproblem, which is iteratively invoked by a simple tabu search algorithm for the routing. The good performance in terms of the solution quality and computational efficiency of our approach is shown through the numerical experiments on the benchmark instances from literature.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An effective tabu search approach with improved loading algorithms for the 3L-CVRP


    Contributors:
    Tao, Yi (author) / Wang, Fan (author)


    Publication date :

    2015


    Size :

    14 Seiten, Bilder, Tabellen, 47 Quellen




    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    LOCAL SEARCH BASED ALGORITHM FOR CVRP WITH STOCHASTIC DEMANDS

    kaur, Harshdeep / Singh, Harmandeep | BASE | 2017

    Free access


    An advanced tabu search approach to the dynamic airlift loading problem

    August G. Roesener / J. Wesley Barnes | DOAJ | 2016

    Free access

    A matheuristic algorithm for the three dimensional loading capacitated vehicle routing problem (3L-CVRP)

    Luis Miguel Escobar-Falcón / David Álvarez-Martínez / Mauricio Granada-Echeverri et al. | BASE | 2016

    Free access

    Improved Tabu Search in an Hybid Evolutionary Approach for the PDPTW

    Kammarti, R. / Hammadi, S. / Borne, P. et al. | British Library Conference Proceedings | 2005