By Topic

Preferential local search with adaptive weights in evolutionary algorithms for multiobjective optimization problems

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)
Bhuvana, J. ; Dept. of Comput. Sci. & Eng., SSN Coll. of Eng., Chennai, India ; Aravindan, C.

Hybrid evolutionary algorithms are designed to generate quality solutions by combining both global and local search mechanisms. This paper presents a hybrid evolutionary algorithm with preferential local search using adaptive weights. Preferential local search identifies the promising solutions during the evolution and applies the local search on them. This process iteratively deepens as the global search progresses. The proposed algorithm uses weighted sum method with adaptive weights to combine multiple objectives into single during the local search. Adaptive weights are assigned to objective functions according to their relative positions in the objective space. This approach is applied on 10 benchmark problems and the results have been analyzed. This adaptive weight with preferential local search incorporated within the evolutionary process enhances the efficiency of the process, which is verified by the performance metrics and are validated using statistical t-test.

Published in:

Soft Computing and Pattern Recognition (SoCPaR), 2011 International Conference of

Date of Conference:

14-16 Oct. 2011