Empty Car Distribution Considering Timeliness Requirement at Chinese Railways
Publication: Journal of Transportation Engineering, Part A: Systems
Volume 147, Issue 10
Abstract
Due to variations in freight traffic arising in daily operations, railways need to develop a distribution plan to determine the actual movements of empty cars every day. This paper investigates the daily empty car distribution problem in the Chinese railway system, which is a scheduled railway system but one where scheduled train services in the timetable are not fixed. To make current empty car distribution more market-oriented, this paper takes the timeliness requirement of empty car demands into account. A time-space network that divides the planning horizon into multiple decision-making stages is constructed to describe the process of empty car distribution. With consideration of car types and the network capacity shared by loaded and empty cars, an integer programming model is proposed to minimize total cost in the distribution process. A Lagrangian relaxation heuristic algorithm is designed to solve this problem. The effectiveness of the proposed model and algorithm is demonstrated by numerical experiments based on realistic data from the Haoji Railway, a rail freight corridor. Finally, sensitivity analyses indicate that unit shortage costs and delay penalties can be set relatively high and that many train paths should be scheduled in the timetable to ensure that stations receive empty cars on time.
Get full access to this article
View all available purchase options and get full access to this article.
Data Availability Statement
Some or all data, models, or code generated or used during the study are available from the first author by request.
Acknowledgments
This work was supported by the following institutions: National Key Research and Development Program of China under Grant No. 2016YFC0802208; the National Natural Science Foundation of China under Grant No. 61703351; the Humanities and Social Sciences Fund of the Ministry of Education under Grant No. 18YJC630190; the Sichuan Science and Technology Program under Grant Nos. 20YYJC0952, 20YYJC2909, 20GJHZ0156, and 20MZGC0341; the Science and Technology Plan of China Railway Corporation under Grant Nos. P2018T001, K2018X012, and N2018X006-01; and the Natural Science Foundation of Zhejiang Province under Grant No. LQ18G030012.
References
Barnhart, C., H. Jin, and P. H. Vance. 2000. “Railroad blocking: A network design application.” Oper. Res. 48 (4): 603–614. https://doi.org/10.1287/opre.48.4.603.12416.
Cao, X. M., and B. L. Lin. 2007. “An optimization method for distribution of empty cars based on stock cost.” J. China Railway Soc. 29 (4): 18–22. https://doi.org/10.3321/j.issn:1001-8360.2007.04.004.
Cao, X. M., X. F. Wang, and B. L. Lin. 2009. “Collaborative optimization model of the loaded and empty car flow routing and the empty car distribution of multiple car types.” China Railway Sci. 30 (6): 114–118. https://doi.org/10.3321/j.issn:1001-4632.2009.06.019.
Caprara, A., M. Fischetti, and P. Toth. 2017. “Modeling and solving the train timetabling problem.” Oper. Res. 50 (5): 851–861. https://doi.org/10.1287/opre.50.5.851.362.
Du, Y. P., X. F. Yin, and C. H. Liu. 2006. “Solving railway empty cars adjustment problem by ant colony system algorithm.” China Railway Sci. 27 (4): 119–122. https://doi.org/10.3321/j.issn:1001-4632.2006.04.023.
Fan, Z. P., D. Liang, B. L. Lin, and X. Ma. 2007a. “Improvement of the empty car distribution model with substitution of car types.” China Railway Sci. 28 (6): 109–112. https://doi.org/10.3321/j.issn:1001-4632.2007.06.020.
Fan, Z. P., D. Liang, B. L. Lin, and X. Ma. 2007b. “Study on optimizing loaded and empty cars distribution with substitution of car types in technical plan.” J. China Railway Soc. 29 (6): 7–11. https://doi.org/10.3321/j.issn:1001-8360.2007.06.002.
Garey, M. R., and D. S. Johnson. 1979. Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman and Company.
Guo, P. W., J. Chu, and B. L. Lin. 2003. “Reiterative adjusting method of empty wagons on large-scale railway network.” China Railway Sci. 23 (4): 111–117. https://doi.org/10.3321/j.issn:1001-4632.2002.04.022.
Haghani, A. E. 1989. “Formulation and solution of a combined train routing and makeup, and empty car distribution model.” Transport. Res. Part B: Methodol. 23 (6): 433–452. https://doi.org/10.1016/0191-2615(89)90043-X.
Holmberg, K., M. Joborn, and K. Melin. 2008. “Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths.” Eur. J. Oper. Res. 188 (1): 101–108. https://doi.org/10.1016/j.ejor.2007.04.029.
Joborn, M., T. G. Crainic, M. Gendreau, K. Holmberg, and J. T. Lundgren. 2004. “Economies of scale in empty freight car distribution in scheduled railways.” Transp. Sci. 38 (2): 121–134. https://doi.org/10.1287/trsc.1030.0061.
Li, Z. P., and J. F. Xia. 2005. “Time restraint-based model and algorithm for railway empty wagon distribution.” J. Southwest Jiaotong Univ. 40 (3): 361–365. https://doi.org/10.3969/j.issn.0258-2724.2005.03.017.
Liang, D., and B. L. Lin. 2007. “Research on the multi-stage optimization model of empty railcar distribution.” J. China Railway Soc. 29 (1): 1–6. https://doi.org/10.3321/j.issn:1001-8360.2007.01.001.
Lin, B. L., and G. H. Qiao. 2008. “Iterative algorithm of railway network empty cars distribution based on restriction of route capacity.” China Railway Sci. 29 (1): 93–96. https://doi.org/10.3321/j.issn:1001-4632.2008.01.019.
Niu, H. M. 2001. “A model for cooperative optimization of heavy and empty traffic organization in railway hubs using genetic algorithm.” J. China Railway Soc. 23 (4): 12–16. https://doi.org/10.3321/j.issn:1001-8360.2001.04.003.
Wang, B., C. H. Rong, H. D. Li, and B. H. Wang. 2015a. “Multi-time point optimization model for empty railcar distribution.” J. Transp. Sys. Eng. Inf. Technol. 15 (5): 157–163. https://doi.org/10.3969/j.issn.1009-6744.2015.05.023.
Wang, L., J. Ma, B. Lin, J. Li, and S. Ni. 2015b. “Dynamic empty car distribution for the whole rail system and calculation for empty car flow discharged over network boundaries.” J. China Railway Soc. 37 (6): 1–9. https://doi.org/10.3969/j.issn.1001-8360.2015.06.001.
Xiong, H. Y., W. Y. Lu, and H. Y. Wen. 2002. “Hereditary heuristic algorithm for empty car distribution in railway transportation.” China Railway Sci. 23 (4): 119–121. https://doi.org/10.3321/j.issn:1001-4632.2002.04.023.
Zhang, H., B. T. Dong, and Y. Y. Sun. 2016. “Multi-type empty car dynamic distribution method based on capacity constraints.” J. Beijing Jiaotong Univ. 40 (6): 50–56. https://doi.org/10.11860/j.issn.1673-0291.2016.06.009.
Information & Authors
Information
Published In
Journal of Transportation Engineering, Part A: Systems
Volume 147 • Issue 10 • October 2021
Copyright
© 2021 American Society of Civil Engineers.
History
Received: Sep 17, 2020
Accepted: Feb 24, 2021
Published online: Aug 4, 2021
Published in print: Oct 1, 2021
Discussion open until: Jan 4, 2022
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.