Chapter
Jun 29, 2020
13th Asia Pacific Transportation Development Conference

Design and Implementation of a New Algorithm for Optimal Route Traversal Searching in Interlocking Stations

Publication: Resilience and Sustainable Transportation Systems

ABSTRACT

The optimal and efficient route search algorithm can improve the overall capacity of the station, and ensure the efficiency, safety, stability of the train. Aiming at reducing the complexity problem of interlocking route search algorithm, a new traversal search algorithm based on the optimal path criterion is proposed. The signal and turnout in the layout of station are transformed into vertices in the network transportation graph, the track section is transformed into the sides with length and direction, the vertices are connected, and the network graph of station is obtained. According to the actual situation of station, the optimal route search criterion is designed based on the depth first principle and the shortest path algorithm. When the starting point of the route is set, the next vertex is searched in turn according to the optimal route search criterion until the end point of the route is found. The corresponding software of the algorithm has been compiled. After verifying the practicability of the algorithm, the algorithm can be applied to the actual railway station, and can find the optimal route accurately, quickly, and steadily to meet the needs of interlocking station route searching.

Get full access to this article

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

ACKNOWLEDGEMENT

This research was funded by National Natural Science Foundation of China [Grant No.: 51907117,51975347], and the Shanghai Committee of Science and Technology [Grant No.: 18030501300].

REFERENCES

Chen, Z. Y., Dong, Y., and Yang, L., et al. (2007). Analysis and research of computer interlocking route search algorithm [J]. Railway communication signal, 43 (4): 4-6.
Chen, X. W. (2009). Research and Design of a New Distributed Computer Interlocking System [D]. Lanzhou Jiaotong University.
Ma, X. X., and Wang, W. B. (2015). Research and design of computer interlocking software for railway station [J]. High-speed railway technology, 6 (6): 45-48.
Peng, L. L., Zheng, S. B., and Chai, X. D., et al. (2018). A novel tangent error maximum power point tracking algorithm for photovoltaic system under fast multi-changing solar irradiances. Applied Energy. 210(2018):303-316.
Wang, D. L. (2014). Design of simulation system for receiving and departing of high-speed railway station [D]. Southwest Jiaotong University.
Wang, W. B., and Ma, X. X. (2016). Research on Route Search Algorithms of Computer Interlocking Software for Railway Stations [J]. Railway Computer Applications, 25(4): 63-66.
Xiao, M., Ning, H. A., and Zhao, Z. R. (2012). Research and design of route search algorithm based on digraph [C], Annual Conference of Automation and Instruments in Three Provinces and One City of Southwest China.
Xu, R. N., and Xu, Z. W. (2012). Path search algorithm and research based on primitive attributes [J]. Computer application and software, (10): 25-27.
Xie, L., and Yang, Y. (2015). Research on route search algorithm based on two-dimensional coordinate information [J]. Railway computer application, (8): 16-19.
Xiao, H. U., and Han, J. (2016). Route control station interlock logic of formal methods[J]. Computer Engineering & Applications.
Zhan, Z. C., and Xu, X. S. (2005). Data Structure and Algorithms of Route Search and Their Simulation [J]. Railway Transportation and Economy, 27 (9): 73-74.
Zhu, G. (2009). Design of switched control algorithm in interlock route generating[J]. Computer Engineering & Applications, 45(16):208-210.
Zhang, J., and Guo, J. (2010). Development and application of computer interlocking simulation software [J]. Railway computer application, 19 (7): 48-50.
Zhu, Y. Q. (2013). Simulation study on arrival and departure line operation and route arrangement of high-speed railway passenger station [J]. Railway transportation and economy, 35 (8): 79-82.
Zhang, W. Q., and Yu, L. J. (2015). A path search algorithm based on genetic algorithm [J]. Railway communication signals, 51 (9): 9-11.
Zhang, K. F., and Long, C. P. (2017). Research on automatic generation algorithm of railway station signal interlocking relationship [J]. Railway Technical Supervision, (12):32-35.

Information & Authors

Information

Published In

Go to Resilience and Sustainable Transportation Systems
Resilience and Sustainable Transportation Systems
Pages: 353 - 361
Editors: Fengxiang Qiao, Ph.D., Texas Southern University, Yong Bai, Ph.D., Marquette University, Pei-Sung Lin, Ph.D., University of South Florida, Steven I Jy Chien, Ph.D., New Jersey Institute of Technology, Yongping Zhang, Ph.D., California State Polytechnic University, and Lin Zhu, Ph.D., Shanghai University of Engineering Science
ISBN (Online): 978-0-7844-8290-2

History

Published online: Jun 29, 2020

Permissions

Request permissions for this article.

Authors

Affiliations

Wenbai Zhang [email protected]
R&D Center, Shanghai Tieda Electronic and Information Technology Co., Ltd., Shanghai, Jing'an District. E-mail: [email protected]
College of Urban Railway Transportation, Shanghai Univ. of Engineering Science, Shanghai. E-mail: [email protected]
College of Urban Railway Transportation, Shanghai Univ. of Engineering Science, Shanghai. E-mail: [email protected]

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
$174.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
$174.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share