We suggest an efficient polynomial algorithm for the vehicle routing problem with time windows based on agent negotiation. A generic agent decomposition of the problem is introduced featuring a clear separation between the local planning performed by the individual vehicles and the abstract global coordination achieved by negotiation—differentiating the presented algorithm from the classical centralized algorithms. The semantic of the abstract negotiation process is discussed, as well as the two alternative local planning strategies used by the individual vehicles. A relevant comparison to the state-of-the-art classical and agent-based algorithms is provided, missing from most previous agent-based studies. The algorithm performs slightly worse than the state-of-the-art classical algorithms but improves on all the previous comparable agent-based algorithms.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Agents Toward Vehicle Routing Problem With Time Windows


    Contributors:


    Publication date :

    2015-01-02


    Size :

    15 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    A vehicle routing problem with flexible time windows

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

    Free access

    A vehicle routing problem with flexible time windows

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

    Free access

    Vehicle routing problem with time windows under availability constraints

    Dhahri, Amine / Zidi, Kamel / Ghedira, Khaled | IEEE | 2013


    Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

    Braysy, O. / Gendreau, M. | British Library Online Contents | 2005