Proposal of Simple but Powerful Multiobjective Genetic Local Search Algorithm and Its Performance Evaluation

Abstract

The aim of this paper is to propose a simple multiobjective genetic local search (S-MOGLS) algorithm with high search ability and to evaluate its performance. First we explain our S-MOGLS algorithm, which can be easily understood, easily implemented and efficiently excuted with small memory storage and short CPU time. Then we examine the performance of our S-MOGLS algorithm in comparison with the NSGA-II through computational experiments on multiobjective 0/1 knapsack problems.