Cart (Loading....) | Create Account
Close category search window
 

A Hybrid Framework for Evolutionary Multi-Objective Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sindhya, K. ; Dept. of Math. Inf. Technol., Univ. of Jyvaskyla, Agora, Finland ; Miettinen, K. ; Deb, K.

Evolutionary multi-objective optimization algorithms are widely used for solving optimization problems with multiple conflicting objectives. However, basic evolutionary multi-objective optimization algorithms have shortcomings, such as slow convergence to the Pareto optimal front, no efficient termination criterion, and a lack of a theoretical convergence proof. A hybrid evolutionary multi-objective optimization algorithm involving a local search module is often used to overcome these shortcomings. But there are many issues that affect the performance of hybrid evolutionary multi-objective optimization algorithms, such as the type of scalarization function used in a local search and frequency of a local search. In this paper, we address some of these issues and propose a hybrid evolutionary multi-objective optimization framework. The proposed hybrid evolutionary multi-objective optimization framework has a modular structure, which can be used for implementing a hybrid evolutionary multi-objective optimization algorithm. A sample implementation of this framework considering NSGA-II, MOEA/D, and MOEA/D-DRA as evolutionary multi-objective optimization algorithms is presented. A gradient-based sequential quadratic programming method as a single objective optimization method for solving a scalarizing function used in a local search is implemented. Hence, only continuously differentiable functions were considered for numerical experiments. The numerical experiments demonstrate the usefulness of our proposed framework.

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:17 ,  Issue: 4 )

Date of Publication:

Aug. 2013

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.