scholarly journals Research on path optimization of ant colony algorithm Improved Particle Swarm Optimization and Reverse Learning

Author(s):  
Shaobo Li ◽  
Kangqi Mu ◽  
Weimin Lin ◽  
Dong Sun
2010 ◽  
Vol 143-144 ◽  
pp. 1154-1158 ◽  
Author(s):  
Ai Jia Ouyang ◽  
Yong Quan Zhou

In this paper, an improved particle swarm optimization-ant colony algorithm (PSO-ACO) is presented by inserting delete-crossover strategy into it for the shortcoming which PSO-ACO can’t solve the large-scale TSP. The experiments results show that the PSO-ACO has better performance than ant colony algorithm (ACO) on searching the shortest paths, error and robustness for the TSP.


2014 ◽  
Vol 926-930 ◽  
pp. 3236-3239 ◽  
Author(s):  
Mei Geng Huang ◽  
Zhi Qi Ou

The cloud computing task scheduling field representative algorithms was introduced and analyzed : genetic algorithm, particle swarm optimization, ant colony algorithm. Parallelism and global search solution space is the characteristic of genetic algorithm, genetic iterations difficult to proceed when genetic individuals are very similar; Particle swarm optimization in the initial stage is fast, slow convergence speed in the later stage ; Ant colony algorithm optimization ability is good, slow convergence speed in its first stage; Finally, the summary and prospect the future research direction.


Sign in / Sign up

Export Citation Format

Share Document