Limit Theorems for Queues in Transportation Systems.
Abstract
Stochastic queueing models are formulated for three transportation systems. The first consists of a linear network of N+1 terminals served by S vehicles of fixed capacity. Customers arrive stochastically at terminal i, 1 < or = i < or = N, seeking transportation to some terminal j, 0 < or = j < or = i - 1, and are served as empty units of vehicle capacity become available at i. The second system consists of a circular network of N terminals in which S vehicles travel in a single direction. Customers arrive stochastically at each terminal seeking transportation to the next terminal in the circle. When a vehicle arrives at a terminal, it remains idle until fully loaded, at which time it transports its passengers to the next terminal. The third system is a generalization of the second in which customers may choose any terminal as a destination, and travel to that terminal need not follow a circular route. A customer at terminal i chooses terminal j with probability pij. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1971
- Accession Number
- AD0737645
Entities
People
- Michael A. Crane
Organizations
- Stanford University