Abstract
A method is presented for global optimization of a dispatch plan assuming perfect information over a given time horizon. An example problem is solved for the North American case of a single dominant high-speed train sharing a network with a majority flow of slower trains. Initial dispatch priority and speed changes to selected trains consume network capacity; but incremental speed increases of these trains, combined with appropriate dispatch strategies, are beneficial to the network as a whole. Further, specific siding enhancements demonstrate measureable improvements in network flow.
| Original language | English |
|---|---|
| Journal | Transportation Journal |
| Volume | 52 |
| Issue number | 1 |
| Pages (from-to) | 26-51 |
| ISSN | 2157-328X |
| DOIs | |
| Publication status | Published - 2013 |
Keywords
- Transportation
- Integer programming
- Network capacity
- Railways
- Timetabling
- measurement method
- optimization
- planning method
- railway transport
- transportation planning
- transportation system
- North America
- TRANSPORTATION
- OPTIMIZATION
- integer programming
- network capacity
- railways
- HIGH speed trains
Fingerprint
Dive into the research topics of 'A Method for Robust Strategic Railway Dispatch Applied to a Single Track Line'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver