کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478080 | 1446009 | 2015 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A heuristic for the OD matrix adjustment problem in a congested transport network
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A heuristic for the OD matrix adjustment problem in a congested transport network A heuristic for the OD matrix adjustment problem in a congested transport network](/preview/png/478080.png)
چکیده انگلیسی
• An approximation of the gradient of the objective function in DAP is built.
• An effective descent scheme to numerically solve DAP is presented.
• An actualization scheme for the penalization parameters improves the approximation.
We study the Demand Adjustment Problem (DAP) associated to the urban traffic planning. The framework for the formulation of the DAP is mathematical programming with equilibrium constraints. In particular, if we consider the optimization problem equivalent to the equilibrium problem, the DAP becomes a bilevel optimization problem. In this work we present a descent scheme based on the approximation of the gradient of the objective function of DAP.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 242, Issue 3, 1 May 2015, Pages 807–819
Journal: European Journal of Operational Research - Volume 242, Issue 3, 1 May 2015, Pages 807–819
نویسندگان
Jorgelina Walpen, Elina M. Mancinelli, Pablo A. Lotito,