Title of article :
Convex hull ranking algorithm for multi-objective evolutionary algorithms
Author/Authors :
Davoodi Monfared, M. amirkabir university of technology - Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, تهران, ايران , Mohades, A. amirkabir university of technology - Laboratory of Algorithms and Computational Geometry, Department of Mathematics and Computer Science, تهران, ايران , Rezaei, J. Delft University of Technology - Faculty of Technology, Policy and Management - Department of Technology, Strategy and Entrepreneurs hip, Netherlands
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.
Keywords :
Convex hull , Non , dominated solutions , Multi , objective evolutionary algorithms , Complexity , Ranking procedure.
Journal title :
Scientia Iranica(Transactions B:Mechanical Engineering)
Journal title :
Scientia Iranica(Transactions B:Mechanical Engineering)
