swMATH ID: 2582
Software Authors: Osman, M.S.; Abo-Sinna, Mahmoud A.; Mousa, A.A.
Description: IT-CEMOP: an iterative co-evolutionary algorithm for multiobjective optimization problem with nonlinear constraints. Over the past few years, researchers have developed a number of multiobjective evolutionary algorithms (MOEAs). Although most studies concentrate on solving unconstrained optimization problems, there exit a few studies where MOEAs have been extended to solve constrained optimization problems. Most of them were based on penalty functions for handling nonlinear constraints by genetic algorithms. However the performance of these methods is highly problem-dependent, many methods require additional tuning of several parameters. In this paper, we present a new optimization algorithm, which is based on concept of co-evolution and repair algorithm for handling nonlinear constraints. The algorithm maintains a finite-sized archive of nondominated solutions which gets iteratively updated in the presence of new solutions based on the concept of ε-dominance. The use of ε-dominance also makes the algorithms practical by allowing a decision maker to control the resolution of the Pareto set approximation by choosing an appropriate ε value, which guarantees convergence and diversity. The results, provided by the proposed algorithm for six benchmark problems, are promising when compared with exiting well-known algorithms. Also, our results suggest that our algorithm is better applicable for solving real-world application problems.
Homepage: http://www.sciencedirect.com/science/article/pii/S0096300306005698
Keywords: multiobjective nonlinear programming; multiobjective evolutionary algorithms; genetic algorithms; \(\varepsilon\)-dominance; numerical examples
Related Software: Genocop; WBMOAIS; GENLS; SPEA2; PAES
Cited in: 5 Publications

Citations by Year