Dynamic user optimal assignment with physical queues for a many-to-many OD pattern

Kuwahara, Masao; Akamatsu, Takashi

doi:10.1016/s0191-2615(00)00005-9

Cited by 66 publications

(49 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kuwahara and Akamatsu (1993) also showed that an equilibrium solution exists in single-origin networks. Note that this was performed before studies by Smith and Wisten (1995) and Mounce (2007) mentioned in Section 3.1, which proved the existence of the solution in general networks.…”

Section: Time Decomposition Approachmentioning

confidence: 94%

“…The time decomposition approach, proposed by Kuwahara and Akamatsu (1993), is a concept for DUE assignment with fixed departure times, bottlenecks, and single-origin networks. A singleorigin network is a network in which there is only one origin (see Figure 3, for example).…”

Section: Time Decomposition Approachmentioning

confidence: 99%

“…The time decomposition approach enables the construction of a solution methodology that can always converge. Kuwahara and Akamatsu (1993) proposed a methodology that does not require route enumeration. Akamatsu (2001) also provided an efficient algorithm for such a DUE assignment.…”

Section: Time Decomposition Approachmentioning

confidence: 99%

“…Meanwhile, there are several existing studies that assume that drivers attempt to select a route whose instantaneous travel cost at the time of making a decision is least (e.g. Wie, Friesz, and Tobin 1990;Lam and Huang 1995;Kuwahara and Akamatsu 1997;Kuwahara and Akamatsu 2001;Ban et al2012). Such a criterion corresponds to the situation in which drivers can obtain a real-time information on a current congestion pattern and believe that it remain unchanged till they arrive at destinations.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Properties of dynamic user equilibrium solution: existence, uniqueness, stability, and robust solution methodology

Iryo

2013

Transportmetrica B: Transport Dynamics

View full text Add to dashboard Cite

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 indicate theoretical problems that remain to be addressed in future research. DUE assignment is an equilibrium-based methodology for dynamic traffic assignment. In conventional equilibriumbased static traffic assignment, the four desirable properties of solutions -existence, uniqueness, stability of solutions, and the existence of a robust solution methodology -are all guaranteed. These properties must be ensured for planners to obtain a reliable solution for equilibriumbased assignment. Meanwhile, for DUE assignment, although some of these properties have been proved, many issues regarding these properties remain unresolved. This paper reviews studies that deal with these properties to understand how far they have been investigated and discusses what is required from future research to improve the robustness of DUE assignment.

show abstract

Section: Time Decomposition Approachmentioning

confidence: 94%

Section: Time Decomposition Approachmentioning

confidence: 99%

Section: Time Decomposition Approachmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Properties of dynamic user equilibrium solution: existence, uniqueness, stability, and robust solution methodology

Iryo

2013

Transportmetrica B: Transport Dynamics

View full text Add to dashboard Cite

show abstract

“…m^h is calculated using the method presented by M. Kuwahara (2001) and Guido Gentile (2005), too [7,8]…”

Section: Node Flow Assignmentmentioning

confidence: 99%

A Mixed Integer Linear Program for the Single Destination System Optimum Dynamic Traffic Assignment Problem with Physical Queue

Li¹,

Zhou²,

Ju³

2012

PROMET

View full text Add to dashboard Cite

show abstract

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

Tao

Jiang

et al. 2013

J of Advced Transportation

View full text Add to dashboard Cite

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 obtain an admissible locally optimal solution to this problem, we first reformulate the optimization in discrete form and then introduce a heuristic method to solve it. This method converges rapidly with attractive computational cost. Numerical examples are used to demonstrate the effectiveness of the method.

show abstract

Dynamic user optimal assignment with physical queues for a many-to-many OD pattern

Cited by 66 publications

References 6 publications

Properties of dynamic user equilibrium solution: existence, uniqueness, stability, and robust solution methodology

Properties of dynamic user equilibrium solution: existence, uniqueness, stability, and robust solution methodology

A Mixed Integer Linear Program for the Single Destination System Optimum Dynamic Traffic Assignment Problem with Physical Queue

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

Contact Info

Product

Resources

About