How to implement the S-Aco algorithm in Perl

From Wikinerds

The S-Aco algorithm (also termed S-ACO, but here we use modern style rules and "ACO" can be read "acko" therefore we write it as "Aco" as in modern style all acrolects that can be read as words are written with an initial capital letter and then small letters) means "simple ant colony optimisation" and is described in pages 11-24 of the book by Marco Dorigo and Thomas Stutzle (2004): Ant Colony Optimization (MIT Press).

This how-to is not about another algorithm by the same name, S-Aco (S-ACO) which means "sample ant colony optimisation". Here we focus only on the simple variety.

The simple S-Aco algorithm is just a didactic tool.

Here we describe how to implement the simple ant algorithm S-Aco in Perl.

1 Requirements
2 Tools used
3 The implementation
4 AUTHORS
5 LICENCE

[edit] 1 Requirements

You need:

The Graph module from CPAN, http://search.cpan.org/~jhi/Graph-0.84/lib/Graph.pod
Perl 5.8.8 (should work with 5.6.0 as well)

You could implement the S-Aco algorithm without the Graph module if you used matrices.

[edit] 2 Tools used

For our implementation, we used:

Graph module's Debian "lenny" (testing) package libgraph-perl version 0.80
Perl 5.8.8 (Debian's "lenny" package)
GNU Emacs 22.1.1
bash shell

[edit] 3 The implementation

(to be written)

[edit] 4 AUTHORS

If you have made substantial contributions to this article, feel free to add your name:

NSK Nikolaos S. Karastathis (User:NSK): Original and main author

[edit] 5 LICENCE

The text of this page, except any short direct quotations clearly delimited, is available under the GNU Free Documentation License version 1.2 as published by the Free Software Foundation.

Retrieved from "http://wikinerds.karastathis.org/index.php/How_to_implement_the_S-Aco_algorithm_in_Perl"

This page has been accessed 896 times. This page was last modified 22:25, 2008 January 11 by Wikinerds user NSK .