In search of the essential binary discrete particle swarm

Authors:
Enxiu Chen;Jianqing Li;Xiyu Liu
Affiliations:
School of Business Administration, Shandong Institute of Commerce and Technology, Jinan 250103, PR China;Academic Research Department, Shandong Institute of Commerce and Technology, Jinan 250103, PR China;School of Management & Economics, Shandong Normal University, Jinan 250014, PR China
Venue:
Applied Soft Computing
Year:
2011

Citing 3
Cited 3

An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
Ant Colony Optimization

Ant Colony Optimization
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence

A novel hybrid binary PSO algorithm

ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
Particle swarm optimization for the economic and economic statistical designs of the control chart

Applied Soft Computing
Essential Particle Swarm Optimization queen with Tabu Search for MKP resolution

Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The particle swarm optimization algorithm is an innovative and competitive optimization technique in evolutionary computation. It has been found to be extremely effective in solving a wide range of problems with real-parameter representation; however, it is of low efficiency in dealing with the discrete problems. In this paper, the particle swarm algorithm is broken down into its essential components, and alternative interpretations of those components are proposed. It is simpler and more powerful than the algorithms available. Experimental results show that this algorithm is faster than the standard binary discrete PSO on two suites of test functions, and that accuracy is improved for most benchmark functions used. One suite concerns about binary encoding problems, the other is about continuous-valued functions. A queen informant is also introduced. It does not increase the number of function evaluations; however, it appears it greatly speeds up the convergence.