Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1048.90033
Kurauchi, Fumitaka; Bell, Michael G.H.; Schmöcker, Jan-Dirk
Capacity constrained transit assignment with common lines. (English)
[J] J. Math. Model. Algorithms 2, No. 4, 309-327 (2003). ISSN 1572-9214/e

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 2000:: *90B06 Transportation, logistics
90B15 Flows in networks with stochastic elements
60K30 Appl. of queueing theory

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

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]