| Citation: | ZHENG Yajing, ZHANG Dekun. Pareto Frontier Analysis of Placing-in and Taking-out Wagons Problem on Railway Sidings[J]. Journal of Southwest Jiaotong University. doi: 10.3969/j.issn.0258-2724.20240464 |
To meet the multi-objective optimization requirements for placing-in, taking-out, and transferring wagons on railway sidings and to provide a basis for selecting placing-in and taking-out operation schemes, a two-level optimization model was developed for the placing-in and taking-out wagons problem on hybrid railway sidings. The primary objective was to minimize the total running time of shunting locomotives, while the secondary objective was to minimize both the total wagon-hours on sidings and the total wagon-kilometers traveled, subject to maintaining the optimal value of the primary objective. To solve this model, a multi-objective simulated annealing algorithm was designed. First, the shortest path covering only the loading and unloading stations with transfer demands was obtained using a single-objective simulated annealing algorithm. Then, based on the hierarchical characteristics of hybrid sidings, an insertion operator was developed to incorporate the remaining loading and unloading stations with placing-in and taking-out demands into the shortest path, thus generating an initial scheme with the minimum shunting locomotive running time. Finally, turnouts and freight stations were designated as root nodes, while nodes visited sequentially under the same root were treated as subtrees. A neighborhood transformation method was proposed that exchanges the order in which subtrees under the same root are visited. Results indicate that the proposed algorithm yields a Pareto frontier consisting of five non-dominated solutions, each with a shunting locomotive running time of 304 min, total wagon-hours ranging from 6219 to 6317 min, and total wagon-kilometers ranging from 1443.1 to 1481.5 km. The hypervolume (HV) value reaches its maximum after approximately 40 cooling iterations, demonstrating the algorithm’s good convergence performance and its ability to effectively obtain the Pareto frontier of the placing-in and taking-out wagons problem on railway sidings.
| [1] |
王慈光. 树枝形专用线取送车问题的研究[J]. 西南交通大学学报, 1996, 31(6): 101-106.
Wang Ciguang. A study on placing-in and taking-out of wagons on branch-shaped sidings[J]. Journal of Southwest Jiaotong University, 1996, 31(06): 101-106.
|
| [2] |
郭垂江. 树枝形货物作业点取送车作业方案的多目标优化模型及算法[J]. 中国铁道科学, 2017, 38(1): 138-143. doi: 10.3969/j.issn.1001-4632.2017.01.19
Guo Chuijiang. Multi-objective optimization model and algorithm for scheme of placing-in and taking-out of wagons in branch-shaped freight operation sites[J]. China Railway Science, 2017, 38(1): 138-143. doi: 10.3969/j.issn.1001-4632.2017.01.19
|
| [3] |
李冰, 张志宁. 基于双重目标的树枝形专用线取送车优化[J]. 计算机工程与设计, 2020, 41(9): 2460-2468. doi: 10.16208/j.issn1000-7024.2020.09.010
Li Bing, Zhang Zhining. Optimization of placing-in and taking-out wagons on branch-shaped siding considering bi-objective[J]. Computer Engineering and Design, 2020, 41(9): 2460-2468. doi: 10.16208/j.issn1000-7024.2020.09.010
|
| [4] |
杨运贵, 王慈光, 薛锋. 树枝形铁路专用线取送车问题的遗传算法研究[J]. 计算机工程与应用, 2008, 44(12): 210-211. doi: 10.3778/j.issn.1002-8331.2008.12.063
Yang Yungui, Wang Ciguang, Xue Feng. Study on genetic algorithm for railway placing-in and taking-out of wagons in branch-shaped private siding[J]. Computer Engineering and Applications, 2008, 44(12): 210-211. doi: 10.3778/j.issn.1002-8331.2008.12.063
|
| [5] |
李海军, 朱昌锋. 放射形铁路专用线直达车流取送车问题的单亲遗传算法研究[J]. 铁道科学与工程学报, 2011, 8(6): 114-117. doi: 10.3969/j.issn.1672-7029.2011.06.023
Li Haijun, Zhu Changfeng. Study of through wagon flow on single-parent genetic algorithm for railway placing-in and taking-out of wagons in actinoid private line[J]. Journal of Railway Science and Engineering, 2011, 8(6): 114-117. doi: 10.3969/j.issn.1672-7029.2011.06.023
|
| [6] |
户佐安, 怡智航, 张文豪, 等. 混合型铁路专用线网络多调机取送车作业优化[J]. 铁道科学与工程学报, 2025, 22(07): 2973-2984. doi: 10.19713/j.cnki.43-1423/u.T20241553
Hu Zuoan, Yi Zhihang, Zhang Wenhao, et al. Optimization of pick-up and delivery vehicles with multiple locomotives in hybrid special railway lines network[J]. Journal of Railway Science and Engineering, 2025, 22(07): 2973-2984. doi: 10.19713/j.cnki.43-1423/u.T20241553
|
| [7] |
牟峰, 王慈光, 左大杰, 等. 放射形专用线取送车模型及算法[J]. 西南交通大学学报, 2010, 45(1): 104-110, 123. doi: 10.3969/j.issn.0258-2724.2010.01.018
Mu Feng, Wang Ciguang, Zuo Dajie, et al. Model and algorithm for taking out and placing in wagons in shunting operation on radial private lines[J]. Journal of Southwest Jiaotong University, 2010, 45(1): 104-110, 123. doi: 10.3969/j.issn.0258-2724.2010.01.018
|
| [8] |
雷友诚, 吴志飞. 改进的蚁群算法在放射形专用线取送车优化中的应用[J]. 控制工程, 2012, 19(6): 1007-1010. doi: 10.3969/j.issn.1671-7848.2012.06.019
Lei Youcheng, Wu Zhifei. Optimization of placing-in and taking-out wagons on branch-shaped railway lines based on enhanced ant colony algorithm[J]. Control Engineering of China, 2012, 19(6): 1007-1010. doi: 10.3969/j.issn.1671-7848.2012.06.019
|
| [9] |
张文晰, 陈崇双, 薛锋, 等. 树枝形专用线直达车流取送车模型及算法[J]. 铁道学报, 2014, 36(6): 1-8. doi: 10.3969/j.issn.1001-8360.2014.06.001
Zhang Wenxi, Chen Chongshuang, Xue Feng, et al. Model and algorithm of taking-out and placing-in shunting of through wagon flow on branch-shaped sidings[J]. Journal of the China Railway Society, 2014, 36(6): 1-8. doi: 10.3969/j.issn.1001-8360.2014.06.001
|
| [10] |
程磊, 沈洋洋. 基于改进元胞蚁群算法的铁路取送车问题研究[J]. 合肥工业大学学报(自然科学版), 2018, 41(11): 1496-1501. doi: 10.3969/j.issn.1003-5060.2018.11.011
Cheng Lei, Shen Yangyang. Research on the problem of placing-in and taking-out wagons based on improved cellular ant colony algorithm[J]. Journal of Hefei University of Technology(Natural Science), 2018, 41(11): 1496-1501. doi: 10.3969/j.issn.1003-5060.2018.11.011
|
| [11] |
郭垂江. 基于阶段计划的取送车调车作业计划编制优化研究[J]. 铁道学报, 2019, 41(10): 10-16. doi: 10.3969/j.issn.1001-8360.2019.10.002
Guo Chuijiang. Research on optimization of formulation for shunting operation plan of placing-in and taking-out wagon based on phase plan[J]. Journal of the China Railway Society, 2019, 41(10): 10-16. doi: 10.3969/j.issn.1001-8360.2019.10.002
|
| [12] |
郭垂江, 李娜, 李晟东. 异常情况下树枝形货物作业点取送车计划编制[J]. 北京交通大学学报, 2025, 49(2): 48-57.
Guo Chuijiang, Li Na, Li Shengdong. Preparation of wagon delivery and retrieval plans at branch-shaped cargo operation sites under abnormal conditions[J]. Journal of Beijing Jiaotong University, 2025, 49(2): 48-57.
|
| [13] |
董鹏, 吴艳群. 改进的模拟退火算法在放射形专用线取送车优化中的应用[J]. 武汉理工大学学报(交通科学与工程版), 2015, 39(6): 1175-1179, 1185. doi: 10.3963/j.issn.2095-3844.2015.06.018
Dong Peng, Wu Yanqun. Improved simulated annealing algorithm and its application in optimization for collection and delivery shunting of through wagon flow on actinoid private line[J]. Journal of Wuhan University of Technology (Transportation Science Engineering), 2015, 39(6): 1175-1179, 1185. doi: 10.3963/j.issn.2095-3844.2015.06.018
|
| [14] |
段征宇, 雷曾翔, 孙硕, 等. 随机时变车辆路径问题的多目标鲁棒优化方法[J]. 西南交通大学学报, 2019, 54(3): 565-572. doi: 10.3969/j.issn.0258-2724.20170617
Duan Zhengyu, Lei Zengxiang, Sun Shuo, et al. Multi-objective robust optimization method for stochastic time-dependent vehicle routing problem[J]. Journal of Southwest Jiaotong University, 2019, 54(3): 565-572. doi: 10.3969/j.issn.0258-2724.20170617
|
| [15] |
汤希峰, 何杰, 张浩. 考虑碳排放的两阶段选址-路径问题及其算法[J]. 西南交通大学学报, 2023, 58(5): 1110-1116, 1125. doi: 10.3969/j.issn.0258-2724.20210773
Tang Xifeng, He Jie, Zhang Hao. Two-echelon location routing problem considering carbon emissions and its algorithm[J]. Journal of Southwest Jiaotong University, 2023, 58(5): 1110-1116, 1125. doi: 10.3969/j.issn.0258-2724.20210773
|
| [16] |
Cavaliere F, Accorsi L, Laganà D, et al. An efficient heuristic for very large-scale vehicle routing problems with simultaneous pickup and delivery[J]. Transportation Research Part E: logistics and transportation review, 2024, 186: 103550. doi: 10.1016/j.tre.2024.103550
|
| [17] |
丛铭, 宋瑞, 何世伟, 等. 混合型专用线取送作业方案编制优化研究[J]. 铁道科学与工程学报, 2025, 22(4): 1519-1529. doi: 10.19713/j.cnki.43-1423/u.T20240997
Cong Ming, Song Rui, He Shiwei, et al. Optimization of placing-in and taking-out operation scheme on mixed-shaped sidings[J]. Journal of Railway Science and Engineering, 2025, 22(4): 1519-1529. doi: 10.19713/j.cnki.43-1423/u.T20240997
|
| [18] |
牟峰, 王慈光, 牟从凯. 铁路车站取送车作业问题一般模型解的构造方法[J]. 中国铁道科学, 2012, 33(5): 105-113. doi: 10.3969/j.issn.1001-4632.2012.05.16
Mu Feng, Wang Ciguang, Mu Congkai. A method for generating solutions of the generic model for taking-out and placing-in wagons in railway station[J]. China Railway Science, 2012, 33(5): 105-113. doi: 10.3969/j.issn.1001-4632.2012.05.16
|
| [19] |
郭垂江, 孙小月, 陈韬, 等. 混合型货物作业点取送车作业优化通用模型及算法[J]. 中国铁道科学, 2022, 43(3): 164-172. doi: 10.3969/j.issn.1001-4632.2022.03.18
Guo Chuijiang, Sun Xiaoyue, Chen Tao, et al. General optimization model and algorithm for placing-in and taking-out wagons in mixed freight operation sites[J]. China Railway Science, 2022, 43(3): 164-172. doi: 10.3969/j.issn.1001-4632.2022.03.18
|
| [20] |
李冰, 徐光兰, 轩华. 带能力限制的混合形专用线非直达车流取送问题优化[J]. 运筹与管理, 2022, 31(6): 9-16. doi: 10.12005/orms.2022.0176
Li Bing, Xu Guanglan, Xuan Hua. Taking-out and placing-in shunting of non-through wagon flow with capacity limited on hybrid siding[J]. Operations Research and Management Science, 2022, 31(6): 9-16. doi: 10.12005/orms.2022.0176
|
| [21] |
李金忠, 夏洁武, 曾小荟, 等. 多目标模拟退火算法及其应用研究进展[J]. 计算机工程与科学, 2013, 35(8): 77-88. doi: 10.3969/j.issn.1007-130X.2013.08.013
Li Jinzhong, Xia Jiewu, Zeng Xiaohui, et al. Survey of multi-objective simulated annealing algorithm and its applications[J]. Computer Engineering and Science, 2013, 35(8): 77-88. doi: 10.3969/j.issn.1007-130X.2013.08.013
|
| [22] |
Bandyopadhyay S, Saha S, Maulik U, et al. A simulated annealing based multi-objective optimization algorithm: AMOSA[J]. IEEE Transactions on Evolutionary Computation, 2008, 12(3): 269-283. doi: 10.1109/TEVC.2007.900837
|
| [23] |
Duan Gang, Fan Tao, Chen Li, et al. Floating marine debris mitigation by vessel routing modeling and optimization considering carbon emission and travel time[J]. Transportation Research Part C: Emerging Technologies, 2021, 133: 103449. doi: 10.1016/j.trc.2021.103449
|