Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems - Part 2: Constrained optimization


APPLIED SOFT COMPUTING, vol.37, pp.396-415, 2015 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 37
  • Publication Date: 2015
  • Doi Number: 10.1016/j.asoc.2015.08.052
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.396-415
  • Keywords: WSA algorithm, Non-linear programming, Constrained global optimization, Design optimization, Constraint handling, HARMONY SEARCH ALGORITHM, DESIGN OPTIMIZATION, ENGINEERING OPTIMIZATION, SIMULATION, SYSTEM, CHAOS
  • Dokuz Eylül University Affiliated: Yes


This paper is the second one of the two papers entitled "Weighted Superposition Attraction (WSA) Algorithm", which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation. (C) 2015 Elsevier B.V. All rights reserved.