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.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Tao, Yi (Autor:in) / Wang, Fan (Autor:in)


    Erscheinungsdatum :

    2015


    Format / Umfang :

    14 Seiten, Bilder, Tabellen, 47 Quellen




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Print


    Sprache :

    Englisch




    LOCAL SEARCH BASED ALGORITHM FOR CVRP WITH STOCHASTIC DEMANDS

    kaur, Harshdeep / Singh, Harmandeep | BASE | 2017

    Freier Zugriff


    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

    Freier Zugriff

    Improved Tabu Search in an Hybid Evolutionary Approach for the PDPTW

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


    Clustering Using Tabu Search

    Lin, W.-J. / Lin, J.-C. | British Library Online Contents | 1997