EXTENSIONS OF STOCHASTIC MULTIPATH TRIP ASSIGNMENT TO TRANSIT NETWORKS

Alan J. Horowitz

4 citations0/0 files storedTransportation Research Record Journal of the Transportation Research Board

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Transportation and Mobility Innovations Urban Transport Systems Analysis

Abstract

A procedure for applying stochastic multipath trip assignment to transit networks is described. The procedure extends an existing traffic assignment algorithm by (a) establishing strict criteria for transit zone definition; (b) using a comprehensive measure of disutility of transit trips; and (c) reconstructing the transit network so that all passenger movements are explicitly represented. The assignment procedure was tested on a large section of the Milwaukee County Transit System, which was specifically chosen to reveal any undesirable properties in the procedure. The assignment procedure was found to be free of those problems previously associated with applications of stochastic multipath traffic assignment in automobile networks.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 4 citations exist upstream.

Cited by

1995RECURSIVE STRUCTURE FOR EXACT LINE PROBABILITIES AND EXPECTED WAITING TIMES IN MULTIPATH TRANSIT ASSIGNMENT

Imported from OpenAlex (CC0) — nothing here is generated.