By Topic

Study on passenger train stopping scheme based on improved Particle Swarm Optimization algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shuang Wang ; Sch. of Traffic & Transp., Beijing Jiaotong Univ., Beijing, China ; Peng Zhao ; Ke Qiao

This paper develops a multi-objective optimization model for the passenger train stopping scheme on high-speed railway lines. Minimizing the stopping times for all passenger trains, minimizing travel distance of empty trains and minimizing the number of transfer passengers are the three planning objectives of the model. For a given travel demand and specified capacity of stops, the model is solved by heuristic algorithm. An improved discrete particle swarm optimization (PSO) algorithm is presented to determine the best-compromise train stopping scheme with high effectiveness and stability. In the algorithm, a stop based representation is designed, and a new method is used to update the position and velocity of particles. In order to keep the particle swarm algorithm from premature stagnation, the simulated annealing algorithm, which has local search ability, is combined with the PSO algorithm to make elaborate search near the optimal solution, then the quality of solutions is improved effectively. An empirical study on a given small railway network is conducted to demonstrate the effectiveness of the model and the performance of the algorithm. The experimental results show that the hybrid algorithm has great advantages in both success rate and convergence speed compared with other discrete PSO algorithm and genetic algorithm, and an optimal set of stopping schemes can always be generated for a given demand. To achieve the best planning outcome, the stopping schemes should be flexibly planned, and not constrained by specific ones as often set by the planner.

Published in:

Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on  (Volume:1 )

Date of Conference:

20-22 Nov. 2009