Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems

  • Authors:

  • Rajeev Kumar;Nilanjan Banerjee

  • Affiliations:

  • Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, India;Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, India

  • Venue:
  • FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we suggest a multiobjective evolutionary algorithm based on a restricted mating pool (REMO) with a separate archive for storing the remaining population. Such archive based algorithms have been used for solving real-world applications, however, no theoretical results are available. In this paper, we present a rigorous running time complexity analysis for the algorithm on two simple discrete pseudo boolean functions and on the multiobjective knapsack problem which is known to be NP-complete. We use two well known simple functions LOTZ (Leading Zeros: Trailing Ones) and a quadratic function. For the knapsack problem we formalize a ( 1+ ε)-approximation set under a constraint on the weights of the items. We then generalize the idea by eliminating the constraints based on a principle of partitioning the items into blocks and analyze REMO on it. We use a simple strategy based on partitioning of the decision space into fitness layers for the analysis.