Abstract This paper considers a vehicle routing problem where each vehicle performs delivery operations over multiple routes during its workday and where new customer requests occur dynamically. The proposed methodology for addressing the problem is based on an adaptive large neighborhood search heuristic, previously developed for the static version of the problem. In the dynamic case, multiple possible scenarios for the occurrence of future requests are considered to decide about the opportunity to include a new request into the current solution. It is worth noting that the real-time decision is about the acceptance of the new request, not about its service which can only take place in some future routes (a delivery route being closed as soon as a vehicle departs from the depot). In the computational results, a comparison is provided with a myopic approach which does not consider scenarios of future requests.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A dynamic vehicle routing problem with multiple delivery routes


    Contributors:

    Published in:

    Publication date :

    2011-10-05


    Size :

    10 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    MULTIPLE DEPOT VEHICLE ROUTING PROBLEM WITH SPLIT DELIVERY

    Pongmanawut, Pitchaya / Likasiri, Chulin | TIBKAT | 2020


    Dynamic Vehicle Routing Problem with Multiple Objectives

    Tang, Hao / Hu, Mingwei | Transportation Research Record | 2005


    Optimizing AGV Transportation Routes in Printing as the Vehicle Routing Problem

    Ding, Yiwen / Kang, Guojun / Jia, Zhengying et al. | Springer Verlag | 2025



    A multi-objective two-echelon vehicle routing problem with multiple delivery options

    Karimi, Amin / Zhang, Lele / Fackrell, Mark et al. | Elsevier | 2024

    Free access