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.
Sign-in/Register to access full text options 
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 callMore From: IOP Conference Series: Materials Science and Engineering
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.
