Constrained Optimization with Evolutionary Algorithms: A Comprehensive Review | Zendy

Ali Osman Kuşakçı | Zendy; Mehmet Can | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Constrained Optimization with Evolutionary Algorithms: A Comprehensive Review

Author(s) -

Ali Osman Kuşakçı,

Mehmet Can

Publication year - 2012

Publication title -

southeast europe journal of soft computing

Language(s) - English

Resource type - Journals

ISSN - 2233-1859

DOI - 10.21533/scjournal.v1i2.56

Subject(s) - computer science , evolutionary algorithm , mathematical optimization , optimization problem , constraint (computer aided design) , optimization algorithm , artificial intelligence , algorithm , mathematics , geometry

Global optimization is an essential part of any kind of system. Various algorithms have been proposed that try to imitate the learning and problem solving abilities of the nature up to certain level. The main idea of all nature-inspired algorithms is to generate an interconnected network of individuals, a population. Although most of unconstrained optimization problems can be easily handled with Evolutionary Algorithms (EA), constrained optimization problems (COPs) are very complex. In this paper, a comprehensive literature review will be presented which summarizes the constraint handling techniques for COPs

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research