An adaptive evolution strategy for constrained optimisation problems in engineering design
by Ali Osman Kusakci; Mehmet Can
International Journal of Bio-Inspired Computation (IJBIC), Vol. 6, No. 3, 2014

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.

Online publication date: Sat, 27-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email