Efficient Scheduling of Traffic on a Railway Line
Author
Abstract
Suggested Citation
DOI: 10.1023/A:1021255214371
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Kraft, Edwin R., 1987. "A Branch and Bound Procedure for Optimal Train Dispatching," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 28(1).
- Richard L. Sauder & William M. Westerman, 1983. "Computer Aided Train Dispatching: Decision Support Through Optimization," Interfaces, INFORMS, vol. 13(6), pages 24-37, December.
- Susan Fraley Hallowell & Patrick T. Harker, 1996. "Predicting On-Time Line-Haul Performance in Scheduled Railroad Operations," Transportation Science, INFORMS, vol. 30(4), pages 364-378, November.
- Jean-François Cordeau & Paolo Toth & Daniele Vigo, 1998. "A Survey of Optimization Models for Train Routing and Scheduling," Transportation Science, INFORMS, vol. 32(4), pages 380-404, November.
- Dejan Jovanović & Patrick T. Harker, 1991. "Tactical Scheduling of Rail Operations: The SCAN I System," Transportation Science, INFORMS, vol. 25(1), pages 46-64, February.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Wenliang Zhou & Junli Tian & Jin Qin & Lianbo Deng & TangJian Wei, 2015. "Optimization of Multiperiod Mixed Train Schedule on High-Speed Railway," Discrete Dynamics in Nature and Society, Hindawi, vol. 2015, pages 1-14, April.
- Ye, Hongbo & Liu, Ronghui, 2016. "A multiphase optimal control method for multi-train control and scheduling on railway lines," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 377-393.
- Li, Feng & Gao, Ziyou & Li, Keping & Yang, Lixing, 2008. "Efficient scheduling of railway traffic based on global information of train," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 1008-1030, December.
- Mu, Shi & Dessouky, Maged, 2013. "Efficient dispatching rules on double tracks with heterogeneous train traffic," Transportation Research Part B: Methodological, Elsevier, vol. 51(C), pages 45-64.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Li, Feng & Gao, Ziyou & Li, Keping & Yang, Lixing, 2008. "Efficient scheduling of railway traffic based on global information of train," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 1008-1030, December.
- Julia Lange & Frank Werner, 2018. "Approaches to modeling train scheduling problems as job-shop problems with blocking constraints," Journal of Scheduling, Springer, vol. 21(2), pages 191-207, April.
- Talebian, Ahmadreza & Zou, Bo, 2015. "Integrated modeling of high performance passenger and freight train planning on shared-use corridors in the US," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 114-140.
- Ghoseiri, Keivan & Szidarovszky, Ferenc & Asgharpour, Mohammad Jawad, 2004. "A multi-objective train scheduling model and solution," Transportation Research Part B: Methodological, Elsevier, vol. 38(10), pages 927-952, December.
- Hallowell, Susan F. & Harker, Patrick T., 1998. "Predicting on-time performance in scheduled railroad operations: methodology and application to train scheduling," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(4), pages 279-295, May.
- Li, Feng & Sheu, Jiuh-Biing & Gao, Zi-You, 2014. "Deadlock analysis, prevention and train optimal travel mechanism in single-track railway system," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 385-414.
- Dorfman, M. J. & Medanic, J., 2004. "Scheduling trains on a railway network using a discrete event model of railway traffic," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 81-98, January.
- D'Ariano, Andrea & Pacciarelli, Dario & Pranzo, Marco, 2007. "A branch and bound algorithm for scheduling trains in a railway network," European Journal of Operational Research, Elsevier, vol. 183(2), pages 643-657, December.
- Michael Schachtebeck & Anita Schöbel, 2010. "To Wait or Not to Wait---And Who Goes First? Delay Management with Priority Decisions," Transportation Science, INFORMS, vol. 44(3), pages 307-321, August.
- Yu-Jun Zheng, 2018. "Emergency Train Scheduling on Chinese High-Speed Railways," Transportation Science, INFORMS, vol. 52(5), pages 1077-1091, October.
- Carey, Malachy & Crawford, Ivan, 2007. "Scheduling trains on a network of busy complex stations," Transportation Research Part B: Methodological, Elsevier, vol. 41(2), pages 159-178, February.
- Martin-Iradi, Bernardo & Ropke, Stefan, 2022. "A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing," European Journal of Operational Research, Elsevier, vol. 297(2), pages 511-531.
- Cacchiani, Valentina & Toth, Paolo, 2012. "Nominal and robust train timetabling problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 727-737.
- Zhou, Xuesong & Zhong, Ming, 2005. "Bicriteria train scheduling for high-speed passenger railroad planning applications," European Journal of Operational Research, Elsevier, vol. 167(3), pages 752-771, December.
- Adenso-Díaz, B. & Oliva González, M. & González-Torre, P., 1999. "On-line timetable re-scheduling in regional train services," Transportation Research Part B: Methodological, Elsevier, vol. 33(6), pages 387-398, August.
- Zhou, Xuesong & Zhong, Ming, 2007. "Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds," Transportation Research Part B: Methodological, Elsevier, vol. 41(3), pages 320-341, March.
- Higgins, A. & Kozan, E. & Ferreira, L., 1996. "Optimal scheduling of trains on a single line track," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 147-161, April.
- Chakroborty, Partha & Vikram, Durgesh, 2008. "Optimum assignment of trains to platforms under partial schedule compliance," Transportation Research Part B: Methodological, Elsevier, vol. 42(2), pages 169-184, February.
- Jean-François Cordeau & Paolo Toth & Daniele Vigo, 1998. "A Survey of Optimization Models for Train Routing and Scheduling," Transportation Science, INFORMS, vol. 32(4), pages 380-404, November.
- Blum, Jeremy & Eskandarian, Azim, 2002. "Enhancing intelligent agent collaboration for flow optimization of railroad traffic," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(10), pages 919-930, December.
More about this item
Keywords
Discrete-event dynamic systems; scheduling; algorithms; train control; optimization;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:115:y:2002:i:3:d:10.1023_a:1021255214371. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.