|Table of Contents|

Optimal algorithm of unpaired locomotive working diagram with compact return locomotives at return station(PDF)

《交通运输工程学报》[ISSN:1671-1637/CN:61-1369/U]

Issue:
2010年02期
Page:
95-98
Research Field:
交通运输规划与管理
Publishing date:
2010-04-20

Info

Title:
Optimal algorithm of unpaired locomotive working diagram with compact return locomotives at return station
Author(s):
XIE Jin-bao
School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, Gansu, China
Keywords:
railway transportation;  locomotive working diagram;  network flow;  compact return
PACS:
U292.61
DOI:
-
Abstract:
One kind of plotting algorithm of unpaired locomotive working diagram was discussed. At locomotive return station, the network flow model was applied to figure out the scheme of paired locomotive working diagram, the diagram meeted the optimal requirements on unpaired locomotive working diagram, and could assign residual locomotives to their nearest train paths respectively. At locomotive home station, the departure or arrival time of train path with extra return locomotive was inserted into the list of train departure or arrival time, and the unpaired locomotive working diagram was transferred to paired locomotive working diagram, and the assigning problem of paired locomotive working diagram was solved by using searching-optimization-at-form method. Analysis result shows that when the unpaired factor is 0.78, and the locomotive staying time standards at both of station ends are same, the proportion between the general staying time of locomotive home station and that of locomotive return station is no less than 1.25. The extra staying time of locomotive at return station is further transferred to home station by using the optimal algorithm, so the locomotive can compactly return at return station. 3 tabs, 1 fig, 10 refs.

References:

[1] 肖龙文.最优机车周转图的自动化铺划[J].长沙铁道学院学报,1999,17(1):52-57.XIAO Long-wen. Computerized planning of the optimal locomotive working diagram[J]. Journal of Changsha Railway University, 1999, 17(1): 52-57.(in Chinese)
[2] 谢金宝,永 秀.利用网络技术求解机车交路方案[J].铁道学报,1996,18(5):9-13. XIE Jin-bao, YONG Xiu. Algorithm of optimizing locomotive working diagram by using operational network technology[J]. Journal of the China Railway Society, 1996, 18(5): 9-13.(in Chinese)
[3] 杨希流.优化机车周转图的简便方法[J].铁道运输与经济,1990,12(5):31-34. YANG Xi-liu. A simple algorithm of optimizing locomotive working diagram[J]. Railway Transport and Economy, 1990, 12(5): 31-34.(in Chinese)
[4] 吕红霞,杨明伦,毛节铭.计算机编制不成对机车周转图的研究[J].西南交通大学学报,1998,33(4):20-24. LU Hong-xia, YANG Ming-lun, MAO Jie-ming. Working-out of non-pair locomotive working diagrams with a computer[J]. Journal of Southwest Jiaotong University, 1998, 33(4): 20-24.(in Chinese)
[5] 史 峰,胡安洲.机车周转图的线性配置算法[J].铁道学报,1996,8(4):18-24. SHI Feng, HU An-zhou. A linear algorithm to deploy a locomotive circulating diagram [J]. Journal of the China Railway Society, 1996, 8(4): 18-24.(in Chinese)
[6] 闫海峰,崔 燚.编制机车周转图的优化模型[J].中国铁道科学,2006,27(4):123-128. YAN Hai-feng, CUI Yi. Optimization model of locomotive working diagram[J]. China Railway Science, 2006, 27(4): 123-128.(in Chinese)
[7] 高小平,张兴国.计算机编制机车周转图研究[J].铁路计算机应用,2003,12(9):15-17. GAO Xiao-ping, ZHANG Xing-guo. Research on establishment of locomotive working diagram by computer[J]. Railway Computer Application, 2003, 12(9): 15-17.(in Chinese)
[8] 何奉道,梁向阳,何冬昀.机车周转图编制的自适应遗传算法[J].西南交通大学学报,2006,41(3):273-278. HE Feng-dao, LIANG Xiang-yang, HE Dong-yun. Self-adaptive genetic algorithm for locomotive diagram[J]. Journal of Southwest Jiaotong University, 2006, 41(3): 273-278.(in Chinese)
[9] 王 瑶.铁路机车周转图编制模型与算法研究[J].铁道运输与经济,2008,30(9):84-87. WANG Yao. Study on drawing model of railway locomotive working diagram and its algorithm[J]. Railway Transport and Economy, 2008, 30(9): 84-87.(in Chinese)
[10] 王 铁,王慈光,肖 蕾.肩回交路下机车牵引方式的研究[J].陕西工学院学报,2005,21(2):66-68. WANG Tie, WANG Ci-guang, XIAO Lei. Study of mode of traction in shoulder-circuit locomotive routing[J]. Journal of Shaanxi Institute of Technology, 2005, 21(2): 66-68.(in Chinese)

Memo

Memo:
-
Last Update: 2010-04-20