Parameters Analysis of Pso Algorithm in Intelligent System Optimization

Jiashun Zhang; Rongjie Lv; Ling Wang
November 2013
Journal of Applied Sciences;2013, Vol. 13 Issue 22, p5498
Academic Journal
With the rapid development of intelligent system, real time optimization become more and more urgent. Particle Swarm Optimization (PSO) is one of the most effective algorithms in solving such problems. Considered the complexity of intelligent system optimization, speed-up technique is needed. As many optimization problems can be converted to travelling salesman problem, the standard benchmark problem of TSP with 31 cities is employed to analyze the relationship between optimal solution and different parameters. The effect on average of the optimal solution, optimal solution, convergence speed and stability of the optimal solution of different parameters are analyzed. Finally, a comparation with ant colony algorithm is conducted and suitable values of parameters are proposed.


Related Articles

  • Improved ACO Algorithm with Pheromone Correction Strategy for the Traveling Salesman Problem. Tuba, M.; Jovanovic, R. // International Journal of Computers, Communications & Control;Jun2013, Vol. 8 Issue 3, p477 

    A new, improved ant colony optimization algorithm with novel pheromone correction strategy is introduced. It is implemented and tested on the traveling salesman problem. Algorithm modification is based on undesirability of some elements of the current best found solution. The pheromone values...

  • Parameters Analysis for Basic Ant Colony Optimization Algorithm in TSP. Xianmin Wei // International Journal of U- & E-Service, Science & Technology;2014, Vol. 7 Issue 4, p159 

    In order to effectively address the lack of basic ant colony algorithm in terms of parameters, we use four-step method instead of the popular three-step, based on a large number of experiments of the parameters setting, this paper summed up an effective selection method for m, α, β, ρ...

  • Research on Information Applied Technology with Swarm Intelligence for the TSP Problem. Fangguo He // Advanced Materials Research;2014, Issue 886, p584 

    As a swarm intelligence algorithm, particle swarm optimization (PSO) has received increasing attention and wide applications in information applied technology. This paper investigates the application of PSO algorithm to the traveling salesman problem (TSP) on applied technology. Proposing the...

  • REVIEW of APPLICATION of ANT COLONY OPTIMIZATION. Khandre, Hiteshri S. // International Journal of Engineering Science & Technology;2011, Vol. 3 Issue Sup, p40 

    Ant colony optimization is a technique for optimization that was introduced in the early 1990's. The inspiring source of ant colony optimization is the foraging behavior of real ant colonies.Ant colony optimization is new meta-heuristic that has proven it's quality & versatility on various...

  • Study of parameters configuration in ant colony algorithm. Yanrong Cui // Applied Mechanics & Materials;2014, Issue 678, p51 

    It has obtained a better result to use ant colony algorithm to solve complex combinatorial optimization problems, but different value of the parameters in ant colony algorithm affects the performance of the algorithm. This paper studies the configuration of parameters in ant colony algorithm,...

  • Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem. Ho-Yoeng Yun; Suk-Jae Jeong; Kyung-Sup Kim // Journal of Applied Mathematics;2013, p1 

    We propose a novel heuristic algorithm based on the methods of advanced Harmony Search and Ant Colony Optimization (AHS-ACO) to effectively solve the Traveling Salesman Problem (TSP). The TSP, in general, is well known as an NP-complete problem, whose computational complexity increases...

  • Ant Colony Optimization (ACO) and a Variation of Bee Colony Optimization(BCO) in Solving TSP Problem, a Comparative Study. Jasser, Muhammed Basheer; Sarmini, Mohamad; Yaseen, Rauf // International Journal of Computer Applications;Jun2014, Vol. 96, p1 

    Traveler sales man problem is known research problem which has a lot of industrial applications. A lot of algorithms has been proposed to solve TSP, some of Ant Colony Optimization (ACO) and Bee Colony Optimization (BCO) algorithms. BCO algorithm has variations and enhancements to improve the...

  • Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System. Yousefikhoshbakht, Majid; Malekzadeh, Nasrin; Sedighpour, Mohammad // International Journal of Production Management & Engineering;Jul-Dec2016, Vol. 4 Issue 2, p65 

    The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the...

  • A Viral Systems Algorithm for the Traveling Salesman Problem. Suryadi, Dedy; Maryska Kandi, Yoana Valois // Proceedings of the International Conference on Industrial Engine;2012, p1989 

    The Traveling Salesman Problem (TSP) is a complex combinatorial problem, This research proposes a Viral Systems algorithm to solve the TSP. In Viral Systems, a solution is encoded into the genome of a cell. The virus that infects a cell may replicate. There are two types of replications, i.e....


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics