2013
DOI: 10.1002/atr.1227
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic system‐optimal traffic assignment for a city using the continuum modeling approach

Abstract: SUMMARYThis paper presents a continuum dynamic traffic assignment model for a city in which the total cost of the traffic system is minimized: the travelers in the system are organized to choose the route to their destinations that minimizes the total cost of the system. Combined with the objective function, which defines the total cost and constraints such as certain physical and boundary conditions, a continuum model can be formulated as an optimization scheme with a feasible region in the function space. To… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 42 publications
(43 reference statements)
0
7
0
Order By: Relevance
“…Only two papers, Tao et al [47] in continuum space and Yildirimoglu et al [54] in discrete space, has tried to establish DSO conditions, but the proposed solution methods are numerical. Since it is hard to extract insights from numerical solution methods, future research should focus on analytical Decomposes the urban network into zones, which are meshed into cells, and computes the turning proportion in each cell using logit solutions, possibly of simplified systems.…”
Section: System Optimummentioning
confidence: 99%
“…Only two papers, Tao et al [47] in continuum space and Yildirimoglu et al [54] in discrete space, has tried to establish DSO conditions, but the proposed solution methods are numerical. Since it is hard to extract insights from numerical solution methods, future research should focus on analytical Decomposes the urban network into zones, which are meshed into cells, and computes the turning proportion in each cell using logit solutions, possibly of simplified systems.…”
Section: System Optimummentioning
confidence: 99%
“…There are two DUO assignment patterns (Tong and Wong 2000): the reactive dynamic user-optimal (RDUO) assignment, in which a user chooses a route that minimizes his/her instantaneous travel time/cost based on instantaneous travel time/cost information gained through broadcasting (Wie et al 1990, Lam and Huang 1995, Boyce et al 1995, Li et al 2000, Huang et al 2009, Jiang et al 2009, Friesz et al 2010, and the predictive dynamic user-optimal (PDUO) assignment, in which an individual chooses a route that minimizes his/her actual travel time/cost based on predictive travel time/cost information gained through experience (Tong and Wong 2000, Hoogendoorn and Bovy 2004, Du et al 2013. In DSO models, each user is assigned the route that minimizes the total travel time/cost of the system (Ghali and Smith 1995, Ziliaskopoulos 2000, Clarka et al 2009, Carey and Watling 2012, Tao et al 2014).…”
Section: Introductionmentioning
confidence: 99%
“…This extension added realism because congestion externalities and demand elasticity exist in practice. More recently, the continuum model has also been applied to solve multiclass equilibrium problems (Ho et al, 2003(Ho et al, , 2004(Ho et al, , 2006, cordon-based congestion-pricing problems (Ho et al, , 2013, dynamic paradigm problems (Jiang et al, 2011;Du et al, 2013;Tao et al, 2014), environmental problems (Yin et al, 2012(Yin et al, , 2013, airport problems (Loo et al, 2005), and housing problems Wong, 2005, 2007).…”
Section: Introductionmentioning
confidence: 99%