In this work, we present a variable neighborhood search for solving a capacitated location routing problem with capacitated depots and a capacitated homogenous vehicle fleet in order to minimize the location and routing cost. We present the basic elements for this purpose and implement the variable neighborhood search algorithm using the variable neighborhood descent as the local search. We tested our heuristic approach on a large number of instances and the results were compared with the literature.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A variable neighborhood search for the capacitated location-routing problem


    Beteiligte:
    Derbel, H. (Autor:in) / Jarboui, B. (Autor:in) / Chabchoub, H. (Autor:in) / Hanafi, S. (Autor:in) / Mladenovic, N. (Autor:in)


    Erscheinungsdatum :

    01.05.2011


    Format / Umfang :

    704940 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch