AbstractWe consider a Dynamic Multi-Period Routing Problem (DMPRP) faced by a company which deals with on-line pick-up requests and has to serve them by a fleet of uncapacitated vehicles over a finite time horizon. When a request is issued, a deadline of a given number of days d 2 is associated to it: if d = 1 the request has to be satisfied on the same day (unpostponable request) while if d = 2 the request may be served either on the same day or on the day after (postponable request). At the beginning of each day some requests are already known, while others may arrive as time goes on. Every day the company faces on-line requests by possibly making new plans for the service and decides whether or not to serve postponable requests without knowing the set of new requests that will be issued the day after. The company objective is to satisfy all the received requests while minimizing the average operational costs per day. The daily cost includes a very high cost paid for each request forwarded to a back-up service. We propose different short term routing strategies and analyze their impact on the long term objective. Extensive computational results are provided on randomly generated instances simulating different real case scenarios and conclusions are drawn on the effectiveness of the strategies.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Short Term Strategies for a Dynamic Multi-Period Routing Problem


    Contributors:


    Publication date :

    2008-02-14


    Size :

    14 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






    Fuel Consumption Optimization Model for the Multi-Period Inventory Routing Problem

    Cheng, Chun / Qi, Mingyao / Rousseau, Louis-Martin | Transportation Research Record | 2018


    Multi-period two-echelon location routing problem for disaster waste clean-up

    Cheng, Cheng / Zhu, Rui / Costa, Alysson M. et al. | Taylor & Francis Verlag | 2022


    The Period Vehicle Routing Problem with Service Choice

    Francis, Peter | Online Contents | 2006