Abstract A NP-hard problem, vehicular routing is a combinatorial optimization problem. Vehicular routing problem with time windows indicates vehicular routing with specified start and end time. There will be “n” number of vehicles starting from the depot to cater to the needs of “m” customers. In this paper, Gehring and Homberger benchmark problems are considered wherein the size of customers is taken to be 1000. Artificial Bee Colony Optimization algorithm is executed on these 60 datasets and the number of vehicles along with total distance covered is recorded. The modified version of Deterministic Finite Automata is applied along with the Artificial Bee Colony Optimization and the results produce 25.55% efficient routes and 15.42% efficient distance compared to simple Artificial Bee Colony Optimization algorithm.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Modified DFA Minimization with Artificial Bee Colony Optimization in Vehicular Routing Problem with Time Windows


    Beteiligte:
    Niranjani, G. (Autor:in) / Umamaheswari, K. (Autor:in)


    Erscheinungsdatum :

    25.10.2019


    Format / Umfang :

    20 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Optimasi Capacitated Vehicle Routing Problem with Time Windows dengan Menggunakan Ant Colony Optimization

    Soenandi, Iwan Aang / Joice, Joice / Marpaung, Budi | BASE | 2019

    Freier Zugriff



    A vehicle routing problem with flexible time windows

    Taş, Duygu / Van Woensel, Tom / JABALI, OLA | BASE | 2014

    Freier Zugriff

    Agents Toward Vehicle Routing Problem With Time Windows

    Kalina, Petr / Vokřínek, Jiří / Mařík, Vladimír | Taylor & Francis Verlag | 2015