Smooth optimization methods for minimax problems
SIAM Journal on Control and Optimization
Co-evolving parasites improve simulated evolution as an optimization procedure
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Fuzzy Mathematical Programming: Methods and Applications
Fuzzy Mathematical Programming: Methods and Applications
Co-evolutionary particle swarm optimization to solve min-max problems
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Particle swarm optimization for minimax problems
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
Coevolutionary augmented Lagrangian methods for constrainedoptimization
IEEE Transactions on Evolutionary Computation
Max-min surrogate-assisted evolutionary algorithm for robust design
IEEE Transactions on Evolutionary Computation
Expert Systems with Applications: An International Journal
Proceedings of the 2011 Grand Challenges on Modeling and Simulation Conference
A differential evolution approach for solving constrained min-max optimization problems
Expert Systems with Applications: An International Journal
Worst-case global optimization of black-box functions through Kriging and relaxation
Journal of Global Optimization
Hi-index | 0.00 |
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.