Abstract This paper proposes an improved ant colony optimization (IACO) to solve period vehicle routing problem with time windows (PVRPTW), in which the planning period is extended to several days and each customer must be served within a specified time window. Multi-dimension pheromone matrix is used to accumulate heuristic information on different days. Two-crossover operations are introduced to improve the performance of the algorithm. The effectiveness of IACO is evaluated using a set of well-known benchmarks. Some of the results are better than the best-known solutions. Results also show the IACO seems to be a powerful tool for PVRPTW.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An ant colony optimization model: The period vehicle routing problem with time windows


    Beteiligte:
    Yu, Bin (Autor:in) / Yang, Zhong Zhen (Autor:in)


    Erscheinungsdatum :

    2010-09-01


    Format / Umfang :

    16 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    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


    Agents Toward Vehicle Routing Problem With Time Windows

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


    A vehicle routing problem with flexible time windows

    Tas, D. / Jabali, O. / Woensel, van, T. | BASE | 2013

    Freier Zugriff