Maintaining the diversity of solutions by non-geometric binary crossover: a worst one-max solver competition case study

ABSTRACT

The worst one-max solver competition task in GECCO 2007 was to develop a one-max solver that can find the optimal solution of the 15-bit one-max problem as late as possible within 1000 generations. There are two conflicting issues in developing such a one-max solver. One is to slow down the evolution of solutions toward the optimal solution (i.e., not to find the optimal solution in early generations). The other is to find the optimal solution in a very late generation. In this paper, we examine the effect of using a non-geometric binary crossover operator through computational experiments on the worst one-max solver competition task.

REFERENCES

• 1: Hisao Ishibuchi , Yusuke Nojima , Noritaka Tsukamoto , Ken Ohara, Effects of the use of non-geometric binary crossover on evolutionary multiobjective optimization, Proceedings of the 9th annual conference on Genetic and evolutionary computation, July 07-11, 2007, London, England [doi>10.1145/1276958.1277122]
• 2: Moraglio, A., and Poli, P. Topological interpretation of crossover. Proc. GECCO 2004, pp. 1377--1388.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search

General Terms:
Algorithms

Keywords:
binary crossover, diversity maintenance, genetic algorithms, non-geometric crossover