AbstractIn 2001, Caramia and his coauthors introduced a very fast and efficient heuristic for rooting a fleet of vehicles for dynamic combined pickup and delivery services [Caramia, M., Italiano, G.F., Oriolo, G., Pacifici, A., Perugia, A., 2001. Routing a fleet of vehicles for dynamic combined pickup and delivery services. In: Proceedings of the Symposium on Operation Research 2001, Springer-Verlag, Berlin/Heidelberg, pp. 3–8.]. The authors assume that every client names a stretch-factor that denotes the maximal relative deviation from the shortest path between pickup and delivery point. Waiting times are not allowed. As these assumptions are not very realistic, this paper now presents the results of adapting this algorithm to the dynamic pickup and delivery vehicle routing problem with several time windows. Waiting times of vehicles are admitted. Moreover, the computational results are considerably improved by local search techniques making use of free computational capacity.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    On dynamic pickup and delivery vehicle routing with several time windows and waiting times


    Contributors:
    Fabri, A. (author) / Recht, P. (author)

    Published in:

    Publication date :

    2005-04-18


    Size :

    16 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Waiting strategies for the dynamic pickup and delivery problem with time windows

    Mitrović-Minić, Snežana / Laporte, Gilbert | Elsevier | 2003



    Waiting Strategies for Dynamic Vehicle Routing

    Branke, Jürgen / Middendorf, Martin / Noeth, Guntram et al. | BASE | 2005

    Free access

    Pickup and delivery problem with hard time windows considering stochastic and time-dependent travel times

    Zheyu Wang / Maged Dessouky / Tom Van Woensel et al. | DOAJ | 2023

    Free access