A Novel Simple Particle Swarm Optimization Algorithm for Global Optimization

Xin Zhang, Dexuan Zou and Xin Shen
Additional contact information
Xin Zhang: School of Electrical Engineering & Automation, Jiangsu Normal University, Xuzhou 221116, China
Dexuan Zou: School of Electrical Engineering & Automation, Jiangsu Normal University, Xuzhou 221116, China
Xin Shen: School of Electrical Engineering & Automation, Jiangsu Normal University, Xuzhou 221116, China

Mathematics, 2018, vol. 6, issue 12, 1-34

Abstract: In order to overcome the several shortcomings of Particle Swarm Optimization (PSO) e.g., premature convergence, low accuracy and poor global searching ability, a novel Simple Particle Swarm Optimization based on Random weight and Confidence term (SPSORC) is proposed in this paper. The original two improvements of the algorithm are called Simple Particle Swarm Optimization (SPSO) and Simple Particle Swarm Optimization with Confidence term (SPSOC), respectively. The former has the characteristics of more simple structure and faster convergence speed, and the latter increases particle diversity. SPSORC takes into account the advantages of both and enhances exploitation capability of algorithm. Twenty-two benchmark functions and four state-of-the-art improvement strategies are introduced so as to facilitate more fair comparison. In addition, a t -test is used to analyze the differences in large amounts of data. The stability and the search efficiency of algorithms are evaluated by comparing the success rates and the average iteration times obtained from 50-dimensional benchmark functions. The results show that the SPSO and its improved algorithms perform well comparing with several kinds of improved PSO algorithms according to both search time and computing accuracy. SPSORC, in particular, is more competent for the optimization of complex problems. In all, it has more desirable convergence, stronger stability and higher accuracy.

Keywords: particle swarm optimization; confidence term; random weight; benchmark functions; t-test; success rates; average iteration times (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://www.mdpi.com/2227-7390/6/12/287/pdf (application/pdf)
https://www.mdpi.com/2227-7390/6/12/287/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:6:y:2018:i:12:p:287-:d:185927

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().