文章基本信息

标题：Modeling and Algorithms of the Crew Scheduling Problem on High-speed Railway Lines
本地全文：下载
作者：Zhiqiang Tian ; Zhiqiang Tian ; Qi Songa 等
期刊名称：Procedia - Social and Behavioral Sciences
印刷版ISSN：1877-0428
出版年度：2013
卷号：96
页码：1443-1452
DOI：10.1016/j.sbspro.2013.08.164
语种：English
出版社：Elsevier
摘要：AbstractThe crew scheduling plan on high-speed railway is usually represented as set covering problem, and can be solved by selecting a set of crew routes in a large number of feasible crew routes. It is usually difficult to find the optimal solution for this problem, because the number of the train lines is large and the generation of crew routes are restricted by many regulations. By analyzing the characteristic of crew scheduling plan on high-speed railway in China, this dissertation divides the process for working out the plan into two phases. Since the cost of the crew scheduling plan is determined at the first phase, this dissertation mainly focuses on the modeling of this sub problem. The effectiveness of the algorithm is testified by a real world numerical example of Beijing-Tianjin high-speed railway.
关键词：High-speed railway lines;crew scheduling plan;set covering problem;improved ant colony algorithm