资 源 简 介
Introduction
libaco is a library which can be used for solving combinatorial optimization problems using the Ant Colony Optimization (ACO) meta-heuristic. The library implements the following variants of ACO algorithms:
Simple Ant System
Elitist Ant System
Rank-Based Ant System
Max-Min Ant System
Ant Colony System
For detailed descriptions of these algorithms take a look at Ant Colony Optimization by Marco Dorigo and Thomas Stuetzle.
The project repository contains the following:
libaco, the library itself.
acotsp, example code applying libaco to the Travelling Salesman Problem.
acotreewidth, example code applying libaco to the problem of finding Tree Decompositions of small width.
acotemplate, a template project including a comma
