A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
复制标题
DOI：
10.1016/j.cor.2014.01.012
复制
发表时间：
2014-07
期刊：
影响因子：
--
通讯作者：
S. Ryu;A. Chen;Keechoo Choi
中科院分区：
文献类型：
--
作者：
S. Ryu;A. Chen;Keechoo Choi
本文开发了一种基于路径的流量分配算法来解决弹性需求流量分配问题（EDTAP）。提出了一种与列生成相结合的改进的基于路径的梯度投影（GP）方法来解决该问题的等效超额需求重新表述，其中通过适当修改网络表示将弹性需求问题重新表述为固定需求问题。使用一组真实交通网络的数值结果证明了改进的 GP 算法解决 EDTAP 超额需求公式的效率。此外，还进行了敏感性分析，以检查弹性需求函数中使用的缩放参数对估计总需求、生成路径数量、使用路径数量以及改进的 GP 算法的计算量的影响。
This paper develops a path-based traffic assignment algorithm for solving the elastic demand traffic assignment problem (EDTAP). A modified path-based gradient projection (GP) method combined with a column generation is suggested for solving the equivalent excess-demand reformulation of the problem in which the elastic demand problem is reformulated as a fixed demand problem through an appropriate modification of network representation. Numerical results using a set of real transportation networks are provided to demonstrate the efficiency of the modified GP algorithm for solving the excess-demand formulation of the EDTAP. In addition, a sensitivity analysis is conducted to examine the effects of the scaling parameter used in the elastic demand function on the estimated total demand, number of generated paths, number of used paths, and computational efforts of the modified GP algorithm.