Binary Restructuring Particle Swarm Optimization and Its Application

Author:

Zhu Jian12,Liu Jianhua12,Chen Yuxiang12,Xue Xingsi12ORCID,Sun Shuihua12

Affiliation:

1. School of Computer Science and Mathematics, Fujian University of Technology, Fuzhou 350118, China

2. Fujian Provincial Key Laboratory of Big Data Mining and Applications, Fuzhou 350118, China

Abstract

Restructuring Particle Swarm Optimization (RPSO) algorithm has been developed as an intelligent approach based on the linear system theory of particle swarm optimization (PSO). It streamlines the flow of the PSO algorithm, specifically targeting continuous optimization problems. In order to adapt RPSO for solving discrete optimization problems, this paper proposes the binary Restructuring Particle Swarm Optimization (BRPSO) algorithm. Unlike other binary metaheuristic algorithms, BRPSO does not utilize the transfer function. The particle updating process in BRPSO relies solely on comparison results between values derived from the position updating formula and a random number. Additionally, a novel perturbation term is incorporated into the position updating formula of BRPSO. Notably, BRPSO requires fewer parameters and exhibits high exploration capability during the early stages. To evaluate the efficacy of BRPSO, comprehensive experiments are conducted by comparing it against four peer algorithms in the context of feature selection problems. The experimental results highlight the competitive nature of BRPSO in terms of both classification accuracy and the number of selected features.

Funder

National Natural Science Foundation of China

Fujian University of Technology Development Fund

Publisher

MDPI AG

Subject

Molecular Medicine,Biomedical Engineering,Biochemistry,Biomaterials,Bioengineering,Biotechnology

Reference39 articles.

1. Kennedy, J., and Eberhart, R. (December, January 27). Particle swarm optimization. Proceedings of the ICNN’95—International Conference on Neural Networks, Perth, WA, Australia.

2. Shi, Y., and Eberhart, R. (1998, January 4–9). A modified particle swarm optimizer. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation Proceedings—IEEE World Congress on Computational Intelligence, Anchorage, AK, USA.

3. Kennedy, J., and Eberhart, R.C. (1997, January 12–15). A discrete binary version of the particle swarm algorithm. Proceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics, Computational Cybernetics and Simulation, Orlando, FL, USA.

4. A Modified Binary Particle Swarm Optimization for Knapsack Problems;Bansal;Appl. Math. Comput.,2012

5. A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem;Lin;Expert Syst. Appl.,2019

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3