Print Email Facebook Twitter Convex hull ranking algorithm for multi-objective evolutionary algorithms Title Convex hull ranking algorithm for multi-objective evolutionary algorithms Author Davoodi Monfrared, M. Mohades, A. Rezaei, J. Faculty Technology, Policy and Management Department Infrastructures, Systems and Services Date 2012-01-01 Abstract Due to many applications of multi-objective evolutionary algorithms in real world optimization problems, several studies have been done to improve these algorithms in recent years. Since most multi-objective evolutionary algorithms are based on the non-dominated principle, and their complexity depends on finding non-dominated fronts, this paper introduces a new method for ranking the solutions of an evolutionary algorithm’s population. First, we investigate the relation between the convex hull and non-dominated solutions, and discuss the complexity time of the convex hull and non-dominated sorting problems. Then, we use convex hull concepts to present a new ranking procedure for multi-objective evolutionary algorithms. The proposed algorithm is very suitable for convex multi-objective optimization problems. Finally, we apply this method as an alternative ranking procedure to NSGA-II for non-dominated comparisons, and test it using some benchmark problems. Subject convex hullnon-dominated solutionsmulti-objective evolutionary algorithmscomplexityranking procedure To reference this document use: http://resolver.tudelft.nl/uuid:bb5292e5-320d-4540-8627-8d4b8a4f2cb2 DOI https://doi.org/10.1016/j.scient.2011.08.017 Publisher Elsevier ISSN 1026-3098 Source Scientia Iranica D, 18 (6), 2011 Part of collection Institutional Repository Document type journal article Rights © 2012 Sharif University of Technology Files PDF Rezaei_2011.pdf 821.14 KB Close viewer /islandora/object/uuid:bb5292e5-320d-4540-8627-8d4b8a4f2cb2/datastream/OBJ/view