A recent research showed that the Ant Colony System (ACS) algorithm hybridized with the Large Neighborhood Search (LNS) algorithm perform well on the Vehicle Routing Problem (VRP) in the dynamic environment. In this paper, we address this hybridization for this problem with traffic factors, which takes into account the variation of the travel cost between two locations. The main goal of this work is to minimize the total cost in the vehicle routing problem with dynamic requests and traffic factors using a hybridized ant colony system algorithm.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Hybrid ant colony system algorithm for the vehicle routing problem with dynamic customers and traffic factors


    Beteiligte:


    Erscheinungsdatum :

    01.04.2017


    Format / Umfang :

    206734 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    A Hybrid Gain-Ant Colony Algorithm for Green Vehicle Routing Problem

    Sangeetha, V. / KrishanKumar, R. / Ravichandran, K.S. et al. | IEEE | 2022




    Dynamic vehicle routing problem using hybrid ant system

    Yan Tian, / Jingyan Song, / Danya Yao, et al. | IEEE | 2003