HJ Huang, WHK Lam - Transportation Research Part B: Methodological, 2002 - Elsevier
This paper considers a simultaneous route and departure (SRD) time choice equilibrium assignment problem in network with queues. The problem is modeled on discrete-time basis …
T Akamatsu, K Wada - Transportation Research Part C: Emerging …, 2017 - Elsevier
Abstract Akamatsu et al.(2006) proposed a new transportation demand management scheme called “tradable bottleneck permits”(TBP), and proved its efficiency properties for a …
This paper explores some of the traffic phenomena that arise when drivers have to navigate a network in which queues back up past diverge intersections. If a diverge provides two …
T Iryo - Transportmetrica B: Transport Dynamics, 2013 - Taylor & Francis
This paper reviews studies that deal with properties of dynamic user equilibrium (DUE) solutions to understand the extent to which they have been resolved in past studies and …
Suppose that a road network model is given, together with some given demand for travel by (say) car and that the demand for travel varies with time of day but not from day to day …
CF Daganzo - Transportation Research Part B: Methodological, 1995 - Elsevier
This article examines a general form of link travel time functions considered in the dynamic traffic assignment literature and shows that it only makes some physical sense in the special …
The dynamic user-optimal (DUO) departure time and route choice problem is to determine travelers' best departure times and route choices at each instant of time. In a previous paper …
This research discusses the formulation and solution algorithm of the reactive dynamic traffic assignment with the link travel time explicitly taking into account the effects of queues under …
K Wada, T Akamatsu - Procedia-Social and Behavioral Sciences, 2013 - Elsevier
Abstract Akamatsu, Sato, and Nguyen (2006) and Akamatsu, 2007a, Akamatsu, 2007b proposed a new dynamic traffic congestion control scheme—the tradable network permit …