In a logistic system, decisions on location of depot, vehicle routing and assignment of routes to vehicles should be considered simultaneously. The location-routing problems are defined to find the optimal number and locations of depots, and at the same time with the distribution routes for the vehicles. Because of the complexity and the time consuming computation, this problem belongs to a class of combinatorial optimization and NP-hard problems. Finding an optimal solution for this type of complex, huge problem in reasonable computational time by using traditional and exact approaches and optimization tools is very difficult. So a Meta heuristic algorithm based on ant colony system is proposed to solve this problem. According to the experiments, this proposed algorithm reports near-optimal and promising solutions in reasonable time. Also in this paper the assumption of assigning several routes to a vehicle during its available time is considered. Finally, the computational results obtained by this algorithm are compared with the results reported by Lingo software.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    A Meta Heuristic Algorithms Based on Ant Colony System For Solving Multi Depots Location-routing Problem with Multiple Using of Vehicle


    Beteiligte:


    Erscheinungsdatum :

    2011



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Multiple depots vehicle routing based on the ant colony with the genetic algorithm

    Liu, ChunYing / Yu, Jijiang | BASE | 2013

    Freier Zugriff

    An efficient meta-heuristic algorithm for solving capacitated vehicle routing problem

    Faiz, Alfian / Subiyanto, Subiyanto / Arief, Ulfah Mediaty | BASE | 2018

    Freier Zugriff

    The vehicle routing problem with multiple depots (MDVRP) in supply chain

    Mezatio, Eric Papain | ORKG Comparisons | 2022

    Freier Zugriff