Minimax optimization problems are relevant to research in scheduling, mechanical structure optimization, network design and constrained optimization. Recent papers have demonstrated that coevolutionary algorithms have a potential for solving this kind of problem. In the present paper it is argued that the approaches used so far will fail if the problem does not have a symmetric property. A new approach solves the problem.
Gecco-2001 Proceedings San Francisco Genetic and Evolutionary Computation Conference, 2001
Main Research Area:
Genetic and Evolutionary Computation Conference (GECCO 2001)