计算机工程与应用2025，Vol.61Issue(24)：103-115,13.DOI:10.3778/j.issn.1002-8331.2505-0338
非可加交通分配问题建模及高效求解算法研究
Modeling and Efficient Solution Algorithms for Non-Additive Traffic Assignment Problem
摘要
Abstract
Among existing solution methods for the non-additive traffic assignment problem(NaTAP),only the gradient projection(GP)algorithm solves large-scale networks,indicating an urgent need to explore efficient algorithms that are suitable for real-world traffic networks.In contrast,numerous mature algorithms have been developed for the traditional additive traffic assignment problem(TAP)that efficiently solve large-scale networks.Since NaTAP needs to be modeled and solved in the path flow space,only path-based TAP algorithms such as Greedy,improved social pressure(ISP),path equilibration(PE),projected gradient(PG),and reduced gradient(RG)have potential applicability.To apply ISP,PE,PG,and RG algorithms to NaTAP,a nonlinear programming model is formulated with path flows as variables.In addition,it introduces the Greedy algorithm by exploiting the equivalence between NaTAP and the variational inequality problem(VIP)and proposes a simplex projection(SP)algorithm based on the simplex structure of the VIP feasible set.Within a unified computational framework,the applicability of these algorithms to large-scale NaTAP is systematically evaluated.Numerical experiments demonstrate that GP and SP achieve higher convergence speed and stability,while Greedy and PE exhibit relatively weak stability,and ISP,PG,and RG are inefficient.关键词
非可加交通分配问题/基于路径的算法/非线性规划问题/变分不等式问题/数值研究Key words
non-additive traffic assignment problem/path-based algorithms/nonlinear programming problem/variational inequality problem/numerical study分类
信息技术与安全科学引用本文复制引用
HU Wangxin,HUANG Zhongxiang,LI Heng,CAI Jianrong..非可加交通分配问题建模及高效求解算法研究[J].计算机工程与应用,2025,61(24):103-115,13.基金项目
国家自然科学基金(51978082,52302389) （51978082,52302389）
湖南省研究生科研创新项目(CX20240760). （CX20240760）
