Ant Algorithms

Ant algorithms are a relatively new method that can be used to identify optimal paths through a graph. This method is described in Chapter 4. Ant algorithms model the movement of ants within an environment and use simulated pheromone to communicate with other ants (the process of stigmergy). The theoretical problem of the Traveling Salesman Problem (or TSP) is used to demonstrate the ant algorithm. The algorithm and application can be found on the CD-ROM at ./software/ch4 .