Optimization Algorithm Toolkit (OAT) / News: Recent posts

OAT Release 1.4

WE HAVE AN EXPERIMENTER GUI!

This is a huge release of OAT including a major restructuring of the API, bug fixes everywhere, and an all new (and beta) experimenter API and graphical user interface. To note in the new experimenter are the standard statistical hypothesis tests for normality and comparison of algorithm results.

Posted by Jason Brownlee 2007-09-10

OAT Release 1.3

Finally, a new release of OAT, the general purpose optimization and machine learning work bench in Java. This release includes many framework and Graphical interface fixes, as well as a few new algorithms to play with.

Posted by Jason Brownlee 2007-07-14

optalgtoolkit 1.2

OAT is a workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and much more.

Added graph coloring problem, binary character recognition, and binary trap function problem domains. Added many algorithm implementations as well as a ton of bug fixes to the core framework.

Posted by Jason Brownlee 2007-01-06

Release 1.1

The Optimization Algorithm Toolkit (OAT) is a workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and much more.

This release is focused on the core framework and testing rather than on adding algorithms and problems. As such, the software is a lot more mature in this release. Fixed bugs and added many feature requests.

Posted by Jason Brownlee 2006-12-04

Initial Public Release 1.0

The first version of the Optimization Algorithm Toolkit (OAT) software has been released with both offline (download) and online (applet) versions.

This release includes 4 different benchmark problem domains including:

* Function Optimization (56 instances, 18 algorithms)
* Huygens Probe Benchmark Suite (fractal function optimization)
* Travelling Salesman Problem TSP (15 instances, 10 algorithms)
* Protein Folding HP Model (14 instances, 1 algorithm)

Posted by Jason Brownlee 2006-11-27