Abstract

The Yinchuan–Chongqing high-speed railway (HSR) is one of the “ten vertical and ten horizontal” comprehensive transportation channels in the National 13th Five-Year Plan for Mid- and Long-Term Railway Network. However, the choice of node stations on this line is controversial. In this paper, the problem of high-speed railway station selection is transformed into a classification problem under the edge graph structure in complex networks, and a Scatter-GNN model is proposed to predict stations. The article first uses the Node2vec algorithm to perform a biased random walk on the railway network to generate the vector representation of each station. Secondly, an adaptive method is proposed, which derives the critical value of edge stations through the pinching rule, and then effectively identifies the edge stations in the high-speed railway network. Next, the calculation method of Hadamard product is used to represent the potential neighbors of edge sites, and then the attention mechanism is used to predict the link between all potential neighbors and their corresponding edge sites. After the link prediction, the final high-speed railway network is obtained, and it is input into the GNN classifier together with the line label to complete the station prediction. Experiments show that: Baoji and Hanzhong are more likely to become node stations in this north–south railway trunk line. The Scatter-GNN classifier optimizes the site selection strategy by calculating the connection probabilities between two or more candidate routes and comparing their results. This may reduce manual selection costs and ease geographic evaluation burdens. The model proposed in this paper can be used as an auxiliary strategy for the traditional route planning scheme, which may become a new way of thinking to study such problems in the future.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.