Abstract The dynamic vehicle allocation problem arises when a motor carrier must simultaneously and in real time coordinate the dispatching of vehicles from one region to the next all over the country. The decision to send a vehicle loaded or empty from one region to the next, arriving in the destination region at some point in the future, must anticipate the downstream impacts of the decision. The consequences of another load in a particular region at some point in the future, however, are highly uncertain. A simple methodology is proposed which calculates approximately the marginal value of an additional vehicle in each region in the future. This information is then used to generate a standard pure network which can be efficiently optimized to give dispatching decisions for today.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An operational planning model for the dynamic vehicle allocation problem with uncertain demands


    Contributors:

    Published in:

    Publication date :

    1986-06-10


    Size :

    16 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Dynamic ship assignment problem with uncertain demands

    Kim, Yoo Joon | DSpace@MIT | 2016

    Free access



    Multidepot Vehicle Routing with Uncertain Demands: Chance Constrained Approach

    Miranda, Pablo A. / Garrido, Rodrigo A. | Transportation Research Record | 2004


    Load Planning with Uncertain Demands for Time-Definite Freight Common Carriers

    Lin, Cheng-Chang | Transportation Research Record | 2004