Evaluation of Genetic Algorithm Concepts Using Model Problems. Part 2; Multi-Objective Optimization
Author: National Aeronautics and Space Administration (NASA)
Publisher: Createspace Independent Publishing Platform
Published: 2018-05-31
Total Pages: 44
ISBN-13: 9781720513612
DOWNLOAD EBOOKA genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of simple model problems. Several new features including a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. Results indicate that the genetic algorithm optimization approach is flexible in application and extremely reliable, providing optimal results for all optimization problems attempted. The binning algorithm generally provides pareto front quality enhancements and moderate convergence efficiency improvements for most of the model problems. The gene-space transformation procedure provides a large convergence efficiency enhancement for problems with non-convoluted pareto fronts and a degradation in efficiency for problems with convoluted pareto fronts. The most difficult problems --multi-mode search spaces with a large number of genes and convoluted pareto fronts-- require a large number of function evaluations for GA convergence, but always converge.Holst, Terry L. and Pulliam, Thomas H.Ames Research CenterGENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; OPERATORS (MATHEMATICS); CONVERGENCE; VECTOR ANALYSIS; STOCHASTIC PROCESSES