TRID
Text Size:

Title:

TRANSIT NETWORK RELIABILITY: AN APPLICATION OF ABSORBING MARKOV CHAINS

Accession Number:

00929728

Record Type:

Component

Availability:

Elsevier Science Publishing Company, Incorporated

Journals Fulfillment Dept, Box 882, Madison Square Station
New York, NY 10159 USA

Find a library where document is available

Order URL: http://worldcat.org/isbn/0080439268

Abstract:

This study applies an absorbing Markov chain model to transit assignment to analyze the impact of vertex failure on the probability of trip failure. Vertex failure probabilities are treated as either known or unknown, and if unknown then worst vertex probabilities are sought. Reviewed are the lessons learned from recent random graph research on the robustness of different network topologies. An analysis of a number of elemental transit network topologies using the absorbing Markov chain model shows that the hub and spoke graph is the most robust to random vertex failure but also among the most vulnerable to directed vertex attack. The study analyzes a particular form of unreliability, namely the probability of being unable to board a transit line due to insufficient capacity, using the absorbing Markov chain model.

Language:

English

Corporate Authors:

Elsevier

The Boulevard, Langford Lane
Kidlington, Oxford OX5 1GB United Kingdom

Authors:

Bell, MGH
Schmoecker, J D
Iida, Y
Lam, WHK

Editors:

MAP TAYLOR

Pagination:

p. 43-62

Publication Date:

2002

Conference:

Transportation and Traffic Theory in the 21st Century. Proceedings of the 15th International Symposium on Transportation and Traffic Theory

Location: University of South Australia in Adelaide, Austral
Date: 2002-7-16 to 2002-7-18
Sponsors: University of Adelaide

ISBN:

0080439268

Features:

Figures (4) ; References; Tables (10)

Subject Areas:

Data and Information Technology; Highways; Planning and Forecasting; Public Transportation

Files:

TRIS, ATRI

Last Modified:

Sep 3 2002 12:00AM

More Records from this Conference: