Dynamic railcar connection planning in classification yards

References

• Ahuja, R. K., Jha, K. C. and Liu, J. 2007. Solving real-life railroad blocking problems, Interfaces, 37, (5), 404–419.
   Web of Science ®Google Scholar
• Al-Betar, M. A. and Khader, A. T. 2012. A harmony search algorithm for university course timetabling, Annals of Operation Research, 194, (1), 3–31.
   Web of Science ®Google Scholar
• Annual Statistics of Transport. 2012. Transport Waiting Time Per Car, Principal Economic and Technical Indicators of National Railway Transport. Annual Statistics of Transport, Postal and Telecommunication. Available at; < http://www.stats.gov.cn/tjsj/ndsj/> [Accessed 1 June 2013].
   Google Scholar
• Annual Statistics of Transport. 2013. National railway freight traffic by category of cargo. Annual Statistics of Transport, Postal and Telecommunication from 2001 to 2011. Available at: < http://www.stats.gov.cn/tjsj/ndsj/>. [Accessed 1 June 2013].
   Google Scholar
• Barnhart, C., Jin, H. and Vance, P. H. 2000. Railroad blocking: a network design application, Operations Research, 48, (4), 603–614.
   Web of Science ®Google Scholar
• Boysen, N., Fliedner, M., Jaehn, F. and Pesch, E. 2012. Shunting yard operations: theoretical aspects and applications, European Journal of Operational Research, 220, (1), 1–14.
   Web of Science ®Google Scholar
• Cao, J., Fan, Z. and Mao, J. 1993. Decision support system for optimizing marshaling station operation, Journal of the China Railway Society, 15, (4), 66–73.
   Google Scholar
• Carey, M. 1994. Extending a train pathing model from one-way to two-way track, Transportation Research Part B, 28, (5), 395–400.
   Google Scholar
• Cicerone, S., D'Angelo, G., Di Stefano, G. and Frigioni, D. 2009. Recoverable robustness for train shunting problems, Algorithmic Operations Research, 4, (2), 102–116.
   Google Scholar
• Daganzo, C. F., Dowling, R. G. and Hall, R. W. 1983. Railroad classification yard throughput: the case of multistage triangular sorting, Transportation Research Part A, 17, (2), 95–106.
   Google Scholar
• Daganzo, C. F. 1986. Static blocking at rail yards: sorting implications and track requirements, Transportation Science, 20, (3), 189–199.
   Web of Science ®Google Scholar
• Daganzo, C. F. 1987a. Dynamic blocking for rail yards. Part I. Homogeneous traffic, Transportation Research Part B, 21, (1), 1–27.
   Google Scholar
• Daganzo, C. F. 1987b. Dynamic blocking for rail yards. Part II. Heterogeneous traffic, Transportation Research Part B, 21, (1), 29–40.
   Google Scholar
• Dahlhaus, E., Horak, P., Miller, M. and Ryan, J. F. 2000. The train marshaling problem, Discrete Applied Mathematics, 103, (1), 41–54.
   Web of Science ®Google Scholar
• Deloitte, Haskins and Sells 1977. Rail terminal sequencing system; detail design manual, Washington, DC, Freight Car Utilization Program, Association of American Railroads.
   Google Scholar
• Di Stefano, G. and Koci, M. L. 2004. A graph theoretical approach to the shunting problem, Electronic Notes in Theoretical Computer Science, 92, 16–33.
   Google Scholar
• Lin Edward, Cheng Clark. 2009. YardSim: a rail yard simulation framework and its implementation in a major railroad in the U.S. WSC ’09 Winter Simulation Conference, 3715–3723.
   Google Scholar
• Lin Edward, Cheng Clark. 2011. Simulation and analysis of railroad hump yards in north America. WSC ’11 Winter Simulation Conference, 3715–3723.
   Google Scholar
• Geem, Z. W., Kim, J. H. and Loganathan, G. V. 2001. A new heuristic optimization algorithm: harmony search, Simulation, 76, (2), 60–68.
   Google Scholar
• Geem, Z. W. 2006. Optimal cost design of water distribution networks using harmony search, Engineering Optimization, 38, (3), 259–280.
   Web of Science ®Google Scholar
• Hansmann, R. S. and Zimmermann, U. T. 2008. Optimal sorting of rolling stock at hump yards. In: Mathematics – key technology for the future, (eds. Krebs H.-J. and Jäger W.), 189–203, Berlin/Heidelberg, Springer.
   Google Scholar
• He, S. 1996. Study on models and algorithms of operation plans in railway hub, PhD. Dissertation, Southwest Jiaotong University, Chengdu, China.
   Google Scholar
• He, S., Song, R. and Chaudhry, S. S. 2000. Fuzzy dispatching model and genetic algorithms for rail yards operations, European Journal of Operational Research, 124, (2), 307–331.
   Web of Science ®Google Scholar
• He, S., Song, R. and Chaudhry, S. S. 2003. An integrated dispatching model for rail yards operations, Computers & Operations Research, 30, (7), 939–966.
   Web of Science ®Google Scholar
• He, S., Song, R. and Zhu, S. 1995. Network flow model and algorithm for shift working plan of railway marshaling station, Journal of the China Railway Society, 17, (2), 8–15.
   Google Scholar
• He, S., Song, R. and Zhu, S. 1997. Optimal model and algorithm on stage plan of sorting and marshaling operation for marshaling station, Journal of the China Railway Society, 19, (3), 1–8.
   Google Scholar
• Hein, O. 1972. A two-stage queuing model for a marshaling yard, Rail International, 3, (4), 249–259.
   Google Scholar
• Ingram, G. and Zhang, T. 2009. Overview of applications and developments in the harmony search algorithm. In: Music-inspired harmony search algorithm, (ed. Geem Z. W.), 15–37, Berlin/Heidelberg, Springer.
   Google Scholar
• Jacob, R., Marton, P., Maue, J. and Nunkesser, M. 2011. Multistage methods for freight train classification, Networks, 57, (1), 87–105.
   Web of Science ®Google Scholar
• Jin, J. G., Zhao, J. and Lee, D. 2013. A column generation based approach for the Train Network Design Optimization problem, Transportation Research Part E, 50, 1–17.
   Google Scholar
• Jha, K. C., Ahuja, R. K. and Sahin, G. 2008. New approaches for solving the block-to-train assignment problem, Networks, 51, (1), 48–62.
   Web of Science ®Google Scholar
• Jovanovic, D. and Harker, P. T. 1991. Tactical scheduling of rail operations: the SCAN I system, Transportation Science, 25, (1), 46–64.
   Web of Science ®Google Scholar
• Kraay, D. R., Harker, P. T. and Chen, B. 1991. Optimal pacing of trains in freight railroads: model formulation and solution, Operations Research, 39, (1), 82–99.
   Web of Science ®Google Scholar
• Kraft, E. R. 1993. A mixed integer optimization model to improve freight car classification in railroad yards [ Working paper], Philadelphia, PA, OPIM Dept, Wharton School, University of Pennsylvania. Philadelphia, PA.
   Google Scholar
• Kraft, E. R. 2000. A hump sequence algorithm for real time management of train connection reliability, Journal of the Transportation Research Forum, 39, 95–115.
   Google Scholar
• Kwon, O. K., Martland, C. D. and Sussman, J. M. 1998. Routing and scheduling temporal and heterogeneous freight car traffic on rail networks, Transportation Research Part E, 34, (2), 101–115.
   Google Scholar
• Lee, K. S. and Geem, Z. W. 2004. A new structural optimization method based on the harmony search algorithm, Computers and Structures, 82, (9–10), 781–798.
   Web of Science ®Google Scholar
• Li, W., Wang, W. and Cheng, S. 2000. Scheduling model and algorithm of using up-and-down lines on railway marshaling station, Systems Engineering-Theory & Practice, 20, (6), 75–78.
   Google Scholar
• Lv, H., He, D. and Chen, T. 2008. Method of arrival and departure tracks utilization plan in railroad passenger station based on ant colony algorithm, Journal of Southwest Jiaotong University, 42, (2), 153–158.
   Google Scholar
• Marin Marinov, Jose Viegas. 2009. A simulation modelling methodology for evaluating flat-shunted yard operations. Simulation Modelling Practice and Theory, 17, (6), 1106–1129.
   Web of Science ®Google Scholar
• Marinov, M. V., Mortimer, P., Zunder, T. and Islam, D. M. Z. 2011. A steady state analysis for yard performances, Journal of Transport Literature, 5, (1), 33–49.
   Google Scholar
• Martland, C. D. 1982. PMAKE analysis: predicting rail yard time distributions using probabilistic train connection standards, Transportation Science, 16, (4), 476–506.
   Web of Science ®Google Scholar
