مدل ها و الگوریتم آرامش برای مشکل طراحی شبکه پیوسته با طرح اعتباری قابل معامله و محدودیت برابری
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|70518||2014||10 صفحه PDF||سفارش دهید||7557 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Computers & Operations Research, Volume 41, January 2014, Pages 252–261
The sustainable problems of transportation have become noticeable in the majority of cities worldwide. Many researchers are devoted themselves into traffic congestion. Generally, traffic congestion could be alleviated via increasing road capacity (supply) or reducing traffic (demand). In this paper, we model CNDP which has a tradable credit scheme and equity constraints in order to research on the way of releasing congestion by combining increasing supply and reducing demand. Firstly, the bilevel programming problem is proposed to model the CNDP with a tradable credit scheme. The upper level (the government) chooses optimal capacity enhancement for some existing links to minimize the total system costs under a budget constraint. The lower level chooses the optimal route based on considering the generalized travel cost in which both travel time and credit charging for using the link are involved. And then, considering the inequity problem in terms of equilibrium O–D travel cost and link travel time, the model is proposed by incorporating equity constraints into CNDP with a tradable credit scheme. After presenting a relaxation algorithm, the experiments on Sioux Falls network are illustrated. Finally, conclusion and some future research directions are presented.