Evolutionary Algorithms for Minimax Problems in Robust Design
Aaron M. Cramer, Scott D. Sudhoff, E. L. Zivi · IEEE Transactions on Evolutionary Computation · 2008
Many robust design problems can be described by minimax optimization problems. Classical techniques for solving these problems have typically been limited to a discrete form of the problem. More recently, evolutionary algorithms, particularly coevolutionary optimization techniques, have been applied to minimax problems. A new method of solving minimax optimization problems using evolutionary algorithms is proposed. The performance of this algorithm is shown to compare favorably with the existing methods on test problems. The performance of the algorithm is demonstrated on a robust pole placement problem and a ship engineering plant design problem.