Comparison of sorting algorithms for multi-fitness measurement of cooperative coevolution

  • Authors:
  • Min Shi

  • Affiliations:
  • Norwegian University of Science and Technology, Trondheim, Norway

  • Venue:
  • Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Implementing evaluation of individuals based on multi-fitness has received growing interest in evolution, especially in coevolution, in the past decade. Assigning multi-fitness to an individual was originally suggested in Multi-Objective Evolutionary Algorithms (MOEA). The primary purpose was to find solutions simultaneously optimizing all objectives for a given problem. Non-dominated sorting is an algorithm that has been widely used for multi-fitness measurement both on single-objective and multi-objective problems. In this work, we implement and compare three sorting strategies, greedy sorting, non-dominated sorting and even-distributed sorting, to measure multi-fitness in Cooperative Coevolutionary Genetic Algorithms (CCGA) on single-objective optimization problems, where even-distributed sorting is a new sorting algorithm we propose. We assign multi-fitness to individuals by using a new collaboration mechanism, called reference sharing collaboration. Our experimental results show that by using the novel evaluation model, the modified CCGA achieves better performance than standard CCGA even if the simplest sorting strategy is used. And the even-distributed sorting is able to perform more efficient multi-fitness measurement for cooperative coevolutionary algorithms on single-objective optimization problems.