混合阻塞策略下的铁路货运服务网络设计:制定与解决方法

IF 2.7 Q3 TRANSPORTATION
Xiaoyu Xin , Xu Wu , Jiaxi Wang
{"title":"混合阻塞策略下的铁路货运服务网络设计:制定与解决方法","authors":"Xiaoyu Xin ,&nbsp;Xu Wu ,&nbsp;Jiaxi Wang","doi":"10.1016/j.jrtpm.2024.100495","DOIUrl":null,"url":null,"abstract":"<div><div>In the current China railway system, the freight transportation service network is demand category oriented and is designed by using a hierarchical approach. This simplifies the design procedure, but reduces the flexibility and optimality of the plan. To make full use of the limited railway capacity and to improve the service flexibility and quality, this paper addresses the freight service network design problem with simultaneous consideration of mixed blocking policies and mixed service classes for heterogeneous demands. A mixed integer linear programming model is developed for the problem to maximize the operator's total transportation profit. Furthermore, a two-stage decomposition framework is proposed to solve the optimization model, where both exact and heuristic algorithms are employed. Extensive computational experiments on artificial and real-world instances indicate that the proposed solution approaches can generate high-quality solutions within reasonable time frame. Moreover, the mixed blocking policies could attract more freight demands and tend to result in higher profits, compared to the single blocking policy.</div></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"33 ","pages":"Article 100495"},"PeriodicalIF":2.7000,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rail freight transportation service network design with mixed blocking policies: Formulation and solution methods\",\"authors\":\"Xiaoyu Xin ,&nbsp;Xu Wu ,&nbsp;Jiaxi Wang\",\"doi\":\"10.1016/j.jrtpm.2024.100495\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In the current China railway system, the freight transportation service network is demand category oriented and is designed by using a hierarchical approach. This simplifies the design procedure, but reduces the flexibility and optimality of the plan. To make full use of the limited railway capacity and to improve the service flexibility and quality, this paper addresses the freight service network design problem with simultaneous consideration of mixed blocking policies and mixed service classes for heterogeneous demands. A mixed integer linear programming model is developed for the problem to maximize the operator's total transportation profit. Furthermore, a two-stage decomposition framework is proposed to solve the optimization model, where both exact and heuristic algorithms are employed. Extensive computational experiments on artificial and real-world instances indicate that the proposed solution approaches can generate high-quality solutions within reasonable time frame. Moreover, the mixed blocking policies could attract more freight demands and tend to result in higher profits, compared to the single blocking policy.</div></div>\",\"PeriodicalId\":51821,\"journal\":{\"name\":\"Journal of Rail Transport Planning & Management\",\"volume\":\"33 \",\"pages\":\"Article 100495\"},\"PeriodicalIF\":2.7000,\"publicationDate\":\"2024-12-13\",\"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/S2210970624000659\",\"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/S2210970624000659","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

摘要

在目前的中国铁路系统中,货物运输服务网络是以需求类别为导向,采用分层方法设计的。这简化了设计过程,但降低了规划的灵活性和最优性。为了充分利用有限的铁路运力,提高服务的灵活性和质量,本文研究了针对异构需求同时考虑混合阻塞策略和混合服务等级的货运服务网络设计问题。建立了以运输商总利润最大化为目标的混合整数线性规划模型。在此基础上,提出了一种采用精确算法和启发式算法求解优化模型的两阶段分解框架。大量的人工和现实实例计算实验表明,所提出的求解方法可以在合理的时间框架内生成高质量的解。此外,与单一封锁政策相比,混合封锁政策可以吸引更多的货运需求,往往会产生更高的利润。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Rail freight transportation service network design with mixed blocking policies: Formulation and solution methods
In the current China railway system, the freight transportation service network is demand category oriented and is designed by using a hierarchical approach. This simplifies the design procedure, but reduces the flexibility and optimality of the plan. To make full use of the limited railway capacity and to improve the service flexibility and quality, this paper addresses the freight service network design problem with simultaneous consideration of mixed blocking policies and mixed service classes for heterogeneous demands. A mixed integer linear programming model is developed for the problem to maximize the operator's total transportation profit. Furthermore, a two-stage decomposition framework is proposed to solve the optimization model, where both exact and heuristic algorithms are employed. Extensive computational experiments on artificial and real-world instances indicate that the proposed solution approaches can generate high-quality solutions within reasonable time frame. Moreover, the mixed blocking policies could attract more freight demands and tend to result in higher profits, compared to the single blocking policy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:604180095
Book学术官方微信