Method for establishing locomotive working diagram based on sequential connection of locomotive routing

被引：0
作者：
Zhang, Jie [1 ,2 ]
Ni, Shaoquan [1 ,2 ]
Ge, Lulu [1 ,2 ]
Chen, Dingjun [1 ,2 ]
机构：
[1] School of Transportation and Logistics, Southwest Jiaotong University
[2] National United Engineering Laboratory of Integrated and Intelligent Transportation, Southwest Jiaotong University
来源：
Zhongguo Tiedao Kexue/China Railway Science | 2014年 / 35卷 / 02期
关键词：
Locomotive routing connection; Locomotive turn-around time; Locomotive working diagram;
D O I：
10.3969/j.issn.1001-4632.2014.02.16
中图分类号：
学科分类号：
摘要：
This paper presents an optimized locomotive working diagram model based on its practical scheduling process which is to achieve minimized turn-around time as the objective whose requirements are constrained by the relationships defined by the total number of the locomotives at arrival and departure stations, the total turn-back time cost at turn-around stations as well as the locomotives can only be allowed to be allocated at the same station. By proving the sequential characteristic that the locomotive working diagram formulating problem under constant turn-back time can be always transformed into a feasible solution respecting the principle of sequential routing connection, this paper establishes the algorithms for both scenarios including paired and unpaired locomotives. This is shown by the Guangyuan-Chengdu section of Baoji-Chengdu Railway as the example solved by the proposed model and algorithms. Better application effect of the model is demonstrated in this paper through the comparison between practical locomotive working diagram with its optimized one which saved the turn-around time about 72 hours (3.8%) and reduced the number of locomotives by 3 units (3.8%) in total.
引用
收藏
页码：98 / 103
页数：5
相关论文
共 12 条
  • [1] Booler J.M.P., The solution of a railway locomotive scheduling problem, Journal of the Operational Research Society, 31, 10, pp. 943-948, (1980)
  • [2] Wright M.B., Applying stochastic algorithms to a locomotive scheduling problem, Journal of the Operational Research Society, 40, 2, pp. 187-192, (1989)
  • [3] Ziarati K., Soumis F., Desrosiers J., Et al., Locomotive assignment with heterogeneous consist at CN north america, European Journal of Operational Research, 97, 2, pp. 281-292, (1997)
  • [4] Ziarati K., Soumis F., Desosiers J., Et al., A branch-first, cut-second approach for locomotive assignment, Management Science Journal, 45, 8, pp. 1156-1168, (1999)
  • [5] Ahuja R.K., Liu J., Orlin J.B., Et al., Solving real-life locomotive scheduling problems, Transportation Science, 39, 4, pp. 503-517, (2005)
  • [6] Xie J., Yong X., Algorithm of optimizing locomotive working diagram by using operational network technology, Journal of the China Railway Society, 18, 5, pp. 9-13, (1996)
  • [7] Yan H., Cui Y., Optimization model of locomotive working diagram, China Railway Science, 27, 4, pp. 123-128, (2006)
  • [8] Yang X., A simple algorithm of optimizing locomotive working diagram, Railway Transport and Economy, 12, 5, pp. 31-34, (1990)
  • [9] Lu H., Yang M., Mao J., Working-out of non-pair locomotive working diagrams with a computer, Journal of Southwest Jiaotong University, 33, 4, pp. 378-382, (1998)
  • [10] Xiao L., Computerized planning of the optimal locomotive working diagram, Journal of Changsha Railway University, 17, 1, pp. 52-57, (1999)
12