JSAI2021

Presentation information

Organized Session

Organized Session » OS-13

[2E1-OS-13a] AIと制約プログラミング(1/3)

Wed. Jun 9, 2021 9:00 AM - 10:40 AM Room E (OS room 3)

座長:宋 剛秀(神戸大学)

9:20 AM - 9:40 AM

[2E1-OS-13a-02] Ant Population with Dynamic Adjustable Pheromone Accumulation for Constraint Satisfaction Problems

〇Takaaki Toya1, Kazunori Mizuno1, Syoutarou Koike1 (1. Takushoku University)

Keywords:Ant colony optimization, Swarm intelligence, Constraint satisfaction problem

To solve large-scale and hard constraint satisfaction problems (CSPs), many meta-heuristics have been studied.
Although Ant colony optimization (ACO) has been effective for solving CSPs using pheromone trails in constructing candidate solutions, search efficiency may sometimes reduce depending on how pheromones accumulate.
In this paper, we propose an ACO based method which can dynamically adjust several pheromone accumulations.
In our method, after dividing into multiple ant populations with different pheromone accumulation, the search, or constructing candidate solutions and pheromone update, is conducted at each population. In addition, the size of each population is adjusted during the search.
We demonstrate that our method can solve large-scale and hard graph coloring problems, which is one of CSPs, more efficiently than the previous methods.

Authentication for paper PDF access

A password is required to view paper PDFs. If you are a registered participant, please log on the site from Participant Log In.
You could view the PDF with entering the PDF viewing password bellow.

Password