Capacity constrained transit assignment with common lines. (English) Zbl 1048.90033

Kurauchi, Fumitaka; Bell, Michael G. H.; Schmöcker, Jan-Dirk

J. Math. Model. Algorithms 2, No. 4, 309-327 (2003).

Summary: This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example.

MSC:

90B06	Transportation, logistics and supply chain management
90B15	Stochastic network models in operations research
60K30	Applications of queueing theory (congestion, allocation, storage, traffic, etc.)

Keywords:

transit assignment; capacity restrained; common lines problem; absorbing Markov chain