2010 | OriginalPaper | Chapter
Constrained Optimization
Published in: Introduction to Evolutionary Algorithms
Publisher: Springer London
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In previous chapters, we only searched the space defined by variables’ upper and lower bounds. But real-world problems are always with constraints. One important question that needs to be answered when applying EAs in constrained optimization is how to evaluate a solution that violates some constraints. Generally, we want the final results of our EAs to satisfy all the constraints. But discarding the those that violate some constraints and generating new ones again is very inefficient. Several wonderful ideas for constraint handling will be discussed in this chapter.