会议论文详细信息
International Conference on Manufacturing Technology, Materials and Chemical Engineering
Research on Receiving Routes and Departure Routes Assignment Problem in High-speed Railway Station Based on SFLA
机械制造;材料科学;化学工业
Zhou, Xiao Zhao^1,3 ; Zhang, Qi^2,3 ; Wang, Tao^2,3
China Academy of Railway Sciences, Beijing
100081, China^1
Signal and Communication Research Institute, China Academy of Railway Science, Beijing
100081, China^2
National Research Center of Railway Intelligence Transportation System Engineering Technology, Beijing
100081, China^3
关键词: Assignment models;    Assignment problems;    Diversity of solutions;    Global optimal solutions;    High-speed railway stations;    Multiobjective combinatorial optimization;    Sharing information;    Shuffled frog leaping algorithm (SFLA);   
Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/392/6/062124/pdf
DOI  :  10.1088/1757-899X/392/6/062124
学科分类:材料科学(综合)
来源: IOP
PDF
【 摘 要 】

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.

【 预 览 】
附件列表
Files Size Format View
Research on Receiving Routes and Departure Routes Assignment Problem in High-speed Railway Station Based on SFLA 324KB PDF download
  文献评价指标  
  下载次数:10次 浏览次数:38次