Problems associated with seeking the lowest cost vehicle routes to deliver demand from a set of depots to a set of customers are called Multi-depot Vehicle Routing Problems (MDVRP). The MDVRP is a generalization of the standard vehicle routing problem which involves more than one depot. In MDVRP each vehicle leaves a depot and should return to the same depot they started with. In this paper, the MDVRP is tackled using a iterated local search metaheuristic. Experiments are run on a number of benchmark instances of varying depots and customer sizes. The numerical results show that the proposed algorithm is competitive against state-of-the-art methods.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    On Solving the Multi-depot Vehicle Routing Problem


    Weitere Titelangaben:

    Smart Innovation, Systems and Technologies


    Beteiligte:
    Nagar, Atulya (Herausgeber:in) / Mohapatra, Durga Prasad (Herausgeber:in) / Chaki, Nabendu (Herausgeber:in) / Tlili, Takwa (Autor:in) / Krichen, Saoussen (Autor:in) / Drira, Ghofrane (Autor:in) / Faiz, Sami (Autor:in)


    Erscheinungsdatum :

    03.09.2015


    Format / Umfang :

    6 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Multi-Type Attention for Solving Multi-Depot Vehicle Routing Problems

    Li, Jinqi / Tian Dai, Bing / Niu, Yunyun et al. | IEEE | 2024



    Combining biased randomization with meta-heuristics for solving the multi-depot vehicle routing problem

    Juan Pérez, Angel Alejandro / Barrios, Barry / González Martín, Sergio et al. | BASE | 2012

    Freier Zugriff

    Multi-Depot Vehicle Routing Problem with Hybrid Genetic Algorithm

    Dang, Li Wei ;Sun, Xiao Ming | Trans Tech Publications | 2012