Reasonable scheduling for arrival–departure track operations in railway stations

References

• Arkin, E. M., and E. L. Silverberg. 1987. “Scheduling Jobs with Fixed Start and End Times.” Discrete Applied Mathematics 18 (1): 1–8. doi: 10.1016/0166-218X(87)90037-0
   Web of Science ®Google Scholar
• Carey, M. 1994. “A Model and Strategy for Train Pathing with Choice of Lines, Platforms, and Routes.” Transportation Research Part B: Methodological 28 (5): 333–353. doi: 10.1016/0191-2615(94)90033-7
   Web of Science ®Google Scholar
• Carey, M., and S. Carville. 2003. “Scheduling and Platforming Trains at Busy Complex Stations.” Transportation Research Part A: Policy and Practice 37: 195–224.
   Web of Science ®Google Scholar
• Carey, M., and I. Crawford. 2007. “Scheduling Trains on a Network of Busy Complex Stations.” Transportation Research Part B: Methodological 41 (2): 159–178. doi: 10.1016/j.trb.2006.02.002
   Web of Science ®Google Scholar
• Carey, M., and D. Lockwood. 1995. “A Model, Algorithms and Strategy for Train Pathing.” Journal of the Operational Research Society 46: 988–1005. doi: 10.1057/jors.1995.136
   Web of Science ®Google Scholar
• Chen, Rongqiou. 1986. Theory and Methods of Sequencing. Wuhan: Huazhong University of Science and Technology Press.
   Google Scholar
• Cordeau, J. F., P. Toth, and D. Vigo. 1998. “A Survey of Optimization Models for Train Routing and Scheduling.” Transportation Science 32 (4): 380–404. doi: 10.1287/trsc.32.4.380
   Web of Science ®Google Scholar
• Corman, F., A. D’Ariano, D. Pacciarelli, and M. Pranzo. 2010. “A Tabu Search Algorithm for Rerouting Trains during Rail Operations.” Transportation Research Part B: Methodological 44 (1): 175–192. doi: 10.1016/j.trb.2009.05.004
   Web of Science ®Google Scholar
• Fischetti, M., M. S. Martello, and P. Toth. 1992. “Approximation Algorithms for Fixed Job Schedule Problems.” Operations Research 40: S96–S108. doi: 10.1287/opre.40.1.S96
   Web of Science ®Google Scholar
• Gabrel, V. 1995. “Scheduling Jobs Within Time Windows on Identical Parallel Machines: New Model and Algorithms.” European Journal of Operational Research 83 (2): 320–329. doi: 10.1016/0377-2217(95)00010-N
   Web of Science ®Google Scholar
• Ghoseiri, K., F. Szidarovszky, and M. J. Asgharpour. 2004. “A Multi-Objective Train Scheduling Model and Solution.” Transportation Research Part B: Methodological 38 (10): 927–952. doi: 10.1016/j.trb.2004.02.004
   Web of Science ®Google Scholar
• Guo, Chuijiang, and Dingyou Lei. 2014. “Model of Wagons’ Placing-in and Taking-Out Problem in a Railway Station and Its Heuristic Algorithm.” Mathematical Problems in Engineering 2014: 1–8.
   Google Scholar
• Kroon, L. G., H. E. Romeijn, and P. J. Zwaneveld. 1997. “Routing Trains Through Railway Stations: Complexity Issues.” European Journal of Operational Research 98 (3): 485–498. doi: 10.1016/S0377-2217(95)00342-8
   Web of Science ®Google Scholar
• Lei, Dingyou, Dong Wang, and Mingxiang Liu. 2007. “Optimization Model and Algorithm of Utilization of Arrival and Departure Tracks in Railroad Passenger Station.” Journal of Traffic and Transportation Engineering 7 (5): 84–87.
   Google Scholar
• Li, Wenquan, Wei Wang, and Shihui Cheng. 2000. “Scheduling Model and Algorithm of Using Up-and-Down Lines on Railway Marshalling Station.” Systems Engineering-Theory & Practice 20 (6): 75–78.
   Google Scholar
• Liu, Qibin, and Guizhen Ma. 2005. Railway Station and Hub. Beijing: China Railway Publishing House.
   Google Scholar
• Lv, Hongxia, Shaoquan Ni, and Hongye Ji. 2000. “The Study on DSS of the Technical Station Dispatching—Rationally Utilizing Reception and Departure Siding.” Journal of Southwest Jiaotong University 35 (2): 255–258.
   Google Scholar
• Riezebos, J., and W. van Wezel. 2009. “k-Shortest Routing of Trains on Shunting Yards.” OR Spectrum 31 (4): 745–758. doi: 10.1007/s00291-008-0140-9
   Web of Science ®Google Scholar
• Wang, Zhengbin, and Wen Du. 2006. “Adjusting Model and Algorithm for Application of Arrival and Departure Lines in Technical Stations.” Journal of Southwest Jiaotong University 41 (2): 202–205.
   Google Scholar
• Xu, Jie, Wen Du, and Junqian Chang. 2003. “The Genetic Based Algorithms Optimization Plan of Using the Arrival and Departure Track at Railway Sectional Station.” China Railway Science 24 (2): 109–114.
   Google Scholar
• Xu, Jie, Wen Du, and Bing Li. 2002. “The Optimal Algorithms of Using Arrival and Departure Line in District Station.” Systems Engineering-Theory Methodology Applications 12 (3): 253–256.
   Google Scholar
• Yiyang Railway Station of Guangzhou Railway (Group) Co., Ltd. 2014. Station Operation Detailed Rules. Guangzhou: Guangzhou Railway (Group) Co., Ltd.
   Google Scholar
• Zhang, Yinggui, Dingyou Lei, and Mingxiang Liu. 2010. “Scheduling Model and Algorithm for Track Application in Railway Station.” China Railway Science 31 (2): 96–100.
   Google Scholar
• Zhang, Yinggui, Dingyou Lei, and Bo Tang. 2011. “Due Windows Scheduling Model and Algorithm of Track Utilization in Railway Passenger Stations.” Journal of the China Railway Society 33 (1): 1–7.
   Google Scholar
• Zwaneveld, P. J., L. Kroon, H. E. Romeijn, M. Salomon, S. Dauzère-Pérès, S. P. M. Van Hoesel, and H. W. Ambergen. 1996. “Routing Trains Through Railway Stations: Model Formulation and Algorithms.” Transportation Science 30 (3): 181–194. doi: 10.1287/trsc.30.3.181
   Web of Science ®Google Scholar
• Zwaneveld, P. J., L. Kroon, and S. P. M. van Hoesel. 2001. “Routing Trains Through a Railway Station Based on a Node Packing Model.” European Journal of Operational Research 128 (3): 14–33. doi: 10.1016/S0377-2217(00)00087-4
   Web of Science ®Google Scholar