Year: 2008
Type: article
Abstract: This paper presents a modified binary particle swarm optimization (BPSO) which adopts concepts of the genotype–phenotype representation and the mutation operator of genetic algorithms. Its main feature is that the BPSO can be treated as a continuous PSO. The proposed BPSO algorithm is tested on various benchmark functions, and its performance is compared with that of the original BPSO. Experimental results show that the modified BPSO outperforms the original BPSO algorithm.
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,790
OpenAlex ID: W2031366169
