You are not currently logged in.
Access JSTOR through your library or other institution:
Optimal Dispatching of a Finite Capacity Shuttle
Rajat K. Deb
Vol. 24, No. 13 (Sep., 1978), pp. 1362-1372
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2630642
Page Count: 11
You can always find the topics here!Topics: Dispatching, Passengers, Cost efficiency, Optimal policy, Induction assumption, Carrying costs, Random variables, Linear transformations, Poisson process, Travel time
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
We consider the problem of determining the optimal operating policy of a two terminal shuttle with fixed capacity Q ≤ ∞. The passengers arrive at each terminal according to Poisson processes and are transported by a single carrier operating between the terminals. The interterminal travel time is a positive random variable with finite expectation. Under a fairly general cost structure, we show that the policy which minimizes the expected total discounted cost over infinite time horizon has the following form: Suppose the carrier is at one of the terminals with x passengers waiting there and y passengers waiting at the other terminal. Then the optimal policy is to dispatch the carrier if and only if x ≥ G(y), where G(y) is a monotone decreasing control function. Futhermore, G(y) is always less than or equal to the carrier capacity Q. This control function can be approximated by the linear function G(y) = K - βy.
Management Science © 1978 INFORMS