By Topic

Selection of initial solutions for local search in multiobjective genetic 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

3 Author(s)
Ishibuchi, H. ; Dept. of Ind. Eng., Osaka Prefecture Univ., Japan ; Yoshida, T. ; Murata, T.

In multiobjective genetic local search (MOGLS) algorithms, the local search is usually applied to all offsprings generated by genetic operations. This paper proposes an idea of selecting only good offsprings as initial solutions for the local search. Simulation results show that the proposed idea significantly improves the search ability of MOGLS algorithms

Published in:

Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on  (Volume:1 )

Date of Conference:

12-17 May 2002