readme

来自「非常好的进化算法EC 实现平台 可以实现多种算法 GA GP」· 代码 · 共 34 行

+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+

ZeroMin (zeromin): Minimization GA example with Open BEAGLE

Copyright (C) 2003
by  Christian Gagne <[e-mail]>
and Marc Parizeau <[e-mail]>

+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+


Getting started
===============

  Example is compiled in binary 'zeromin'. Usage options is described by
  executing it with command-line argument '-OBusage'. The detailed help can
  also be obtained with argument '-OBhelp'.

Objective
=========

  Find a bit string filled with zeros.

Representation
==============

  Bit strings made of N bits.

Fitness
=======

  Number of ones in the bit string, where the perfect solution has a fitness of 0.