基于枚举的铁路班组弹性调度方法

Yuki Maekawa, T. Minakawa, T. Tomiyama
{"title":"基于枚举的铁路班组弹性调度方法","authors":"Yuki Maekawa, T. Minakawa, T. Tomiyama","doi":"10.1109/ITSC45102.2020.9294205","DOIUrl":null,"url":null,"abstract":"Complicated railway networks and high-density train service in common urban areas have led to difficulties in railway operation after incidents. Supporting crew rescheduling task in disruption management is important for realizing reliable services. In crew rescheduling task, flexible responses are required depending on the situation, but with common methods whose objectives and constraints are given, getting an appropriate crew plan in every case is hard. Therefore, we developed a support function by which railway operators can compare multiple feasible crew plans and select one that meets the current situations. To realize this function, we propose a method of constructing a zero-suppressed binary decision diagram (ZDD) that expresses a set of multiple feasible crew plans. We compared the performance of the proposed function with the conventional way in the case of medium-sized railway line and confirmed that our function is suitable for situations in which interactive comparisons are performed.","PeriodicalId":394538,"journal":{"name":"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Enumeration-Based Approach for Flexible Railway Crew Rescheduling in Disruption Management\",\"authors\":\"Yuki Maekawa, T. Minakawa, T. Tomiyama\",\"doi\":\"10.1109/ITSC45102.2020.9294205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Complicated railway networks and high-density train service in common urban areas have led to difficulties in railway operation after incidents. Supporting crew rescheduling task in disruption management is important for realizing reliable services. In crew rescheduling task, flexible responses are required depending on the situation, but with common methods whose objectives and constraints are given, getting an appropriate crew plan in every case is hard. Therefore, we developed a support function by which railway operators can compare multiple feasible crew plans and select one that meets the current situations. To realize this function, we propose a method of constructing a zero-suppressed binary decision diagram (ZDD) that expresses a set of multiple feasible crew plans. We compared the performance of the proposed function with the conventional way in the case of medium-sized railway line and confirmed that our function is suitable for situations in which interactive comparisons are performed.\",\"PeriodicalId\":394538,\"journal\":{\"name\":\"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITSC45102.2020.9294205\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC45102.2020.9294205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

复杂的铁路网络和城市普通地区高密度的列车服务导致了事故后铁路运营的困难。在中断管理中支持机组重调度任务对实现可靠服务具有重要意义。在机组重调度任务中,需要根据不同的情况做出灵活的响应,但一般方法的目标和约束条件都是给定的,很难在每种情况下都得到合适的机组计划。因此,我们开发了一个支持函数,铁路运营商可以通过比较多个可行的机组计划,并选择一个符合当前情况的方案。为了实现这一功能,我们提出了一种构造零抑制二进制决策图(ZDD)的方法,该决策图表达了一组多个可行的乘员计划。在中型铁路线的情况下,我们将所提出的函数与传统方法的性能进行了比较,并确认我们的函数适用于执行交互式比较的情况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Enumeration-Based Approach for Flexible Railway Crew Rescheduling in Disruption Management
Complicated railway networks and high-density train service in common urban areas have led to difficulties in railway operation after incidents. Supporting crew rescheduling task in disruption management is important for realizing reliable services. In crew rescheduling task, flexible responses are required depending on the situation, but with common methods whose objectives and constraints are given, getting an appropriate crew plan in every case is hard. Therefore, we developed a support function by which railway operators can compare multiple feasible crew plans and select one that meets the current situations. To realize this function, we propose a method of constructing a zero-suppressed binary decision diagram (ZDD) that expresses a set of multiple feasible crew plans. We compared the performance of the proposed function with the conventional way in the case of medium-sized railway line and confirmed that our function is suitable for situations in which interactive comparisons are performed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
CR-TMS: Connected Vehicles enabled Road Traffic Congestion Mitigation System using Virtual Road Capacity Inflation A novel concept for validation of pre-crash perception sensor information using contact sensor Space-time Map based Path Planning Scheme in Large-scale Intelligent Warehouse System Weakly-supervised Road Condition Classification Using Automatically Generated Labels Studying the Impact of Public Transport on Disaster Evacuation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1