REACTIVE DYNAMIC USER OPTIMAL ASSIGNMENT WITH PHYSICAL QUEUES FOR A MANY-TO-MANY OD PATTERN

DOI Web Site Web Site 5 Citations 23 References

Bibliographic Information

Other Title
  • 多起点多終点ODにおける渋滞延伸を考慮したリアクティブ動的利用者最適交通量配分
  • タ キテン タ シュウテン OD ニ オケル ジュウタイ エンシン オ コウリ

Search this article

Abstract

This research proposes the formulation and a solution algorithm for the reactive dynamic user optimal assignment with physical queues. Given a many-to-many OD, under the reactive assignment, users are assumed to choose their shortest routes to their destinations based upon current instantaneous travel time, but not based on their actual travel time (or cost). First, the flow conservation and the First-In-First-Out discipline are established as constraints of the assignment. Second, the optimality condition of the reactive assignment is formulated. Third, based on the shockwave theory, the back-up phenomena of physical queues are included in the model. Finally, a solution algorithm is proposed and demonstrate an example of the assignment using a network with parallel arterial and freeway.

Journal

Citations (5)*help

See more

References(23)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top