Research on Train Formation Plan Optimization in Railway Network Based on Branch-and-Price Algorithm

Wei Xiao, Y. Yue, Feng Chen
{"title":"Research on Train Formation Plan Optimization in Railway Network Based on Branch-and-Price Algorithm","authors":"Wei Xiao, Y. Yue, Feng Chen","doi":"10.1109/BESC48373.2019.8963192","DOIUrl":null,"url":null,"abstract":"Freight train formation plan is the basic technical document of railway freight transport organization, it decides the efficiency of railway freight transport. In this paper, we introduce the train formation plan optimization problem in railway network. Then we propose the 0–1 integrated optimization model with the object function to minimize the sum of accumulation time, running time and transit time. According to the characteristics of the model, an improved solution algorithm is designed based on the Branch-and-Price algorithm. The algorithm is programmed in C# language to solve the model. Finally, the computation results on a case study of simplified China's railway network with 14 large marshalling stations demonstrate the effectiveness and feasibility of the proposed optimization method, which shows the application on the actual railway engineering industry.","PeriodicalId":190867,"journal":{"name":"2019 6th International Conference on Behavioral, Economic and Socio-Cultural Computing (BESC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 6th International Conference on Behavioral, Economic and Socio-Cultural Computing (BESC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BESC48373.2019.8963192","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Freight train formation plan is the basic technical document of railway freight transport organization, it decides the efficiency of railway freight transport. In this paper, we introduce the train formation plan optimization problem in railway network. Then we propose the 0–1 integrated optimization model with the object function to minimize the sum of accumulation time, running time and transit time. According to the characteristics of the model, an improved solution algorithm is designed based on the Branch-and-Price algorithm. The algorithm is programmed in C# language to solve the model. Finally, the computation results on a case study of simplified China's railway network with 14 large marshalling stations demonstrate the effectiveness and feasibility of the proposed optimization method, which shows the application on the actual railway engineering industry.
基于支路价格算法的铁路网列车编组计划优化研究
货运列车编组计划是铁路货运组织的基本技术文件,它决定着铁路货运的效率。本文介绍了铁路网中列车编组计划优化问题。在此基础上,提出了以积累时间、运行时间和运输时间之和最小为目标函数的0-1综合优化模型。根据模型的特点,在Branch-and-Price算法的基础上设计了一种改进的求解算法。用c#语言编写算法求解模型。最后,以包含14个大型编组站的简化中国铁路网为例,验证了所提优化方法的有效性和可行性,并在实际铁路工程行业中得到了应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信