Optimising railcar transfer chain via fuzzy programming and a simulated annealing algorithm

IF 4 3区 工程技术 Q2 ENGINEERING, INDUSTRIAL
Boliang Lin, Zhenyu Wang
{"title":"Optimising railcar transfer chain via fuzzy programming and a simulated annealing algorithm","authors":"Boliang Lin, Zhenyu Wang","doi":"10.1080/23302674.2023.2269076","DOIUrl":null,"url":null,"abstract":"AbstractWith the accelerated changes of trade and economic structure, the fluctuation of shipment size is increasing in railway transportation. Railway companies are facing continuous challenges about how to optimise railcar transfer chain to achieve the balance between the workload of railway network and daily changing transportation demands. In this paper, elastic capacity constraints are designed to solve the number fluctuation of railcars in shipments. We define available capacity belts to describe the elastic capacities of railway network, then fuzzy theory is introduced. A membership function is designed to designate the satisfaction degree for the number of railcars, and a non-linear integer programming model is developed. We test the model with two numerical examples from the 2019 Railway Applications Section Problem Solving Competition, and a simulated annealing algorithm is employed to solve the problem. In the experiment with 16 yards, the model generated 1304 variables. Furthermore, as the scale of the railway network increases, the number of variables exhibited exponential explosive growth. In the experiment with 32 yards, the model generated 76,037 variables and determined 365 direct train services, resulting in an operating cost of 245,014,388 car-hours. The results of the experiments effectively verify the effectiveness of the model.KEYWORDS: Freight railway networkrailcar transfer chainfuzzy theorysimulated annealing algorithm Data availability statementThe authors confirm that the data supporting the findings of this study are available within the article and its supplementary materials.AcknowledgementsThe research was supported by the National Natural Science Foundation of China (U2268207).Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingThis work was supported by the National Natural Science Foundation of China [grant number U2268207].Notes on contributorsBoliang LinBoliang Lin received the Ph.D. degree in transportation management engineering from Southwest Jiaotong University, Chengdu, China, in 1994. From 1995 to 1997, he was a Post-doctoral Researcher with Beijing Jiaotong University. From 1997 to 2000. He was an Associate Professor with Beijing Jiaotong University. Since 2000, he has been a Professor with the Department of Transportation Management Engineering, Beijing Jiaotong University. His research interests include railway operation management, transportation systems network design, network flow techniques, transportation and logistics, and intelligent transportation system.Zhenyu WangZhenyu Wang received the B.S. degree in transportation engineering from Lanzhou Jiaotong University, Gansu, China, in 2019. He is currently pursuing the Ph.D. degree with the Department of Transportation Management Engineering, Beijing Jiaotong University, China. His research interests include transportation optimization and intelligent transportation system.","PeriodicalId":46346,"journal":{"name":"International Journal of Systems Science-Operations & Logistics","volume":"30 1","pages":"0"},"PeriodicalIF":4.0000,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Systems Science-Operations & Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23302674.2023.2269076","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}
引用次数: 0

Abstract

AbstractWith the accelerated changes of trade and economic structure, the fluctuation of shipment size is increasing in railway transportation. Railway companies are facing continuous challenges about how to optimise railcar transfer chain to achieve the balance between the workload of railway network and daily changing transportation demands. In this paper, elastic capacity constraints are designed to solve the number fluctuation of railcars in shipments. We define available capacity belts to describe the elastic capacities of railway network, then fuzzy theory is introduced. A membership function is designed to designate the satisfaction degree for the number of railcars, and a non-linear integer programming model is developed. We test the model with two numerical examples from the 2019 Railway Applications Section Problem Solving Competition, and a simulated annealing algorithm is employed to solve the problem. In the experiment with 16 yards, the model generated 1304 variables. Furthermore, as the scale of the railway network increases, the number of variables exhibited exponential explosive growth. In the experiment with 32 yards, the model generated 76,037 variables and determined 365 direct train services, resulting in an operating cost of 245,014,388 car-hours. The results of the experiments effectively verify the effectiveness of the model.KEYWORDS: Freight railway networkrailcar transfer chainfuzzy theorysimulated annealing algorithm Data availability statementThe authors confirm that the data supporting the findings of this study are available within the article and its supplementary materials.AcknowledgementsThe research was supported by the National Natural Science Foundation of China (U2268207).Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingThis work was supported by the National Natural Science Foundation of China [grant number U2268207].Notes on contributorsBoliang LinBoliang Lin received the Ph.D. degree in transportation management engineering from Southwest Jiaotong University, Chengdu, China, in 1994. From 1995 to 1997, he was a Post-doctoral Researcher with Beijing Jiaotong University. From 1997 to 2000. He was an Associate Professor with Beijing Jiaotong University. Since 2000, he has been a Professor with the Department of Transportation Management Engineering, Beijing Jiaotong University. His research interests include railway operation management, transportation systems network design, network flow techniques, transportation and logistics, and intelligent transportation system.Zhenyu WangZhenyu Wang received the B.S. degree in transportation engineering from Lanzhou Jiaotong University, Gansu, China, in 2019. He is currently pursuing the Ph.D. degree with the Department of Transportation Management Engineering, Beijing Jiaotong University, China. His research interests include transportation optimization and intelligent transportation system.
基于模糊规划和模拟退火算法的轨道车辆转移链优化
摘要随着贸易和经济结构的加速变化,铁路运输中货运量的波动也越来越大。如何优化轨道车辆换乘链,实现铁路网络工作量与日常变化的运输需求之间的平衡,是铁路企业不断面临的挑战。本文设计了弹性容量约束来解决铁路运输车辆数量波动问题。首先定义可用容量带来描述路网的弹性容量,然后引入模糊理论。设计了隶属函数来表示轨道车辆数量的满足程度,并建立了非线性整数规划模型。我们用2019年铁路应用部门问题解决竞赛中的两个数值例子对模型进行了测试,并采用模拟退火算法对问题进行求解。在16码的实验中,模型产生了1304个变量。此外,随着铁路网络规模的扩大,变量数量呈指数爆炸式增长。在32码的实验中,该模型产生了76037个变量,确定了365个直达列车班次,运行成本为245,014,388车时。实验结果有效地验证了该模型的有效性。关键词:货运铁路网络轨道车辆换乘链模糊理论模拟退火算法数据可得性声明作者确认本文及其补充材料中有支持本研究结果的数据。本研究得到国家自然科学基金(U2268207)资助。披露声明作者未报告潜在的利益冲突。本研究受国家自然科学基金资助[批准号:U2268207]。林伯良,1994年毕业于中国成都西南交通大学交通管理工程专业,获博士学位。1995年至1997年,任北京交通大学博士后研究员。1997年到2000年。曾任北京交通大学副教授。2000年起任北京交通大学交通管理工程系教授。主要研究方向为铁路运营管理、交通运输系统网络设计、网络流技术、交通运输与物流、智能交通系统。王振宇,2019年毕业于中国甘肃兰州交通大学交通运输工程专业,获学士学位。他目前在北京交通大学交通管理工程系攻读博士学位。主要研究方向为交通优化与智能交通系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.60
自引率
16.70%
发文量
32
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信