The task of optimizing a complex system presents at least two levels of problems for the system designer. First, a class of optimization algorithms must be chosen that is suitable for application to the system. Second, various parameters of the optimization algorithm need to be tuned for efficiency. A class of adaptive search procedures called genetic algorithms (GA) has been used to optimize a wide variety of complex systems. GA's are applied to the second level task of identifying efficient GA's for a set of numerical optimization problems. The results are validated on an image registration problem. GA's are shown to be effective for both levels of the systems optimization problem.
[1]
H. H. Rosenbrock,et al.
An Automatic Method for Finding the Greatest or Least Value of a Function
,
1960,
Comput. J..
[2]
Kenneth de Jong,et al.
Adaptive System Design: A Genetic Approach
,
1980,
IEEE Trans. Syst. Man Cybern..
[3]
Stephen F. Smith,et al.
Flexible Learning of Problem Solving Heuristics Through Adaptive Search
,
1983,
IJCAI.
[4]
John J. Grefenstette,et al.
Genetic Algorithms for the Traveling Salesman Problem
,
1985,
ICGA.
[5]
Michael P. Fourman,et al.
Compaction of Symbolic Layout Using Genetic Algorithms
,
1985,
ICGA.