2009 | OriginalPaper | Buchkapitel
Infeasibility Driven Evolutionary Algorithm for Constrained Optimization
verfasst von : Tapabrata Ray, Hemant Kumar Singh, Amitay Isaacs, Warren Smith
Erschienen in: Constraint-Handling in Evolutionary Optimization
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Real life optimization problems often involve one or more constraints and in most cases, the optimal solutions to such problems lie on constraint boundaries. The performance of an optimization algorithm is known to be largely dependent on the underlying mechanism of constraint handling. Most population based stochastic optimization methods prefer a feasible solution over an infeasible solution during their course of search. Such a preference drives the population to feasibility first before improving its objective function value which effectively means that the solutions approach the constraint boundaries from the feasible side of the search space. In this chapter, we introduce an evolutionary algorithm that explicitly maintains a small percentage of infeasible solutions close to the constraint boundaries during its course of evolution. The presence of marginally infeasible solutions in the population allows the algorithm to approach the constraint boundary from the infeasible side of the search space in addition to its approach from the feasible side of the search space via evolution of feasible solutions. Furthermore, “good” infeasible solutions are ranked higher than the feasible solutions, thereby focusing the search for the optimal solutions near the constraint boundaries. The performance of the proposed algorithm is compared with Non-dominated Sorting Genetic Algorithm II (NSGA-II) on a set of single and multi-objective test problems. The results clearly indicate that the rate of convergence of the proposed algorithm is better than NSGA-II on the studied test problems. Additionally, the algorithm provides a set of marginally infeasible solutions which are of great use in trade-off studies.