 |
    |
Constrained Multi-objective Optimization Using Steady State Genetic Algorithms
Deepti Chafekar, Jiang Xuan, and Khaled Rasheed
Computer Science Department
University of Georgia
Athens, GA 30602 USA
{chafekar,xuan,khaled}@cs.uga.edu
Abstract. In this paper we propose two novel approaches for solving constrained multi-objective optimization problems using steady state GAs. These methods are intended for solving real-world application problems that have many constraints and very small feasible regions. One method called Objective Exchange Genetic Algorithm for Design Optimization (OEGADO) runs several GAs concurrently with each GA optimizing one objective and exchanging information about its objective with the others. The other method called Objective Switching Genetic Algorithm for Design Optimization (OSGADO) runs each objective sequentially with a common population for all objectives. Empirical results in benchmark and engineering design domains are presented. A comparison between our methods and Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) shows that our methods performed better than NSGA-II for difficult problems and found Pareto-optimal solutions in fewer objective evaluations. The results suggest that our methods are better applicable for solving real-world application problems wherein the objective computation time is large.
LNCS 2723, p. 813 ff.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003