By Topic

Performance evaluation of simple multiobjective genetic local search algorithms on multiobjective 0/1 knapsack 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)
Ishibuchi, H. ; Dept. of Ind. Eng., Osaka Prefecture Univ., Japan ; Narukawa, K.

The aim of this paper is to demonstrate high search ability of our simple multiobjective genetic local search (S-MOGLS) algorithm. First we explain the basic framework of the S-MOGLS algorithm, which can be implemented and efficiently executed with small memory storage and short CPU time. The S-MOGLS algorithm uses Pareto ranking and a crowding measure for generation update in the same manner as the NSGA-II. Thus the SMOGLS algorithm can be viewed as a hybrid algorithm of the NSGA-II with local search. Next we examine the performance of various variants of the S-MOGLS algorithm. Some variants use a weighted scalar fitness function in parent selection and local search while others use Pareto ranking. In computational experiments we examine a wide range of parameter specifications fro finding the point in the implementation of hybrid algorithms. Finally the S-MOGLS algorithm is compared with some evolutionary multiobjective optimization algorithms.

Published in:

Evolutionary Computation, 2004. CEC2004. Congress on  (Volume:1 )

Date of Conference:

19-23 June 2004