[HTML][HTML] Global path preference and local response: A reward decomposition approach for network path choice analysis in the presence of visually perceived …
Y Oyama - Transportation Research Part A: Policy and Practice, 2024 - Elsevier
This study performs an attribute-level analysis of the global and local path preferences of
network travelers. To this end, a reward decomposition approach is proposed and integrated …
network travelers. To this end, a reward decomposition approach is proposed and integrated …
[HTML][HTML] Capturing positive network attributes during the estimation of recursive logit models: A prism-based approach
Y Oyama - Transportation Research Part C: Emerging …, 2023 - Elsevier
Although the recursive logit (RL) model has been recently popular and has led to many
applications and extensions, an important numerical issue with respect to the computation of …
applications and extensions, an important numerical issue with respect to the computation of …
[HTML][HTML] Markovian traffic equilibrium assignment based on network generalized extreme value model
This study establishes Markovian traffic equilibrium assignment based on the network
generalized extreme value (NGEV) model, which we call NGEV equilibrium assignment. The …
generalized extreme value (NGEV) model, which we call NGEV equilibrium assignment. The …
An arc-based approach for stochastic dynamic traffic assignment
In dynamic traffic assignment (DTA) models, it seems relevant to consider the uncertainty
inherent to motorist route choices. Particularly, choices on realistic transport networks are …
inherent to motorist route choices. Particularly, choices on realistic transport networks are …
Arc-based Traffic Assignment: Equilibrium Characterization and Learning
Arc-based traffic assignment models (TAMs) are a popular framework for modeling traffic
network congestion generated by self-interested travelers who sequentially select arcs …
network congestion generated by self-interested travelers who sequentially select arcs …
Dynamic Tolling in Arc-based Traffic Assignment Models
Tolling in traffic networks offers a popular measure to minimize overall congestion. Existing
toll designs primarily focus on congestion in route-based traffic assignment models (TAMs) …
toll designs primarily focus on congestion in route-based traffic assignment models (TAMs) …
[HTML][HTML] Designing pedestrian zones within city center networks considering policy objective trade-offs
Y Oyama, S Murakami, M Chikaraishi… - … Research Part A: Policy …, 2024 - Elsevier
An idea key to human-centric city planning is the reclamation of urban spaces from vehicles
and their redesign for human activities. Aligned with this concept, this study presents a …
and their redesign for human activities. Aligned with this concept, this study presents a …
Sparse randomized policies for Markov decision processes based on Tsallis divergence regularization
This work investigates a somewhat different point of view on Markov decision processes by
reinterpreting them as a randomized shortest paths problem on a bipartite graph, therefore …
reinterpreting them as a randomized shortest paths problem on a bipartite graph, therefore …
Perturbed utility stochastic traffic assignment
This paper develops a fast algorithm for computing the equilibrium assignment with the
perturbed utility route choice (PURC) model. Without compromise, this allows the significant …
perturbed utility route choice (PURC) model. Without compromise, this allows the significant …
Maximum likelihood estimation for randomized shortest paths with trajectory data
Randomized shortest paths (RSPs) are tool developed in recent years for different graph
and network analysis applications, such as modelling movement or flow in networks. In …
and network analysis applications, such as modelling movement or flow in networks. In …