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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Khaled Rasheed. GADO: A genetic algorithm for continuous design optimization. Technical Report DCS-TR-352, Department of Computer Science, Rutgers, The State University of New Jersey, New Brunswick, NJ, January 1998. Ph.D. Thesis, http://webster.cs.uga.edu/~khaled/thesis.ps.
Khaled Rasheed and Haym Hirsh. Learning to be selective in genetic-algorithm-based design optimization. Artificial Intelligence in Engineering, Design, Analysis and Manufacturing, 13:157–169, 1999.
Deb, K., S. Agrawal, A. Pratap, and T. Meyarivan (2000). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In Proceedings of the Parallel Problem Solving from Nature VI, pp.849–858.
Khaled Rasheed and Haym Hirsh. Informed operators: Speeding up genetic-algorithm-based design optimization using reduced models. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’2000), pp. 628–635, 2000.
K. Rasheed., S. Vattam, X. Ni. Comparison of Methods for Using Reduced Models to Speed up Design Optimization. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’2002), pp. 1180–1187, 2002.
Khaled Rasheed. An incremental-approximate-clustering approach for developing dynamic reduced models for design optimization. In Proceedings of the Congress on Evolutionary Computation (CEC’2002), pp. 986–993, 2002.
K. Rasheed., S. Vattam, X. Ni. Comparison of methods for developing dynamic reduced models for design optimization. In Proceedings of the Congress on Evolutionary Computation (CEC’2002), pp. 390–395, 2002.
William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. Numerical Recipes in C: the Art of Scientific Computing. Cambridge University Press, Cambridge [England]; New York, 2nd edition, 1992.
J.D. Schaffer. Multi-objective optimization with vector evaluated genetic algorithms. In Proceedings of an International Conference on Genetic Algorithms and Their Applications, J.J. Grefenstette, Ed., Pittsburg, PA, July 24–26 1985, pp. 93–100, sponsored by Texas Instruments and U.S. Navy Center for Applied Research in Artificial Intelligence (NCARAI).
Binh and Korn. MOBES: A multi-objective Evolution Strategy for constrained optimization Problems. In Proceedings of the 3 rd International Conference on Genetic Algorithm MENDEL 1997, Brno, Czech Republic, pp.176–182.
Srinivas, N. and Deb, K. (1995). Multi-Objective function optimization using non-dominated sorting genetic algorithms. Evolutionary Computation (2), 221–248.
Tanaka, M. (1995). GA-based decision support system for multi-criteria, optimization. In Proceedings of the International Conference on Systems, Man and Cybernetics-2, pp. 1556–1561.
Osycza, A. and Kundu, S. (1995). A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm. Structural Optimization (10). 94–99.
Deb, K. Pratap, A. and Moitra, S. (2000). Mechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA. KanGAL Report No. 200002.
Ranjithan, S.R., S.K. Chetan, and H.K. Dakshina (2001). Constraint method-based evolutionary algorithm (CMEA) for multi-objective optimization. In E. Z. et al. (Ed.), Evolutionary Multi-Criteria Optimization 2001, Lecture Notes in Computer Science 1993, pp. 299–313. Springer-Verlag.
Zitzler, E., Laumanns, M., and Thiele, L. (2001). SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland.
Crone, D. W., Knowles, J.D., and Oates, M.J. (2000). The Pareto Envelope-based Selection Algorithm for Multi-objective Optimization. In Schoenauer, M., Deb, K., Rudolph, g., Yao, X., Luton, E., Merelo, J.J., and Schewfel, H.-P., editors, Proceedings of the Parallel Problem Solving from Nature VI Conference, pp.839–848, Paris, France. Springer. Lecture Notes in Computer Science No. 1917.
K. Deb. Multi-objective optimization using evolutionary algorithms. Chichester, UK: John Wiley, 2001.
K. Deb. S. Gulati (2001). Design of truss-structures for minimum weight using genetic algorithms, In Journal of Finite Elements in Analysis and Design, pp.447–465, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chafekar, D., Xuan, J., Rasheed, K. (2003). Constrained Multi-objective Optimization Using Steady State Genetic Algorithms. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_95
Download citation
DOI: https://doi.org/10.1007/3-540-45105-6_95
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40602-0
Online ISBN: 978-3-540-45105-1
eBook Packages: Springer Book Archive