{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture14-2-25-2002

# Lecture14-2-25-2002 - MAE 552 Heuristic Optimization...

This preview shows pages 1–7. Sign up to view the full content.

MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #14 2/25/02 Evolutionary Algorithms

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Practical Implementation Issues The next set of slides will deal with some issues encountered in the practical implementation of a genetic algorithm. Specifically constraint handling and convergence criteria.
Constraint Handling What if we have a constrained problem? Typically would use a penalty function to worsen the fitness of any designs which violate constraints.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Constraint Handling Example of a penalty term. This will provide a numerical violation value. It is up to you to decide how this will effect your fitness. = = + = m j l k k j x h x g x P 1 1 2 2 ) ( ] 0 ), ( max[ ) (
Convergence Common ways of determining convergence: 1. No change in best quality design over chosen number of gens. 2. No change in average quality of population of chosen number of gens. 3. Set a maximum allowable number of generations. 4. Set a maximum allowable number of objective function evaluations.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Putting It All Together begin t = 0 initialize P(t) evaluate P(t) while (not converged) do t = t + 1 select P(t) from P(t-1) alter P(t) (variation operators) evaluate P(t) end do while end
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}