Queue replacement approach to dynamic user equilibrium assignment with route and departure time choice
提出一种混合解析与数值方法，通过广义队列替换原理将动态用户均衡问题转化为两个线性规划问题求解，适用于同质用户的路径与出发时间选择。
This study develops a hybrid analytical and numerical approach for dynamic user equilibrium (DUE) assignment with simultaneous route and departure time choice (RDTC) for homogeneous users. The core concept of the proposed approach is the generalized queue replacement principle (GQRP), which establishes an equivalence between the equilibrium queueing-delay pattern and the solution to a linear programming (LP) problem obtained by relaxing some conditions in the original DUE-RDTC problem. We first present a method for determining whether the GQRP holds. Based on the GQRP, we then develop a systematic procedure to obtain an exact DUE solution by sequentially solving two LPs: one for the equilibrium cost pattern, including queueing delays, and the other for the corresponding equilibrium flow pattern. Computational results on networks of varying scales confirm the effectiveness of the proposed method.