{"title":"Microscopic resource assignment model and Lagrangian relaxation based algorithm for train operation scheduling in railway station","authors":"Y. Yue, Song Han, Leishan Zhou, H. Rakha","doi":"10.1109/ITSC.2013.6728415","DOIUrl":null,"url":null,"abstract":"The quality of train operation plan in large railway stations is “critical” for the efficiency of the whole railway network. We present a novel optimization approach for operation scheduling problem in railway station. The model is based on microscopic devices of railway infrastructure, such as tracks, switches and crosses. The scheduling decisions are based on discretized resource-time network; we introduce Lagrangian relaxation based heuristic method to compute the maximum total profit of operation plan without any operation conflicts. The approach has been tested on a real world high speed railway case with one hour realistic data. The results investigate the quality of the proposed model and algorithm.","PeriodicalId":275768,"journal":{"name":"16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013)","volume":"516 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2013.6728415","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
The quality of train operation plan in large railway stations is “critical” for the efficiency of the whole railway network. We present a novel optimization approach for operation scheduling problem in railway station. The model is based on microscopic devices of railway infrastructure, such as tracks, switches and crosses. The scheduling decisions are based on discretized resource-time network; we introduce Lagrangian relaxation based heuristic method to compute the maximum total profit of operation plan without any operation conflicts. The approach has been tested on a real world high speed railway case with one hour realistic data. The results investigate the quality of the proposed model and algorithm.