title: Improved evolutionary optimization from genetically adaptive multimethod search.
abstract: In the last few decades, evolutionary algorithms have emerged as a revolutionary approach for solving search and optimization problems involving multiple conflicting objectives. Beyond their ability to search intractably large spaces for multiple solutions, these algorithms are able to maintain a diverse population of solutions and exploit similarities of solutions by recombination. However, existing theory and numerical experiments have demonstrated that it is impossible to develop a single algorithm for population evolution that is always efficient for a diverse set of optimization problems. Here we show that significant improvements in the efficiency of evolutionary search can be achieved by running multiple optimization algorithms simultaneously using new concepts of global information sharing and genetically adaptive offspring creation. We call this approach a multialgorithm, genetically adaptive multiobjective, or AMALGAM, method, to evoke the image of a procedure that merges the strengths of different optimization algorithms. Benchmark results using a set of well known multiobjective test problems show that AMALGAM approaches a factor of 10 improvement over current optimization algorithms for the more complex, higher dimensional problems. The AMALGAM method provides new opportunities for solving previously intractable optimization problems.
authors.affiliation: Los Alamos National Laboratory, EES-6, Mail Stop T003, Los Alamos, NM 87545, USA. vrugt@lanl.gov
authors.forename: Jasper A
authors.initials: JA
authors.lastname: Vrugt
authors.forename: Bruce A
authors.initials: BA
authors.lastname: Robinson
mesh_terms: D000465:Algorithms; D005075:Biological Evolution; D003198:Computer Simulation