- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Prism-based path set restriction for solving Markovian traffic assignment problem
Search this article
Description
Abstract This paper deals with a main limitation of Markovian traffic assignment (MTA) models: when the network includes cyclic structures and the link costs are small enough, the fact that the MTA models assign traffic flows to all feasible paths causes computational challenges. This study addresses this issue by proposing a method of restricting path set based on the concept of choice-based prism. To achieve a prism-based path set, a novel network description and the constraints are introduced. These are flexible and compatible with the MTA operation, meaning that our method does not extinguish the mathematical and computational advantages of the MTA models. Our network description allows the expected minimum cost to take a value specific for each state, or a pair of node and choice-stage. This enables us to perform traffic assignment with a simple solution procedure, regardless of parameter setting or network structure. The numerical experiments show that our method solves the computational challenges of the MTA models and that the incorporation of the prism constraints does not increase computational effort required, or rather, it is computationally efficient even when considering the correlation among path utilities.
Journal
-
- Transportation Research Part B: Methodological
-
Transportation Research Part B: Methodological 122 528-546, 2019-04
Elsevier BV
- Tweet
Details 詳細情報について
-
- CRID
- 1360848657467280256
-
- ISSN
- 01912615
-
- Article Type
- journal article
-
- Data Source
-
- Crossref
- KAKEN
- OpenAIRE