Solving Constraint Satisfaction Problems by ACO with Cunning Ants


To solve large-scale constraint satisfaction problems, CSPs, ant colony optimization, ACO, based meta-heuristics has been used. However, the naive ACO based method is sometimes inefficient because the method may require much search time due to ant's reconstructing candidate solutions. In this paper, we describe an ant colony optimization based meta… (More)


5 Figures and Tables

Slides referencing similar topics