Research on Receiving Routes and Departure Routes Assignment Problem in High-speed Railway Station Based on SFLA

Abstract

The assignment problem of receiving routes and departure routes in high-speed railway stations is a complex multi-objective combinatorial optimization problem. According to the characteristics of receiving routes and departure routes, assignment model of receiving routes and departure routes in High-speed railway stations is set up. Shuffled Frog Leaping Algorithm (short for SFLA) is adopted to solve that model. As using SFLA, it could reduce the amount of calculation effectively, improve the execution speed of the algorithm and increase the diversity of solutions. And with its unique mechanism of exchanging and sharing information, the solving process is not easy to fall into local optimum, which is beneficial to search the global optimal solution. Using SFLA offers a new method to set up the assignment model of receiving routes and departure routes in High-speed railway stations.