A Bi-objective model and a branch-and-price-and-cut solution method for the railroad blocking problem in hazardous material transportation

IF 2.6 Q3 TRANSPORTATION
{"title":"A Bi-objective model and a branch-and-price-and-cut solution method for the railroad blocking problem in hazardous material transportation","authors":"","doi":"10.1016/j.jrtpm.2024.100486","DOIUrl":null,"url":null,"abstract":"<div><div>One of the most important railway transportation problems is the railroad blocking problem (RBP). To our knowledge, no works consider the costs and risks of hazmat transportation in the RBP literature. In this paper, a bi-objective mathematical model is proposed for the RBP considering the risk of hazmat transportation and operating costs. The objective functions are (1) minimizing the cost of delivering commodities while observing limits on the number and aggregate volume of the blocks assembled at each terminal in freight railroads, and (2) minimizing the risk of hazmat transportation in terminals and en route. The ε-constraint method and a presented branch-and-price-and-cut (B&amp;P&amp;C) algorithm are used to solve the proposed bi-objective model. To evaluate the model and the solution method, seventeen experimental instances based on real-world conditions are generated and solved. Modeling and solving the experimental instances and the case study revealed the proposed model's capability and the solution method's efficiency. In addition, as a case study, the proposed model and algorithm are implemented in the Iranian railway network.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":null,"pages":null},"PeriodicalIF":2.6000,"publicationDate":"2024-10-29","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/S2210970624000568","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

Abstract

One of the most important railway transportation problems is the railroad blocking problem (RBP). To our knowledge, no works consider the costs and risks of hazmat transportation in the RBP literature. In this paper, a bi-objective mathematical model is proposed for the RBP considering the risk of hazmat transportation and operating costs. The objective functions are (1) minimizing the cost of delivering commodities while observing limits on the number and aggregate volume of the blocks assembled at each terminal in freight railroads, and (2) minimizing the risk of hazmat transportation in terminals and en route. The ε-constraint method and a presented branch-and-price-and-cut (B&P&C) algorithm are used to solve the proposed bi-objective model. To evaluate the model and the solution method, seventeen experimental instances based on real-world conditions are generated and solved. Modeling and solving the experimental instances and the case study revealed the proposed model's capability and the solution method's efficiency. In addition, as a case study, the proposed model and algorithm are implemented in the Iranian railway network.
危险品运输中铁路阻塞问题的双目标模型和分支-价格-切割求解方法
最重要的铁路运输问题之一是铁路阻塞问题(RBP)。据我们所知,在 RBP 文献中还没有考虑危险品运输成本和风险的著作。本文提出了一个考虑危险品运输风险和运营成本的 RBP 双目标数学模型。目标函数为:(1) 在遵守货运铁路各终点站集装区块的数量和总体积限制的同时,最大限度地降低商品交付成本;(2) 最大限度地降低终点站和运输途中的危险品运输风险。本文采用ε约束法和分支-价格-切割(B&P&C)算法来求解所提出的双目标模型。为了评估该模型和求解方法,生成并求解了 17 个基于真实世界条件的实验实例。实验实例的建模和求解以及案例研究揭示了所提模型的能力和求解方法的效率。此外,作为案例研究,还在伊朗铁路网络中实施了所提出的模型和算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
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学术官方微信