Optimal Dispatching of a Finite Capacity Shuttle.
Abstract
Consider the problem of determining the optimal operating policy of a two terminal shuttle with fixed capacity q < or = infinity. 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, it is shown 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 number of waiting passengers and suppose that y number of passengers are waiting at the other terminal. Then the optimal policy is to dispatch the carrier if and only if x > or = G(y), where G(y) is a monotone decreasing control function. Furthermore, G(y) is always less than or equal to the carrier capacity Q. This control function can be approximated by the linear functions G(y) = K - Beta y.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 15, 1977
- Accession Number
- ADA049595
Entities
People
- Rajat K. Deb
Organizations
- Stanford University