A hybrid SP-QPSO algorithm with parameter free adaptive penalty method for constrained global optimization problems

• Main Authors: Fatemeh, D. B., Loo, C. K., Kanagaraj, G., Ponnambalam, S. G.
• Format: Article
• Language: English
• Published: Universiti Malaysia Pahang 2018
• Subjects: TS Manufactures
• Online Access: http://umpir.ump.edu.my/id/eprint/22212/1/A%20hybrid%20SP-QPSO%20algorithm%20with%20parameter.pdf; http://umpir.ump.edu.my/id/eprint/22212/; http://journal.ump.edu.my/jmmst/article/view/195

Most real-life optimization problems involve constraints which require a specialized mechanism to deal with them. The presence of constraints imposes additional challenges to the researchers motivated towards the development of new algorithm with efficient constraint handling mechanism. This paper attempts the suitability of newly developed hybrid algorithm, Shuffled Complex Evolution with Quantum Particle Swarm Optimization abbreviated as SP-QPSO, extended specifically designed for solving constrained optimization problems. The incorporation of adaptive penalty method guides the solutions to the feasible regions of the search space by computing the violation of each one. Further, the algorithm’s performance is improved by Centroidal Voronoi Tessellations method of point initialization promise to visit the entire search space. The effectiveness and the performance of SP-QPSO are examined by solving a broad set of ten benchmark functions and four engineering case study problems taken from the literature. The experimental results show that the hybrid version of SP-QPSO algorithm is not only overcome the shortcomings of the original algorithms but also outperformed most state-of-the-art algorithms, in terms of searching efficiency and computational time.