Design of hybrid genetic algorithm with preferential local search for multiobjective optimization problems

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Evolutionary algorithms are used to obtain the optimal solutions for varieties of engineering problems. The performance of evolutionary algorithms can be enhanced by integrating them with local search methods. The idea is to combine the best of both global and local optimization approaches to perform a better exploration of search space. This paper presents a preferential hybrid evolutionary algorithm, where the gradient descent method is integrated into the NSGA-II. This new algorithm has been verified on a set of multiobjective benchmark problems using four different performance metrics. The results show that the proposed algorithm brings out the optimal solutions with better diversity and closeness to the known optimal solutions than NSGA-II and also consumes less time than traditional hybrid algorithm. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Bhuvana, J., & Aravindan, C. (2011). Design of hybrid genetic algorithm with preferential local search for multiobjective optimization problems. In Communications in Computer and Information Science (Vol. 147 CCIS, pp. 312–316). https://doi.org/10.1007/978-3-642-20573-6_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free