Investigating binary PSO parameter influence on the knights cover problem

Author

Franken, Nelis ; Engelbrecht, Andries P.

Author_Institution

Dept. of Comput. Sci., Pretoria Univ.

Volume

1

fYear

2005

fDate

5-5 Sept. 2005

Firstpage

282

Abstract

The underlying relationship between various PSO parameters is experimentally examined by applying the binary PSO (BinPSO) algorithm to solve the knights cover problem. An exhaustive analysis of the cognitive and social acceleration constants is performed, as well as an investigation into the influence of an increased maximum velocity on overall performance. An intuitive visualisation method eases the analysis of experimental results, and certain assumptions about the direct mapping of continuous PSO to BinPSO parameter values are corrected. The effects of increasing the complexity of the problem are also directly studied and recommendations made to improve performance under larger board sizes

Keywords

computational complexity; games of skill; particle swarm optimisation; binary particle swarm optimization algorithm; computational complexity; intuitive visualisation method; knights cover problem; social acceleration constant; Acceleration; Africa; Computer science; Game theory; Intelligent agent; Neural networks; Particle swarm optimization; Performance analysis; Protection; Visualization;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2005. The 2005 IEEE Congress on

Conference_Location

Edinburgh, Scotland

Print_ISBN

0-7803-9363-5

Type

conf

DOI

10.1109/CEC.2005.1554696

Filename

1554696