Cyclic flows, Markov process and stochastic traffic assignment

Research output: Contribution to journalArticle

124 Citations (Scopus)

Abstract

Dial's stochastic assignment algorithm restricts the assignment path set to "efficient path." As a result, it sometimes produces the unrealistic flow pattern that no flow is loaded on some paths where many vehicles are running in reality. To remove the drawback of Dial's algorithm, this paper presents the LOGIT type assignment that does not restrict the assignment paths. We first show the theoretical relation between the proposed model and Sasaki's assignment model through Markov process. This analysis makes it clear that the proposed assignment model can be calculated by some matrix operations. Next, we propose an efficient algorithm that does not require the matrix operation nor path enumeration over a network. The algorithm solves an equivalent program based on the entropy decomposition derived from the Markov property of LOGIT model. Finally, it is shown that the proposed approach can be easily extended to the flow dependent case (i.e. stochastic equilibrium assignment).

Original languageEnglish
Pages (from-to)369-386
Number of pages18
JournalTransportation Research Part B: Methodological
Volume30
Issue number5 PART B
DOIs
Publication statusPublished - 1996 Oct
Externally publishedYes

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Transportation

Fingerprint Dive into the research topics of 'Cyclic flows, Markov process and stochastic traffic assignment'. Together they form a unique fingerprint.

  • Cite this