A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany
المؤلفون المشاركون
المصدر
Mathematical Problems in Engineering
العدد
المجلد 2015، العدد 2015 (31 ديسمبر/كانون الأول 2015)، ص ص. 1-12، 12ص.
الناشر
Hindawi Publishing Corporation
تاريخ النشر
2015-03-22
دولة النشر
مصر
عدد الصفحات
12
التخصصات الرئيسية
الملخص EN
With the aim of supporting the process of adapting railway infrastructure and future traffic needs, we have developed a method to insert additional trains efficiently to an existing timetable without introducing large consecutive delays to scheduled trains.
In this work, the problem is characterized as a job-shop scheduling problem.
In order to meet the limited time requirement and minimize deviations to the existing timetable, the modification that consists of retiming or reordering trains is implemented if and only if it potentially leads to a better solution.
With these issues in mind, the problem of adding train paths is decomposed into two subproblems.
One is finding the optimal insertion for a fixed order timetable and the other is reordering trains.
The two subproblems are solved iteratively until no improvement is possible within a time limit of computation.
An innovative branch and bound algorithm and iterative reordering strategy are proposed to solve this problem in real time.
Unoccupied capacities are utilized as primary resources for additional trains and the transfer connections for passengers can be guaranteed in the new timetable.
From numerical investigations, the proposed framework and associated techniques are tested and shown to be effective.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
Tan, Yuyan& Jiang, Zhibin. 2015. A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany. Mathematical Problems in Engineering،Vol. 2015, no. 2015, pp.1-12.
https://search.emarefa.net/detail/BIM-1073424
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
Tan, Yuyan& Jiang, Zhibin. A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany. Mathematical Problems in Engineering No. 2015 (2015), pp.1-12.
https://search.emarefa.net/detail/BIM-1073424
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
Tan, Yuyan& Jiang, Zhibin. A Branch and Bound Algorithm and Iterative Reordering Strategies for Inserting Additional Trains in Real Time: A Case Study in Germany. Mathematical Problems in Engineering. 2015. Vol. 2015, no. 2015, pp.1-12.
https://search.emarefa.net/detail/BIM-1073424
نوع البيانات
مقالات
لغة النص
الإنجليزية
الملاحظات
Includes bibliographical references
رقم السجل
BIM-1073424
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر