DSpace logo

Please use this identifier to cite or link to this item: http://142.54.178.187:9060/xmlui/handle/123456789/1277
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKhan, Muhammad Babar-
dc.contributor.authorZhou, Xuesong-
dc.date.accessioned2019-11-14T06:57:50Z-
dc.date.available2019-11-14T06:57:50Z-
dc.date.issued2010-03-01-
dc.identifier.issn1558-0016-
dc.identifier.urihttp://142.54.178.187:9060/xmlui/handle/123456789/1277-
dc.description.abstractBy considering various stochastic disturbances unfolding in a real-time dispatching environment, this paper develops a stochastic optimization formulation for incorporating segment travel-time uncertainty and dispatching policies into a medium-term train-timetabling process that aims to minimize the total trip time in a published timetable and reduce the expected schedule delay. Based on a heuristic sequential solution framework, this study decomposes the robust timetabling problem into a series of subproblems that optimize the slack-time allocation for individual trains. A number of illustrative examples are provided to demonstrate the proposed model and solution algorithms using data collected from a Beijing-Shanghai high-speed rail corridor in China.en_US
dc.language.isoen_USen_US
dc.publisherIEEE Transactions on Intelligent Transportation Systemsen_US
dc.subjectEngineering and Technologyen_US
dc.subjectIntelligent transportation systemsen_US
dc.subjectRail transportationen_US
dc.subjectScheduling algorithmen_US
dc.subjectStochastic processesen_US
dc.subjectRobustnessen_US
dc.subjectDelay effectsen_US
dc.subjectDispatchingen_US
dc.subjectJob shop schedulingen_US
dc.subjectDelay estimationen_US
dc.subjectPropagation delayen_US
dc.titleStochastic Optimization Model and Solution Algorithm for Robust Double-Track Train-Timetabling Problemen_US
dc.typeArticleen_US
Appears in Collections:Proceedings

Files in This Item:
File Description SizeFormat 
5262983.htm115 BHTMLView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.