Optimal algorithm of unpaired locomotive working diagram with compact return locomotives at return station
-
摘要: 提出了不成对机车周转图的一种铺画方法, 在机车折返站, 运用网络流模型确定出不成对机车周转图上满足最优化要求的基本成对机车周转图方案, 为未获指派的机车就近勾画交路。在基本段所在站, 将附挂回送机车的运行线在该站的运行时刻插入相应的时刻序列, 将基本段所在站不成对机车周转图问题转化为成对机车周转图问题, 利用表上寻优算法求解成对机车周转图交路方案。分析结果表明: 对不成对系数为0.78、两端站机车停留时间标准相同的机车周转图, 计算得到机车在基本段所在站总停留时间与折返段所在站总停留时间之比不小于1.25, 该算法将机车在折返段的额外停留时间最大限度地转移到基本段, 满足了机车在折返站紧凑折返的要求。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.
-
Key words:
- railway transportation /
- locomotive working diagram /
- network flow /
- compact return
-
表 1 AB区段列车到发时刻
Table 1. Train departure schedules between A and B sections
min 车次 A站出发 B站到达 车次 B站出发 A站到达 1 120 360 2 60 300 3 240 480 4 180 420 5 480 780 6 300 540 7 660 900 8 600 840 9 900 1 140 10 720 960 11 1 140 1 380 12 900 1 140 13 1 320 90 14 1 080 1 320 16 1 200 0 18 1 350 120 
下载: 导出CSV
表 2 A站机车周转方案寻优
Table 2. Searching optimization of locomotive turnaround schedule at station A
min 车次与时刻 1 3 5 7 9 11 13 120 240 480 660 900 1 140 1 320 16 0 240 480 660 900 1 140 1 320 18 120 1 440 360 540 780 1 020 1 200 2 300 1 260 1 380 360 600 840 1 020 4 420 1 140 1 260 1 500 240 480 720 900 6 540 1 020 1 140 1 380 120 600 780 10 960 600 720 960 1 140 1 380 360 12 1 140 420 540 780 960 1 200 1 440 8 840 720 840 1 080 1 260 1 500 480 14 1 320 360 600 780 1 020 1 260 1 440
下载: 导出CSV
表 3 B站机车周转方案寻优
Table 3. Searching optimization of locomotive turnaround schedule at station B
min 车次与时刻 6 8 10 12 14 16 18 2 4 300 600 720 900 1 080 1 200 1 350 60 180 13 90 510 630 810 990 1 110 1 260 1 410 1 530 1 360 1 380 360 540 720 840 990 1 140 1 260 1 360 1 380 240 540 720 840 990 1 140 1 260 3 480 1 260 120 240 600 720 870 1 020 1 140 5 780 960 1 260 1 380 120 420 570 720 840 7 900 840 1 140 1 260 1 440 180 450 600 720 9 1 140 600 900 1 020 1 200 1 380 1 500 360 480 11 1 380 360 660 780 960 1 140 1 260 1 410 240 11 1 380 360 660 780 960 1 140 1 260 1 410 120
下载: 导出CSV
-
[1] 肖龙文. 最优机车周转图的自动化铺划[J]. 长沙铁道学院学报, 1999, 17(1): 52-57. doi: 10.3969/j.issn.1672-7029.1999.01.012XI AO Long-wen. Computerized planning of the optimal locomotive working diagram[J]. Journal of Changsha Railway University, 1999, 17(1): 52-57. (in Chinese) doi: 10.3969/j.issn.1672-7029.1999.01.012 [2] 谢金宝, 永秀. 利用网络技术求解机车交路方案[J]. 铁道学报, 1996, 18(5): 9-13. doi: 10.3321/j.issn:1001-8360.1996.05.002XIE Jin-bao, YONG Xiu. Algorithm of optimizing locomotive working diagram by using operational network technology[J]. Journal of the China Rail way Society, 1996, 18(5): 9-13. (in Chinese) doi: 10.3321/j.issn:1001-8360.1996.05.002 [3] 杨希流. 优化机车周转图的简便方法[J]. 铁道运输与经济, 1990, 12(5): 31-34. https://www.cnki.com.cn/Article/CJFDTOTAL-TDYS199005015.htmYANG Xi-liu. A simple algorithm of optimizing locomotive working diagram[J]. Railway Transport and Economy, 1990, 12(5): 31-34. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-TDYS199005015.htm [4] 吕红霞, 杨明伦, 毛节铭. 计算机编制不成对机车周转图的研究[J]. 西南交通大学学报, 1998, 33(4): 20-24. https://www.cnki.com.cn/Article/CJFDTOTAL-XNJT804.003.htmLU 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) https://www.cnki.com.cn/Article/CJFDTOTAL-XNJT804.003.htm [5] 史峰, 胡安洲. 机车周转图的线性配置算法[J]. 铁道学报, 1996, 8(4): 18-24. doi: 10.3321/j.issn:1001-8360.1996.04.003SHI 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) doi: 10.3321/j.issn:1001-8360.1996.04.003 [6] 闫海峰, 崔燚. 编制机车周转图的优化模型[J]. 中国铁道科学, 2006, 27(4): 123-128. doi: 10.3321/j.issn:1001-4632.2006.04.024YAN Hai-feng, CUI Yi. Optimization model of locomotive working diagram[J]. China Railway Science, 2006, 27(4): 123-128. (in Chinese) doi: 10.3321/j.issn:1001-4632.2006.04.024 [7] 高小平, 张兴国. 计算机编制机车周转图研究[J]. 铁路计算机应用, 2003, 12(9): 15-17. doi: 10.3969/j.issn.1005-8451.2003.09.007GAO Xiao-ping, ZHANG Xing-guo. Research on establishment of locomotive working diagramby computer[J]. Railway Computer Application, 2003, 12(9): 15-17. (in Chinese) doi: 10.3969/j.issn.1005-8451.2003.09.007 [8] 何奉道, 梁向阳, 何冬昀. 机车周转图编制的自适应遗传算法[J]. 西南交通大学学报, 2006, 41(3): 273-278. doi: 10.3969/j.issn.0258-2724.2006.03.002HE Feng-dao, LI ANG Xiang-yang, HE Dong-yun. Selfadaptive genetic algorithmfor locomotive diagram[J]. Journal of Southwest Jiaotong University, 2006, 41(3): 273-278. (in Chinese) doi: 10.3969/j.issn.0258-2724.2006.03.002 [9] 王瑶. 铁路机车周转图编制模型与算法研究[J]. 铁道运输与经济, 2008, 30(9): 84-87. doi: 10.3969/j.issn.1003-1421.2008.09.025WANG Yao. Study on drawing model of rail way locomotive working diagram and its algorithm[J]. Railway Transport and Economy, 2008, 30(9): 84-87. (in Chinese) doi: 10.3969/j.issn.1003-1421.2008.09.025 [10] 王铁, 王慈光, 肖蕾. 肩回交路下机车牵引方式的研究[J]. 陕西工学院学报, 2005, 21(2): 66-68. doi: 10.3969/j.issn.1673-2944.2005.02.024WANG Tie, WANG Ci-guang, XI AO Lei. Study of mode of tractionin shoulder-circuit locomotive routing[J]. Journal of Shaanxi Institute of Technology, 2005, 21(2): 66-68. (in Chinese) doi: 10.3969/j.issn.1673-2944.2005.02.024 -
点击查看大图
图(1) / 表(3)
计量
- 文章访问数: 489
- HTML全文浏览量: 47
- PDF下载量: 562
- 被引次数: 0
