The solution to a dynamic context of the Capacitated Vehicle Routing Problem (CVRP) is challenging. Routing and replenishment decisions are necessary by considering the assignment of customers to vehicles when the information is gradually revealed over horizon time. The procedure to solve this type of problems is referred to as route reoptimization, which is the best option for minimizing expected transportation cost without incurring failures of unsatisfied demand on a route. This paper proposes a heuristic algorithm for the reoptimization of CVRP in which the number of customers increases. The algorithm uses proposed performance metrics to reduce route dispersion and minimize length. The initial solution is generated using the savings algorithm and then enhanced using the Record-to-Record travel metaheuristic. By including or reducing new customers in the system, a reoptimization is performed which considers the visited nodes and edges as fixed. The optimization of the algorithm is implemented hierarchically by first minimizing dispersion and then minimizing distance. Next, the local search procedure is executed to improve the solution. A classic optimization is performed on all instances using the original and new customers’ information for later comparison to minimize distance. The efficiency of the proposed algorithm was validated using real-world cases from the literature. The results are promising and show the effectiveness of the proposed method for solving the considered problem by using reoptimization procedures in order to achieve good approximation ratios within short computing times.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Reoptimization Heuristic for the Capacitated Vehicle Routing Problem


    Beteiligte:


    Erscheinungsdatum :

    2018




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

    AbdElAziz, Moh. M. / A. El-Ghareeb, Haitham / Ksasy, M. S. M. | BASE | 2014

    Freier Zugriff

    A novel heuristic algorithm for capacitated vehicle routing problem

    Kır, Sena / Yazgan / Harun Reşit et al. | BASE | 2017

    Freier Zugriff


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

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

    Freier Zugriff

    Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows

    Yuliza, Evi / Puspita, Fitri Maya / Supadi, Siti Suzlin | BASE | 2021

    Freier Zugriff