客运铁路网络能量优化时刻表的数据驱动双目标数学

IF 2.6 Q3 TRANSPORTATION
Matthias Villads Hinsch Als, Mathias Bejlegaard Madsen, Rune Møller Jensen
{"title":"客运铁路网络能量优化时刻表的数据驱动双目标数学","authors":"Matthias Villads Hinsch Als,&nbsp;Mathias Bejlegaard Madsen,&nbsp;Rune Møller Jensen","doi":"10.1016/j.jrtpm.2023.100374","DOIUrl":null,"url":null,"abstract":"<div><p>Energy-efficient train timetabling (EETT) is essential to achieve the full potential of energy-efficient train control, which can reduce operating costs and contribute to a reduction in CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span> emissions. This article proposes a bi-objective matheuristic to address the EETT problem for a railway network. To our knowledge, this article is the first to suggest using historical data from train operation to model the actual energy consumption, reflecting the different driving behaviours. The matheuristic employs a genetic algorithm (GA) based on NSGA-II. The GA uses a warm-start method to generate the initial population based on a mixed-integer program. A greedy first-come-first-served fail-fast repair heuristic is used to ensure feasibility throughout the evolution of the population. The objectives taken into account are energy consumption and passenger travel time. The matheuristic was applied to a real-world case from a large North European train operating company. The considered network consists of 107 stations and junctions, and 18 periodic timetables for 9 train lines. Our results show that for an entire network, a reduction up to 3.3% in energy consumption and 4.64% in passenger travel time can be achieved. The results are computed in less than a minute, making the approach suitable for integration with a decision support tool.</p></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"26 ","pages":"Article 100374"},"PeriodicalIF":2.6000,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A data-driven bi-objective matheuristic for energy-optimising timetables in a passenger railway network\",\"authors\":\"Matthias Villads Hinsch Als,&nbsp;Mathias Bejlegaard Madsen,&nbsp;Rune Møller Jensen\",\"doi\":\"10.1016/j.jrtpm.2023.100374\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Energy-efficient train timetabling (EETT) is essential to achieve the full potential of energy-efficient train control, which can reduce operating costs and contribute to a reduction in CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span> emissions. This article proposes a bi-objective matheuristic to address the EETT problem for a railway network. To our knowledge, this article is the first to suggest using historical data from train operation to model the actual energy consumption, reflecting the different driving behaviours. The matheuristic employs a genetic algorithm (GA) based on NSGA-II. The GA uses a warm-start method to generate the initial population based on a mixed-integer program. A greedy first-come-first-served fail-fast repair heuristic is used to ensure feasibility throughout the evolution of the population. The objectives taken into account are energy consumption and passenger travel time. The matheuristic was applied to a real-world case from a large North European train operating company. The considered network consists of 107 stations and junctions, and 18 periodic timetables for 9 train lines. Our results show that for an entire network, a reduction up to 3.3% in energy consumption and 4.64% in passenger travel time can be achieved. The results are computed in less than a minute, making the approach suitable for integration with a decision support tool.</p></div>\",\"PeriodicalId\":51821,\"journal\":{\"name\":\"Journal of Rail Transport Planning & Management\",\"volume\":\"26 \",\"pages\":\"Article 100374\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2023-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Rail Transport Planning & Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210970623000069\",\"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/S2210970623000069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 1

摘要

高效节能列车时间表(EETT)对于实现高效节能列车控制的全部潜力至关重要,这可以降低运营成本并有助于减少二氧化碳排放。本文提出了一种双目标数学方法来解决铁路网的EETT问题。据我们所知,本文首次建议使用列车运行的历史数据来模拟实际能耗,反映不同的驾驶行为。数学模型采用了基于NSGA-II的遗传算法。遗传算法使用热启动方法来生成基于混合整数程序的初始种群。贪婪的先到先得故障快速修复启发式算法用于确保整个种群进化的可行性。考虑的目标是能源消耗和乘客出行时间。该数学模型应用于一家大型北欧列车运营公司的真实案例。所考虑的网络包括107个车站和交叉口,以及9条列车线路的18个定期时间表。我们的结果表明,对于整个网络,可以实现高达3.3%的能源消耗和4.64%的乘客出行时间的减少。结果在不到一分钟的时间内计算出来,使该方法适合与决策支持工具集成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A data-driven bi-objective matheuristic for energy-optimising timetables in a passenger railway network

Energy-efficient train timetabling (EETT) is essential to achieve the full potential of energy-efficient train control, which can reduce operating costs and contribute to a reduction in CO2 emissions. This article proposes a bi-objective matheuristic to address the EETT problem for a railway network. To our knowledge, this article is the first to suggest using historical data from train operation to model the actual energy consumption, reflecting the different driving behaviours. The matheuristic employs a genetic algorithm (GA) based on NSGA-II. The GA uses a warm-start method to generate the initial population based on a mixed-integer program. A greedy first-come-first-served fail-fast repair heuristic is used to ensure feasibility throughout the evolution of the population. The objectives taken into account are energy consumption and passenger travel time. The matheuristic was applied to a real-world case from a large North European train operating company. The considered network consists of 107 stations and junctions, and 18 periodic timetables for 9 train lines. Our results show that for an entire network, a reduction up to 3.3% in energy consumption and 4.64% in passenger travel time can be achieved. The results are computed in less than a minute, making the approach suitable for integration with a decision support tool.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信