کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4968432 1449664 2017 23 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Train routing and timetabling problem for heterogeneous train traffic with switchable scheduling rules
ترجمه فارسی عنوان
آموزش مسیریابی و زمانبندی مشکل برای ترافیک ناهمگن قطار با قوانین برنامه ریزی قابل تعویض
کلمات کلیدی
زمان بندی آموزش قطار، مسیریابی ترافیک قطار ناهمگن، قانون برنامه ریزی قابل تعویض،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی
This paper proposes a mathematical model for the train routing and timetabling problem that allows a train to occasionally switch to the opposite track when it is not occupied, which we define it as switchable scheduling rule. The layouts of stations are taken into account in the proposed mathematical model to avoid head-on and rear-end collisions in stations. In this paper, train timetable could be scheduled by three different scheduling rules, i.e., no switchable scheduling rule (No-SSR) which allows trains switching track neither at stations and segments, incomplete switchable scheduling rule (In-SSR) which allows trains switching track at stations but not at segments, and complete switchable scheduling rule (Co-SSR) which allows trains switching track both at stations and segments. Numerical experiments are carried out on a small-scale railway corridor and a large-scale railway corridor based on Beijing-Shanghai high-speed railway (HSR) corridor respectively. The results of case studies indicate that Co-SSR outperforms the other two scheduling rules. It is also found that the proposed model can improve train operational efficiency.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part C: Emerging Technologies - Volume 84, November 2017, Pages 196-218
نویسندگان
, , , ,