GECO

Genetic Evolution through Combination of Objects

Introduction

GECO is George P.W. Williams' CLOS-based toolkit for writing genetic algorithms. It is a fairly flexible framework that can be used for experimentation and for the solution of a variety of problems. Documentation is available, and it includes two simple examples.

Version 2.01 has been tested on CMUCL and SBCL.

News

April 2, 2006

Version 2.01 released. Changes: added an ASDF system definition file, and removed the minimal traces of bitrot. The examples work.

Nov. 29, 1993

Version 2.0 released.

Documentation

A paper describing the framework can be found in the CMU AI Achive. The .ps file seems to be damaged, you might have to convert to a pdf file to see more than the first page. You can download it here.

Download

The last release geco-2.01.tar.gz
The original files from the CMU AI repository geco_20.tgz. See also the corresponding GECO page.
Documentation, GECO-v2.0.ps.Z.

Installation

Recommended: using ASDF.

Download the source code and unpack it in the directory where you want to install it.
Make a symbolic link for in your central registry to the .asd file of GECO.
```
ln -s /my/central/registry/geco.asd /path/of/code/geco.asd
```
Start your lisp implementation, and compile (and load) the code:
```
(asdf:operate 'asdf:load-op 'geco)
```

A system definition file is also included.

Development

If you are interested in the development of GECO, and/or have extensions, fixes, additional examples, etc. consider joining the geco-devel mailing list.

Development is tracked using darcs. The latest version of GECO is in the darcs repository at: http://common-lisp.net/project/geco/repos/GECO.

$ darcs get http://common-lisp.net/project/geco/repos/GECO

Help!

If you have problems running GECO, or have found a bug, you can ask at the geco-devel mailing list.