{"title":"A Reinforcement Learning Approach to Train Timetabling for Inter-City High Speed Railway Lines","authors":"Yiwei Guo","doi":"10.1109/ICITE50838.2020.9231418","DOIUrl":null,"url":null,"abstract":"This paper describes a reinforcement learning (RL) approach to train timetabling, which takes into account the characteristics of inter-city high speed railway lines in China. A potential advantage of the proposed approach over well-established mathematical programming approaches lies in that it does not rely heavily on domain expertise to define the various timetabling rules and strategies. Specifically, a discrete time Markov Decision Process (MDP) is established to model the studied problem, and a well-designed RL method is proposed to solve the problem, assuming that the fundamental information about the studied lines (minimum running times, headways, stopping patterns, etc.) is known. Four inter-city high speed railway lines that operate on the Beijing-Tianjin corridor are employed as a case study to test the performance of the proposed approach. The obtained results preliminarily demonstrate the effectiveness and applicability of the proposed approach.","PeriodicalId":112371,"journal":{"name":"2020 IEEE 5th International Conference on Intelligent Transportation Engineering (ICITE)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 5th International Conference on Intelligent Transportation Engineering (ICITE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITE50838.2020.9231418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
This paper describes a reinforcement learning (RL) approach to train timetabling, which takes into account the characteristics of inter-city high speed railway lines in China. A potential advantage of the proposed approach over well-established mathematical programming approaches lies in that it does not rely heavily on domain expertise to define the various timetabling rules and strategies. Specifically, a discrete time Markov Decision Process (MDP) is established to model the studied problem, and a well-designed RL method is proposed to solve the problem, assuming that the fundamental information about the studied lines (minimum running times, headways, stopping patterns, etc.) is known. Four inter-city high speed railway lines that operate on the Beijing-Tianjin corridor are employed as a case study to test the performance of the proposed approach. The obtained results preliminarily demonstrate the effectiveness and applicability of the proposed approach.