基于政策搜索的印度铁路线实时调度优化

Rohit Prasad, H. Khadilkar, Shivaram Kalyanakrishnan
{"title":"基于政策搜索的印度铁路线实时调度优化","authors":"Rohit Prasad, H. Khadilkar, Shivaram Kalyanakrishnan","doi":"10.1109/ICC54714.2021.9703176","DOIUrl":null,"url":null,"abstract":"The Indian railway network carries the largest number of passengers in the world, with over 8.4 billion transported in 2018, in addition to 1.2 billion tonnes of freight [1]. Nonetheless, the network has only about a tenth the “track-length per passenger” of the U.S., and half that of China [2]. This severe limitation of infrastructure, coupled with variability and heterogeneity in operations, raises significant challenges in scheduling. In this paper, we describe a policy search approach to decide arrival/departure times and track allocations for trains such that the resource and operating constraints of the railway line are satisfied, while the priority-weighted departure delay (PWDD) is minimised. We evaluate our approach on three large railway lines from the Indian network. We observe significant reductions of PWDD over traditional heuristics and a solution based on reinforcement learning.","PeriodicalId":382373,"journal":{"name":"2021 Seventh Indian Control Conference (ICC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimising a Real-Time Scheduler for Indian Railway Lines by Policy Search\",\"authors\":\"Rohit Prasad, H. Khadilkar, Shivaram Kalyanakrishnan\",\"doi\":\"10.1109/ICC54714.2021.9703176\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Indian railway network carries the largest number of passengers in the world, with over 8.4 billion transported in 2018, in addition to 1.2 billion tonnes of freight [1]. Nonetheless, the network has only about a tenth the “track-length per passenger” of the U.S., and half that of China [2]. This severe limitation of infrastructure, coupled with variability and heterogeneity in operations, raises significant challenges in scheduling. In this paper, we describe a policy search approach to decide arrival/departure times and track allocations for trains such that the resource and operating constraints of the railway line are satisfied, while the priority-weighted departure delay (PWDD) is minimised. We evaluate our approach on three large railway lines from the Indian network. We observe significant reductions of PWDD over traditional heuristics and a solution based on reinforcement learning.\",\"PeriodicalId\":382373,\"journal\":{\"name\":\"2021 Seventh Indian Control Conference (ICC)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 Seventh Indian Control Conference (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC54714.2021.9703176\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Seventh Indian Control Conference (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC54714.2021.9703176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

印度铁路网承载着世界上最多的乘客,2018年运送了超过84亿人次,此外还有12亿吨货物[1]。尽管如此,该网络的“每位乘客的轨道长度”仅为美国的十分之一,是中国的一半[2]。这种基础设施的严重限制,加上操作中的可变性和异质性,给调度带来了重大挑战。在本文中,我们描述了一种策略搜索方法来决定列车到达/出发时间和轨道分配,使铁路线的资源和运营约束得到满足,同时使优先加权发车延迟(PWDD)最小化。我们在印度网络中的三条大型铁路线上评估了我们的方法。我们观察到,与传统的启发式方法和基于强化学习的解决方案相比,PWDD显著减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimising a Real-Time Scheduler for Indian Railway Lines by Policy Search
The Indian railway network carries the largest number of passengers in the world, with over 8.4 billion transported in 2018, in addition to 1.2 billion tonnes of freight [1]. Nonetheless, the network has only about a tenth the “track-length per passenger” of the U.S., and half that of China [2]. This severe limitation of infrastructure, coupled with variability and heterogeneity in operations, raises significant challenges in scheduling. In this paper, we describe a policy search approach to decide arrival/departure times and track allocations for trains such that the resource and operating constraints of the railway line are satisfied, while the priority-weighted departure delay (PWDD) is minimised. We evaluate our approach on three large railway lines from the Indian network. We observe significant reductions of PWDD over traditional heuristics and a solution based on reinforcement learning.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信