|
|
 |
Public Software
- Software package: ACOTSP.V1.0.tar.gz
Author: Thomas Stützle
Short description: This software package provides an implementation of various Ant Colony Optimization (ACO) algorithms applied to the symmetric Traveling Salesman Problem (TSP). The ACO algorithms implemented are Ant System, Elitist Ant System, MAX-MIN Ant System, Rank-based version of Ant System, Best-Worst Ant System, and Ant Colony System.
Aim of the software: Provide an implementation of ACO algorithms for the symmetric TSP under one common framework. The implementation is reasonably high performing.
License: GPL
Programming language: Developed in ANSI C under Linux (no guarantees that it works nicely under Windows; however, some limited tests showed that the code also works fine under Windows and Mac OS X).
Comment: This is Version 1.0 of ACOTSP; it is in large part identical to the software used to produce the results in the book Ant Colony Optimization by Marco Dorigo and Thomas Stüzle, MIT Press, Cambridge, MA, USA, 2004. It has been slightly re-structured, adapted to make the code more readable, some more comments were added, and a new command line parser was generated with Opag, Version 0.6.4.
- Software package: antnet-1.1-src.tar
Author: Muddassar Farooq
Short description: An implementation of AntNet in Omnet++.
License: GPL
Programming language: Developed in Omnet++.
Comment: The model implements the AntNet routing algorithm proposed in: G. Di Caro and M. Dorigo. AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research, 9:317-365, 1998. It reqires OMNeT++ 2.3 or later.
- Software package: hc-mmas-ubqp.tar.gz
Author: Christian Blum
Short description: A MAX-MIN Ant System (MMAS) implemented in the Hyper-Cube Framework for the application to Unconstrained Binary Quadratic Programming (UBQP).
Aim of the software: Educational (not high-performance); it shows how to implement a MMAS in the Hyper-Cube Framework.
License: GPL
Programming language: Developed in C++ under Linux (no guarantees that it works under Windows).
Comment: A description of the implemented algorithm can be found in the paper The Hyper-Cube Framework for Ant Colony Optimization, which is published in IEEE Transactions on Systems, Man, and Cybernetics -- Part B.
- Software package: GUIAnt-Miner.zip
Author: Fernando Meyer and Rafael Stubs Parpinelli
Short description: GUI Ant-Miner is a tool for extracting classification rules from data.
It is an updated version of a data mining algorithm called Ant-Miner (Ant Colony-based Data Miner), which was proposed in 2002 by Parpinelli, Lopes
and Freitas. GUI Ant-Miner differs from the original algorithm as follows: It has a friendly graphical user interface, makes possible the use of ant
populations within the Ant Colony Optimization (ACO) concept, data input file is standardized with the well-known Weka system, and runs on
virtually any operating system since it is written in Java.
Aim of the software: This software is freely available for research and teaching (not a high-performance code).
License: GPL
Programming language: Java.
Comment: For further information concerning Ant-Miner and principles involved with it, please refer to: Parpinelli, R.S., Lopes, H.S., Freitas, A.A.
"Data mining with an ant colony optimization algorithm". IEEE Transactions on Evolutionary Computation, special issue on Ant Colony Algorithms, v. 6, n. 4, p. 321-332, August, 2002.
|
|
|
