The location-routing problem with multi-compartment and multi-trip is an extension to the standard location-routing problem. In this problem, depots are used to deliver different products using heterogeneous vehicles with several compartments. Each compartment has a limited capacity and is dedicated to a single type of product. The problem is formulated as a mixed integer program. A constructive heuristic and a hybrid genetic algorithm (HGA) are proposed. Numerical experiments show that both heuristics can efficiently determine the optimal solutions on small size instances. For larger ones, the HGA outperforms the constructive heuristic with relatively more computational time. Managerial insights have been obtained from sensitivity analyses which would be helpful to improve the performance of the supply network.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The location-routing problem with multi-compartment and multi-trip: formulation and heuristic approaches


    Beteiligte:
    Moon, Ilkyeong (Autor:in) / Salhi, Said (Autor:in) / Feng, Xuehao (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    01.01.2020


    Format / Umfang :

    28 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    The Multi-Compartment Vehicle Routing Problem with Flexible Compartment Sizes

    Henke, Tino / Speranza, M. Grazia / Wäscher, Gerhard | DataCite | 2014


    A Cluster-First Route-Second Heuristic Approach to Solve The Multi-Trip Periodic Vehicle Routing Problem

    Annisa Kesy Garside / Nabila Rohmatul Laili | DOAJ | 2019

    Freier Zugriff



    A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution

    Kandiller, Levent / Eliiyi, Deniz Türsel / Taşar, Bahar | British Library Conference Proceedings | 2015