Abstract
PurposeThe purpose of this paper is to improve and to extend the use of original rank‐niche evolution strategy (RNES) algorithm to solve constrained and unconstrained multiobjective optimization problems.Design/methodology/approachA new mutation step size is developed for evolution strategy. A mixed ranking procedure is used to improve the quality of the fitness function. A self‐adaptive sharing radius is developed to save computational time. Four constraint‐treating methods are developed to solve constrained optimization problems. Two of them do not use penalty function approach.FindingsThe improved RNES algorithm finds better quality Pareto‐optimal solutions more efficiently than the previous version. For most test problems, the solutions obtained by improved RNES are better than, or at least can be compared with, results from other papers.Research limitations/implicationsThe application of any evolutionary algorithm to real structural optimization problems would face a problem of spending huge computational time. Some approximate analysis method needs to be incorporated with RNES to solve practical problems.Originality/valueThis paper provides an easier approach to find Pareto‐optimal solutions using an evolutionary algorithm. The algorithm can be used to solve both unconstrained and constrained problems.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call