کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4635947 1340717 2007 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An efficient computation algorithm for area traffic control problem with link capacity expansions
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
An efficient computation algorithm for area traffic control problem with link capacity expansions
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 188, Issue 2, 15 May 2007, Pages 1094–1102
نویسندگان
,