Dynamic traffic assignment in a corridor network: Optimum versus equilibrium

Fu, Haoran; Akamatsu, Takashi; Satsukawa, Koki; Wada, Koh

doi:10.1016/j.trb.2022.04.007

Cited by 7 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, our results would be useful for analyzing the relationship between a DSO state without queues and a dynamic user equilibrium (DUE) state, in which each user optimizes his/her own utility and thus queues inevitably occur. In fact, recent studies (Fu et al, 2022;Sakai et al, 2021Sakai et al, , 2022 showed how the flow and cost patterns in the DUE state correspond to those in the solution to the [DSO-LP] problem. Therefore, it would be interesting to investigate the relationship between the DSO and DUE states from the perspective of the non-existence theorem.…”

Section: Discussionmentioning

confidence: 99%

Non-existence of queues for system optimal departure patterns in tree networks

Sakai¹,

Satsukawa²,

Akamatsu³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

This study proves the non-existence of queues for a dynamic system optimal (DSO) departure pattern in a directed rooted tree network with a single destination. First, considering queueing conditions explicitly, we formulate the DSO problem as mathematical programming with complementarity constraints (MPCC) that minimizes the total system cost which consists of the schedule and queueing delay costs. Next, for an arbitrary feasible solution to the MPCC, we prove the existence of another feasible solution where the departure flow pattern on every link is the same but no queue exists. This means that the queues can be eliminated without changing the total schedule delay cost. Queues are deadweight losses, and thus the non-existence theorem of queues in the DSO solution is established. Moreover, as an application of the non-existence theorem, we show that the MPCC can be transformed into a linear programming (LP) problem by eliminating the queueing conditions.

show abstract

Section: Discussionmentioning

confidence: 99%

Non-existence of queues for system optimal departure patterns in tree networks

Sakai¹,

Satsukawa²,

Akamatsu³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the meantime, multiple bottlenecks may be observed in a road network and the congestion may correlate spatially. In this case, dynamic traffic assignment models are established to account for the time-varying properties of road networks and spatial interaction of traffic congestion, e.g., [12,13]. The travel patterns during the morning peak period have also been investigated using data analysis methods, e.g., [14].…”

Section: Introductionmentioning

confidence: 99%

Integrated Departure Time and Parking Location Choices in a Morning Commute Problem under a Partially Automated Environment

Liao,

Wang,

2024

Applied Sciences

View full text Add to dashboard Cite

This study formulates the joint decisions of commuters on departure time and parking location choices in a morning commute problem where the commuters travel with autonomous vehicles (AVs) or human-driven vehicles (HVs). Under a mixed traffic environment, we aim to explore the impacts of parking capacity and parking pricing on the equilibrium travel pattern and the system performance. We build a dynamic equilibrium model for the morning commute problem by assuming that the parking slots can be grouped into central and peripheral clusters based on the distance between the parking location and the workplace. We first analyze the parking location preferences of commuters towards the two parking clusters under a mixed traffic environment. We then examine the equilibrium conditions and identify all the equilibrium travel patterns. We further analyze the system performance measured by the total travel cost with respect to the parking prices and the capacity of the central cluster. The optimal parking pricing scheme is also derived to minimize the total travel cost. We conduct numerical analysis to demonstrate the change in the total travel cost against the parking capacity of the central cluster and its parking price. Sensitivity analysis is performed to show the impacts of the network configuration on the total travel cost.

show abstract