{"title":"Optimization Research of Transfer Services Plan Based on Heterogeneous Demand of Railway Passengers","authors":"Jing-jing Zeng, Ranran Yu, Jing Guo, N. Lei","doi":"10.1109/ISDEA.2012.425","DOIUrl":null,"url":null,"abstract":"The current railway routing system can not produce satisfactory trip plans for passengers with different income backgrounds, taking into account their preferences on route choices. Therefore, the effort on developing and implementing a railway routing and scheduling model that provide personalized trip routes is of great significance in improving railway transportation service. The model proposed was based on current train diagram. Its characteristic variables were established through a comprehensive analysis of factors that contribute railway passengers' trip options. Weightings for these variables were determined by passengers' preferences. Utility function for each section on a railway path was constructed on an initial railway network. The optimization problem of routing generation was then converted to shortest path problem solved by a combination of K shortest path algorithm and A-star algorithm. A case analysis in this thesis verified the feasibility and effectiveness of this model.","PeriodicalId":267532,"journal":{"name":"2012 Second International Conference on Intelligent System Design and Engineering Application","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Second International Conference on Intelligent System Design and Engineering Application","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISDEA.2012.425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The current railway routing system can not produce satisfactory trip plans for passengers with different income backgrounds, taking into account their preferences on route choices. Therefore, the effort on developing and implementing a railway routing and scheduling model that provide personalized trip routes is of great significance in improving railway transportation service. The model proposed was based on current train diagram. Its characteristic variables were established through a comprehensive analysis of factors that contribute railway passengers' trip options. Weightings for these variables were determined by passengers' preferences. Utility function for each section on a railway path was constructed on an initial railway network. The optimization problem of routing generation was then converted to shortest path problem solved by a combination of K shortest path algorithm and A-star algorithm. A case analysis in this thesis verified the feasibility and effectiveness of this model.