Heuristic Bus Network Design Method Using Graph Theory

Message:
Abstract:
Urban bus transportation is one of the common public transportation modes, which has a significant position among all other modes. Any attempt in order to increase the effectiveness and desirability of this mode has a positive influence on the urban trips. Bus network design due to its considerable influence on the performance of this mode is of great importance. And various approaches have been proposed in this context, which have different advantages and disadvantages. Reaching the optimal network in the shortest possible time, considering the parameters which are in conflict with each other most of the time, is the main reason of the complexity of bus network design problem, and makes constraints for the designers. The present paper proposes a heuristic approach for solving bus network design, which is based on graph theory. The proposed methodology designs bus network in two steps of route generating and route selection. For the evaluation purpose, this method compared to other heuristic methods. The results showed that the proposed method outperforms the other existing heuristic network design methods
Language:
Persian
Published:
Journal of Transportation Research, Volume:9 Issue: 4, 2013
Page:
359
magiran.com/p1094723  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!