Name
Title | ||
|---|---|---|
Refining a Pheromone Trail Graph by Negative Feedback for Constraint Satisfaction Problems |
Abstract | ||
|---|---|---|
Ant colony optimization, ACO, has been effective meta-heuristics to solve large-scale and hard constraint satisfaction problems, CSPs. However, most of ACO based algorithms have sometimes been inefficient due to the even amount of accumulated pheromone corresponding to the best assignment. In this paper, we have proposed an ACO based model that can adjust the amount of accumulated pheromone by taking account of another pheromone derived by the worst assignment, enabling to refine the usual pheromone trail graph. We also have applied the proposed model to the cunning ant system and demonstrated how effective the propose model can be to solve hard instances of the graph coloring problem that is one of CSPs. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/TAAI48200.2019.8959905 | 2019 International Conference on Technologies and Applications of Artificial Intelligence (TAAI) |
Keywords | DocType | ISSN |
constraint satisfaction,search,meta heuristics,ant colony optimization,graph coloring,phase transition | Conference | 2376-6816 |
ISBN | Citations | PageRank |
978-1-7281-4667-6 | 1 | 0.37 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takuya Masukane | 1 | 2 | 1.14 |
| Kazunori Mizuno | 2 | 42 | 10.55 |