@inbook{ranjithan_chetan_dakshina_2001, title={Constraint method-based evolutionary algorithm (CMEA) for multiobjective optimization}, volume={1993}, ISBN={3540417451}, DOI={10.1007/3-540-44719-9_21}, abstractNote={Evolutionary algorithms are becoming increasingly valuable in solving large-scale, realistic engineering multiobjective optimization (MO) problems, which typically require consideration of conflicting and competing design issues. The new procedure, Constraint Method-Based Evolutionary Algorithm (CMEA), presented in this paper is based upon underlying concepts in the constraint method described in the mathematical programming literature. Pareto optimality is achieved implicitly via a constraint approach, and convergence is enhanced by using beneficial seeding of the initial population. CMEA is evaluated by solving two test problems reported in the multiobjective evolutionary algorithm (MOEA) literature. Performance comparisons based on quantitative metrics for accuracy, coverage, and spread are presented. CMEA is relatively simple to implement and incorporate into existing implementations of evolutionary algorithm-based optimization procedures.}, booktitle={Evolutionary multi-criterion optimization: First international conference, EMO 2001, Zurich, Switzerland, March 7-9, 2001: Proceedings}, publisher={Berlin; New York: Springer}, author={Ranjithan, S. R. and Chetan, S. K. and Dakshina, H. K.}, year={2001}, pages={299–313} }