矿产品运输网络中车队规模的优化和货车的优化配置:以伊朗铁路系统为例

IF 2.6 Q3 TRANSPORTATION
Amin Zakhirehkar Sahih , Saeed Shahmiri , Mohammadreza Momtazi , Mahdi Zohreh
{"title":"矿产品运输网络中车队规模的优化和货车的优化配置:以伊朗铁路系统为例","authors":"Amin Zakhirehkar Sahih ,&nbsp;Saeed Shahmiri ,&nbsp;Mohammadreza Momtazi ,&nbsp;Mahdi Zohreh","doi":"10.1016/j.jrtpm.2023.100414","DOIUrl":null,"url":null,"abstract":"<div><p><span>Rail wagon planning is an important type of planning in the rail transport network since its costs are high. Therefore, enhancing the accuracy of fleet planning could result in cost efficiency. In this research, we aim to model and optimize the fleet size and allocation problem in a rail transportation network. We proposed a novel two-step algorithm composed of two meta-heuristic steps to optimize the allocation of the fleet between origins and destinations and to determine the optimal number of wagons. Besides, we provided a case study of Iran’s minerals rail transport network. The results demonstrate that 4925 wagons are required to transport approximately 17.7 million tons of minerals per year, roughly 10% less than the current proportion. The validity of the results was also analyzed by using a comparison between our algorithm and CEPLEX for a </span>test dataset. It is shown that our approach outperforms CEPLEX in terms of speed while retaining the same performance.</p></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"28 ","pages":"Article 100414"},"PeriodicalIF":2.6000,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimization of fleet size and determining the optimal allocation of wagons in minerals transport network: A case study of Iran’s railway system\",\"authors\":\"Amin Zakhirehkar Sahih ,&nbsp;Saeed Shahmiri ,&nbsp;Mohammadreza Momtazi ,&nbsp;Mahdi Zohreh\",\"doi\":\"10.1016/j.jrtpm.2023.100414\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>Rail wagon planning is an important type of planning in the rail transport network since its costs are high. Therefore, enhancing the accuracy of fleet planning could result in cost efficiency. In this research, we aim to model and optimize the fleet size and allocation problem in a rail transportation network. We proposed a novel two-step algorithm composed of two meta-heuristic steps to optimize the allocation of the fleet between origins and destinations and to determine the optimal number of wagons. Besides, we provided a case study of Iran’s minerals rail transport network. The results demonstrate that 4925 wagons are required to transport approximately 17.7 million tons of minerals per year, roughly 10% less than the current proportion. The validity of the results was also analyzed by using a comparison between our algorithm and CEPLEX for a </span>test dataset. It is shown that our approach outperforms CEPLEX in terms of speed while retaining the same performance.</p></div>\",\"PeriodicalId\":51821,\"journal\":{\"name\":\"Journal of Rail Transport Planning & Management\",\"volume\":\"28 \",\"pages\":\"Article 100414\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2023-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Rail Transport Planning & Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S221097062300046X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"TRANSPORTATION\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Rail Transport Planning & Management","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S221097062300046X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

摘要

铁路货车规划是铁路运输网络中的一种重要规划类型,因为其成本很高。因此,提高车队规划的准确性可以提高成本效益。在本研究中,我们旨在对铁路运输网络中的车队规模和分配问题进行建模和优化。我们提出了一种由两个元启发式步骤组成的新的两步算法,以优化车队在始发地和目的地之间的分配,并确定最佳货车数量。此外,我们还提供了伊朗矿产铁路运输网络的案例研究。结果表明,每年需要4925辆货车运输约1770万吨矿产,比目前的比例减少了约10%。通过将我们的算法与测试数据集的CEPLEX进行比较,还分析了结果的有效性。结果表明,我们的方法在保持相同性能的同时,在速度方面优于CEPLEX。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimization of fleet size and determining the optimal allocation of wagons in minerals transport network: A case study of Iran’s railway system

Rail wagon planning is an important type of planning in the rail transport network since its costs are high. Therefore, enhancing the accuracy of fleet planning could result in cost efficiency. In this research, we aim to model and optimize the fleet size and allocation problem in a rail transportation network. We proposed a novel two-step algorithm composed of two meta-heuristic steps to optimize the allocation of the fleet between origins and destinations and to determine the optimal number of wagons. Besides, we provided a case study of Iran’s minerals rail transport network. The results demonstrate that 4925 wagons are required to transport approximately 17.7 million tons of minerals per year, roughly 10% less than the current proportion. The validity of the results was also analyzed by using a comparison between our algorithm and CEPLEX for a test dataset. It is shown that our approach outperforms CEPLEX in terms of speed while retaining the same performance.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.10
自引率
8.10%
发文量
41
×
引用
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学术官方微信