Demand Box Uncertainty Evaluation in Discrete and Continuous Transportation Network Design with Genetic and Ant Colony Algorithms

Message:
Abstract:
Uncertain demand is one of the most important sources of uncertainties in transportation networks. It is almost based on various sources such as difficulty in forecasting of socio economic variables and the model’s deficiency. This demand is one of the main operative elements of transportation network design problems. The aim of this paper is to evaluate the effect of demand variability in discrete and continuous transportation network design problem. Thus, the uncertainty of demand has been assumed to have a maximum and a minimum rate, and the level of uncertainty in demand is assumed to vary between these extreme values as in a box. In this paper two Meta heuristic methods; Ant Colony Optimization (ACO) and Genetic Algorithm (GA), has been used to solve the aforementioned problem. It has been shown in this paper that relative to designing a network with maximum demand, the proposed method has found demands with 4 to 10 percent longer travel time. This could considerable effect on results of the network design problem.
Language:
Persian
Published:
Journal of Transportation Engineering, Volume:2 Issue: 3, 2012
Page:
205
magiran.com/p1005320  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!