A Stochastic Model of the Dynamic Vehicle Allocation Problem

Warren B. Powell
Additional contact information
Warren B. Powell: Princeton University, Princeton, New Jersey

Transportation Science, 1986, vol. 20, issue 2, 117-129

Abstract: The stochastic vehicle allocation problem addresses the movement of vehicles between locations over a given planning horizon. The demand for vehicles to carry loads between locations is uncertain, and vehicles are assumed to be able to handle several loads over the course of the planning horizon. This requires tracking the movement of both loaded and empty vehicles, resulting in a network with stochastic flows. The methodology represents the flows of vehicles over the network explicitly as random variables, taking advantage of the acyclic structure of the time space network. The decision variables are formulated in terms of sending a certain fraction of the supply of vehicles at a node (which is random) over each of the outbound links. The result is a nonseparable objective function with a very simple constraint structure which lends itself readily to the Frank-Wolfe algorithm. Numerical experiments suggest very good computational efficiency.

Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (29)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.20.2.117 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:20:y:1986:i:2:p:117-129

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().