System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Hybridizing the Pareto Multi-Objective Optimization Evolutionary Algorithms by Means of Multi-Objective Local Search

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

2 Author(s)
Haidine, A. ; Tech. Univ. Dresden, Dresden ; Lehnert, R.

Hybridizing of evolutionary algorithms (EA) by means of local search has shown considerable performance improvement in single-objective optimization (SOO) field. The fine search in the neighborhood of the EA individuals (solutions) allows a fine exploration of the solution space. This paper investigates the application and the evaluation of the hybridizing mechanism of the EAs in the multi-objective optimization (MOO) domain. For this hybridizing, two types of multi-objective local search (MOLS) are used; namely large- and narrow-MOLS. Among numerous possible multi-objective optimization EAs (MOEAs), the Pareto-based variants have been considered. The performance of hybrid MOO variants are evaluated by solving the multi-objective knapsack problem.

Published in:

Hybrid Intelligent Systems, 2008. HIS '08. Eighth International Conference on

Date of Conference:

10-12 Sept. 2008