An intersection-movement-based dynamic user optimal route choice problem
In this paper a novel variational inequality (VI) formulation of the dynamic user optimal
(DUO) route choice problem is proposed using the concept of approach proportion. An
approach proportion represents the proportion of travelers that select a turning or through
movement when leaving a node. Approach proportions contain travelers' route information
so that the realistic effects of physical queues can be captured in a formulation when a
physical-queue traffic flow model is adopted, and so that route enumeration and path-set …
(DUO) route choice problem is proposed using the concept of approach proportion. An
approach proportion represents the proportion of travelers that select a turning or through
movement when leaving a node. Approach proportions contain travelers' route information
so that the realistic effects of physical queues can be captured in a formulation when a
physical-queue traffic flow model is adopted, and so that route enumeration and path-set …
An intersection-movement-based stochastic dynamic user optimal route choice model for assessing network performance
Different from traditional methods, this paper formulates the logit-based stochastic dynamic
user optimal (SDUO) route choice problem as a fixed point (FP) problem in terms of
intersection movement choice probabilities, which contain travelers' route information so that
the realistic effects of physical queues can be captured in the formulation when a physical-
queue traffic flow model is adopted, and that route enumeration and column generation
heuristics can be avoided in the solution procedure when efficient path sets are used. The …
user optimal (SDUO) route choice problem as a fixed point (FP) problem in terms of
intersection movement choice probabilities, which contain travelers' route information so that
the realistic effects of physical queues can be captured in the formulation when a physical-
queue traffic flow model is adopted, and that route enumeration and column generation
heuristics can be avoided in the solution procedure when efficient path sets are used. The …
Showing the best results for this search. See all results