Using Simulated Annealing for Robustness in Coevolutionary Genetic Algorithms
Simulated annealing is a useful heuristic for finding good solutions for difficult combinatorial optimization problems. In some engineering applications the quality of a solution is based upon how tolerant the solution is to changes in the environment. The concept of simulated annealing is based upo...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
NSUWorks
2014
|
| Subjects: | |
| Online Access: | http://nsuworks.nova.edu/gscis_etd/334 http://nsuworks.nova.edu/cgi/viewcontent.cgi?article=1333&context=gscis_etd |