An efficient computation algorithm for area traffic control problem with link capacity expansions
作者:
Highlights:
•
摘要
An area traffic control problem is considered where the set of link capacity expansions and signal setting variables are simultaneously determined. This problem can be formulated as an optimization problem by taking the user equilibrium traffic assignment as a constraint. In this paper, an efficient computation algorithm based on the projected Quasi-Newton method is presented to effectively solve the area traffic control problem. Numerical calculations on a real data road network are conducted. As it shows, the proposed method combining the locally optimal search and global search heuristic achieved substantially better performance than did traditional approaches in solving the area traffic control problem with expansions of link capacity.
论文关键词:Network design,Area traffic control,Projected Quasi-Newton method
论文评审过程:Available online 1 May 2007.
论文官网地址:https://doi.org/10.1016/j.amc.2006.09.129