This is a small demo that I wrote for my students to demonstrate how ant colony optimization can be applied to find a decent approximation for the traveling salesman problem. The program was created using the Common Lisp compiler from LispWorks.
You can download the program
from http://weitz.de/files/ACO.zip.
You are free to use this software for private or educational purposes. (But you are of course using it at your own risk.) However, redistribution of any kind is not allowed without written permission. If you want to give this program to someone else, point them to the original download location at http://weitz.de/aco/.