• Nozick, L. K. and Morlok, E. K. 1997. A model for medium-term operations planning in an intermodal rail-truck service, Transportation Research Prat A, 31, (2), 91–107.
   Google Scholar
• Peng, Q., Zhao, J. and Han, X. 2010. Model and algorithm for the generalized wagon-flow allocation problem of railway technical station, China Railway Science, 31, (2), 108–114.
   Google Scholar
• Petersen, E. R. 1977a. Rail yard modeling part I: prediction of put-through time, Transportation Science, 11, (1), 37–49.
   Google Scholar
• Petersen, E. R. 1977b. Rail yard modeling part II: the effect of yard facilities on congestion, Transportation Science, 11, (1), 50–59.
   Google Scholar
• Petersen, E. R., Taylor, A. J. and Martland, C. D. 1986. An introduction to computer aided train dispatching, Journal of Advance Transportation, 20, (1), 63–72.
   Google Scholar
• Railroad Performance Measures Reports. 2013. Available at: < http://www.railroadpm.org> [Accessed 1 June 2014].
   Google Scholar
• Sauder, R. L. and Westerman, W. M. 1983. Computer-aided train dispatching: decision support through optimization, Interfaces, 13, (6), 24–37.
   Web of Science ®Google Scholar
• Shen, Y., He, S., Wang, B. and Mu, M. 2009. Study on allocation of wagon-flow in phase plan by using immune algorithm, Journal of the China Railway Society, 31, (4), 1–6.
   Google Scholar
• Shi, F., Chen, Y., Qin, J. and Zhou, W. 2009. Comprehensive Optimization of arrival-departure track utilization and inbound-outbound route assignment in railway passenger station, China Railway Science, 30, (6), 108–113.
   Google Scholar
• Szpigel, B. 1972. Optimal train scheduling on a single track railway, in Operational Research, (ed. Ross M.), 343–352, Amsterdam, North-Holland.
   Google Scholar
• Turnquist, M. A. and Daskin, M. S. 1982. Queuing models of classification and connection delay in rail yards, Transportation Science, 16, (2), 207–230.
   Web of Science ®Google Scholar
• Wang, C. 2000. The count method of train sorting schemes in marshaling stations, Journal of the China Railway Society, 22, (6), 2–7.
   Google Scholar
• Wang, C. 2002. Study on wagon-flow allocating problem in a marshaling station by using calculating method on-table, Journal of the China Railway Society, 24, (4), 1–5.
   Google Scholar
• Wang, C. 2003. Network model of static wagon-flow allocation in a marshaling station, Journal of Transportation Engineering and Information, 1, (2), 67–71.
   Google Scholar
• Wang, C. 2004. Research on the model and algorithm of dynamic wagon-flow allocating in a marshaling station, Journal of the China Railway Society, 26, (1), 1–6.
   Google Scholar
• Wang, M. and Zhao, Q. 2005. Optimal model and algorithm of stage plan of intelligent dispatching system for marshaling stations, Journal of the China Railway Society, 27, (6), 1–9.
   Google Scholar
• Wang, S., Zheng, L., Zhang, Z. and Liu, S. 2008. Mathematical model and algorithm for automatically programming the stage plan of marshaling station, China Railway Science, 29, (2), 120–125.
   Google Scholar
• Wang, S., Zheng, L., Zhang, Z. and Tian, R. 2007. Solving the scheduling problem of classification locomotive with ant colony optimization, China Railway Science, 28, (3), 104–109.
   Google Scholar
• Wang, X. 1997. Improving planning for railroad yard, forestry and distribution. PhD. Dissertation, Department of Operations and Information Management, Wharton School, University of Pennsylvania, Philadelphia, PA.
   Google Scholar
• Wang, Z., Du, W., Wu, B. and Yang, Y. 2008. Model and algorithm for estimation of wagon flow of stage operating plan based on break-up and make-up sequences, Journal of Southwest Jiaotong University, 43, (1), 91–95.
   Google Scholar
• Wong, P. J., Elliott, C. V. and Hathorne, M. R. 1979. Demonstration of dynamic track assignment program [ Technical report], Menlo Park, CA, SRI International.
   Google Scholar
• Xie, C. and Li, X. 2004. Optimization research for utilization of arrival and departure tracks in railroad passenger station, China Railway Science, 25, (5), 130–133.
   Google Scholar
• Xu, J., Du, W. and Liu, C. 2005. Model and algorithm for calculating car flow at railway technical Station, China Railway Science, 26, (4), 120–123.
   Google Scholar