Chapter
Jan 13, 2020
Sixth International Conference on Transportation Engineering

Simple Method for Inbound Train Receiving and Allocation in Bidirectional Marshalling Station

Publication: ICTE 2019

ABSTRACT

Bidirectional marshalling stations are usually large and will inevitably produce angular railcar flow. How to deal with the receiving yard and allocation of this flow is an optimization problem. In this paper, a hybrid-direction train with angular railcar flow is defined, and we derive the critical proportion value of an angular railcar flow receiving yard according to the operation time standards of the marshalling station, including the disassembly and assembly time of the two operation systems. To prepare the outbound train for departure as soon as possible, the exchange yard connecting time constraint is considered as a priority. This is a simple mathematical model in which the minimum total cost is established by transforming the time constraint into the cost constraint to allocate the railcar flows in the two operation systems separately. The results of the case study show that the rational use of angular railcar flow can be realized by considering the connection time and the number of exchange railcars on the basis of the critical proportion of angular railcar flow and the departure of the outbound train with a full load. This can provide a basis for the establishment of a marshalling station outline shift plan.

Get full access to this chapter

View all available purchase options and get full access to this chapter.

ACKNOWLEDGEMENT

This research was supported by the Natural National Science Foundation of China (Project No. 61203175), the Sichuan Science and Technology Program, China (Project No.2019YJ0211), and the Open Foundation of National Engineering Laboratory of Integrated Transportation Big Data Application Technology (Project No. CTBDAT201902, CTBDAT201911).

REFERENCES

Assad, A. A. (1980). “Modeling of rail networks: Toward a routing/makeup model.” Transportation Research Part B 14(1): 101-114.
Adlbrecht, J. A., Hüttler, B., Zazgornik, J., Gronalt, M. (2015). “The train marshalling by a single shunting engine problem.” Transportation Research Part C 58(7): 56-72. https://doi.org/10.1016/j.trc.2015.07.006
Bohlin, M., Gestrelius, S., Dahms, F, Mihalák, M., Flier, H. (2016). “Optimization Methods for Multistage Freight Train Formation.” Transportation Science 50(3): 823-840. https://doi.org/10.1287/trsc.2014.0580
Boysen, N., Emde, S., Fliedner, M. (2016). “The basic train makeup problem in shunting yards.” OR Spectrum 38(1): 207-233.
Boysen, N., Fliedner, M., Jaehn, F., Pesch, E. (2012). “Shunting yard operations: Theoretical aspects and applications.” European Journal of Operational Research 220(1): 1-14.
Daganzo, C.F., Dowling, R.G., Hall, RW. (1983). “Railroad classification yard throughput: The case of multistage triangular sorting.” Transportation Research Part A 17(2): 95-106.
Jacob, R., Márton, P., Maue, J., Nunkesser, M. (2011). “Multistage methods for freight train classification.” Networks 57(1): 87-105.
Martinelli, D.R., Teng, H. (1995). “Optimization of railway operations using neural networks.” Transportation Research Part C 4(1): 33-49.
Ma, L., Guo, J., Chen, G.W. (2014). “Constraint Propagation and Heuristics Backtracking Algorithm for Static Wagon-Flow Allocation at a Marshalling Station.” Journal of Southwest Jiao tong University 9(6): 1116-1122.
Niu, H.M. (2007). “Optimal model and algorithm for adjusting the dispatching plan of trains operated at double-direction classification yards.” China Railway Science 28(6): 102-108.
Niu, H.M., Hu, A.Z. (1998). “Comprehensive optimization of car flows joining at bidirectional marshalling station.” Journal of the China Railway Society 20(6): 16-21.
Song, G.M. (2010). “Research on the optimization method of the bidirectional marshalling station stage plan.” Master Thesis, Beijing Jiaotong University.
Shi, T., Zhou, X.S. (2015). “A Mixed Integer Programming Model for Optimizing Multi-Level Operations Process in Railroad Yards.” Transportation Research Part B 80(10): 19-39. https://doi.org/10.1016/j.trb.2015.06.007
Wang, Z.M. (2013). “Combined optimization of train service network design and division of work of two systems of the same marshaling yard.” PhD Thesis, Beijing Jiaotong University.
Xue, F., Luo, J., Chen, C.S. (2010). “Calculation of Train Sorting and Classifying Time Parameters of Wagon-flow Allocation in a Marshalling Station.” Journal of Transportation Engineering and Information 8(4): 21-27.
Yaghini, M., Foroughi, A., Nadjari, B. (2011). “Solving railroad blocking problem using ant colony optimization algorithm.” Applied Mathematical Modeling 35(12): 5579-5591.
Yagar, S., Saccomanno, F.F., Shi, Q. (1983). “An efficient sequencing model for humping in a rail yard.” Transportation Research Part A 17(4): 251-262.
Zhao, J., Peng, Q.Y. (2014). “Integer Programming Model and Algorithm for Wagon-flow Allocation Problem at Double-direction Marshalling Station.” Journal of the China Railway Society 36(9): 10-19.

Information & Authors

Information

Published In

Go to ICTE 2019
ICTE 2019
Pages: 1032 - 1042
Editors: Xiaobo Liu, Ph.D., Southwest Jiaotong University, Qiyuan Peng, Ph.D., Southwest Jiaotong University, and Kelvin C. P. Wang, Ph.D., Oklahoma State University
ISBN (Online): 978-0-7844-8274-2

History

Published online: Jan 13, 2020

Permissions

Request permissions for this article.

Authors

Affiliations

Jian Luo
School of Automobile and Transportation, Xihua Univ., Chengdu, Sichuan, People’s Republic of China, PO Box 610039
School of Transportation and Logistics, National United Engineering Laboratory of Integrated and Intelligent Transportation, and National Engineering Laboratory of Integrated Transportation Big Data Application Technology, Chengdu, Sichuan, People’s Republic of China, PO Box 611756 (corresponding author). E-mail: [email protected]
Chuanlei He
School of Transportation and Logistics, Southwest Jiaotong Univ., Chengdu, Sichuan, People’s Republic of China, PO Box 611756

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.

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Paper
$35.00
Add to cart
Buy E-book
$254.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Paper
$35.00
Add to cart
Buy E-book
$254.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share