一种新型的求解城市公交路网的并行PSO算法

摘要

粒子群算法是求解组合优化的新智能算法,本文以串行粒子群算法机理为核心,结合运筹学旅行商组合优化理论和并行的OpenMP技术,给出一种规划城市公交路网最短路径的并行PSO算法模型.通过Visual Studio 2005中C++编程实现仿真,得到城市公交路网路程权重最短目标,并与串行粒子群算法结果进行比较.实验结果表明,该算法不但能解决城市公交路网问题,而且执行时间短,具有更好的鲁棒性.%PSO is a new swarm intelligence algorithm to solve combinatorial optimization. By using PSO mechanism and combining with combinatorial optimization TSP problem and OpenMP parallel technology, a parallel PSO algorithm model is given to solve the urban bus shortest path. The urban bus road weight is solved by C ++ programming in Visual Studio 2005. Compared to the previous PSO algorithm, experimental results show that the parallel PSO not only can solve the urban bus path problem, but also its execution time is short and is of better robustness.