先進先出限制動態用路人均衡模型之研究

Dynamic User-Optimal Route Choice with First-In-First-Out Requirement

本文將先進先出限制式納入動態用路人均衡選擇模型中，使得同一起迄對被使用到的路徑其一般化成本(色含了實際旅行時間及先進先出限制式增加之額外成本)相同且最短。針對該模型，本文除提出巢化拉氏-梯度投影法求解步驟外，並對一測試例進行求解，以驗證模型與演算法之正確性。

This paper incorporates first-in-first-out requirement into the dynamic user-optimal route choice problem. The corresponding dynamic equilibrium conditions for each origin-destination pair and time interval state that the generalized route travel times (comprised of route travel time, and backward queuing delays)experienced by travelers are equal and minimal. A Lagrangian method, which embeds the gradient projection algorithm, is then proposed and demonstrated with a numerical example.