Optimal site selection of China railway data centers by the PSO algorithm

This paper mainly discusses and analyzes the optimal number of China railway data centers and the corresponding positions considering the distance factor and the data's volume of each railway bureau. Firstly, optimal site selection problem on single data center is mainly solved by the Lagrangian multiplier method. Secondly, optimal site selection problem on several data centers is mainly overcome by the PSO algorithm. Eventually, numerical results in the paper highlight that the single data center mainly locates into Zheng Zhou railway bureau and two data centers locate into Bei Jing railway bureau and Cheng Du railway bureau. Additionally, three data centers locate into Bei Jing railway bureau, Wu Han railway bureau and Cheng Du railway bureau, while four data centers locate into Bei Jing railway bureau, Wu Han railway bureau, Cheng Du railway bureau and Guang Zhou railway bureau.