| 一种新型的求解城市公交路网的并行PSO算法 |
| |
| 引用本文： | 方昕.一种新型的求解城市公交路网的并行PSO算法[J].计算机与现代化,2012(5):16-19. |
| |
| 作者姓名： | 方昕 |
| |
| 作者单位： | 安康学院电子与信息工程系,陕西安康,725000 |
| |
| 基金项目： | 安康学院计算机应用技术重点学科项目，陕西省计算机科学与技术研究项目，安康学院计算机科学与技术重点学科项目 |
| |
| 摘 要： | 粒子群算法是求解组合优化的新智能算法,本文以串行粒子群算法机理为核心,结合运筹学旅行商组合优化理论和并行的OpenMP技术,给出一种规划城市公交路网最短路径的并行PSO算法模型。通过Visual Studio 2005中C++编程实现仿真,得到城市公交路网路程权重最短目标,并与串行粒子群算法结果进行比较。实验结果表明,该算法不但能解决城市公交路网问题,而且执行时间短,具有更好的鲁棒性。
|
| 关 键 词： | 粒子群算法 公交路网 OpenMP 并行PSO算法 仿真 |
A New Parallel PSO Algorithm to Solve Urban Bus Path Problem |
| |
| FANG Xin.A New Parallel PSO Algorithm to Solve Urban Bus Path Problem[J].Computer and Modernization,2012(5):16-19. |
| |
| Authors: | FANG Xin |
| |
| Affiliation: | FANG Xin(Dept.of Electronic and Information Engineering,Ankang University,Ankang 725000,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | PSO bus path OpenMP parallel PSO algorithm simulation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
