Authors: Ali Osman Kusakci; Mehmet Can
Addresses: Faculty of Engineering and Natural Sciences, International University of Sarajevo, Ilidza, 71210, Bosnia and Herzegovina ' Faculty of Engineering and Natural Sciences, International University of Sarajevo, Ilidza, 71210, Bosnia and Herzegovina
Abstract: Nature inspired algorithms (NIAs) are extensively employed to solve non-linear non-convex constrained optimisation problems (COPs) since the traditional methods show poor global convergence performance. Engineering design domain involves highly complex COPs studied extensively by various NIAs. Since the global optimum for almost all benchmark problems are already identified, improving the solution is, in general, not possible. However, an improvement in terms of number of objective function evaluations (FES) and reliability is still likely. Inspired by the work by Kusakci and Can (2013), this paper proposes an evolution strategy (ES) with a CMA-like mutation operator and a ranking-based constraint-handling method. During the design stage, a set of preliminary experiments conducted on the benchmark set, and some modifications are made to improve the performance of the algorithm. The two competing mutation strategies, adaptive initialisation of the population size, and ranking-based constrained-handling strategy contribute effectively to the aim of performance improvement. The results indicate that the modified algorithm is able to find the global optimum in less FES and with higher reliability when compared with the benchmarked methods.
Keywords: constrained optimisation; covariance matrix adaptation; CMA; evolution strategy; engineering optimisation; nature inspired algorithms; NIA; bio-inspired computation; adaptive evolution; engineering design; ranking; constraint handling.
International Journal of Bio-Inspired Computation, 2014 Vol.6 No.3, pp.175 - 191
Available online: 10 Jun 2014 *Full-text access for editors Access for subscribers Purchase this article Comment on this article