Demand-oriented timetable design for urban rail transit under stochastic demand

Abstract:
In the context of public transportation system, improving the service quality and robustness through minimizing the average passengers waiting time is a real challenge. This study provides robust stochastic programming models for train timetabling problem in urban rail transit systems. The objective is minimization of the weighted summation of the expected cost of passenger waiting time, its variance and the penalty function including the capacity violation due to overcrowding. In the proposed formulations, the dynamic and uncertain travel demand is represented by the scenario-based multi-period arrival rates of passenger. Two versions of the robust stochastic programming models are developed and a comparative analysis is conducted to testify the tractability of the models. The effectiveness of the proposed stochastic programming model was demonstrated through the application to Tehran underground urban railway. The outcomes show the reductions in expected passenger waiting time of 22%, and cost variance drop of 60% compared with the baseline plans using the proposed robust optimization approach.
Language:
English
Published:
Journal of Industrial and Systems Engineering, Volume:9 Issue: 3, Summer 2016
Pages:
28 to 56
magiran.com/p1566725  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!