.png){kind=icon}
Return
Ants can solve constraint satisfaction problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2002.802449.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to use artificial ants to keep track of promising areas of the search space by laying trails of pheromone. This pheromone information is used to guide the search, as a heuristic for choosing values to be assigned to variables. We first describe the basic ACO algorithm for solving CSPs and we show how it can be improved by combining it with local search techniques. Then, we introduce a preprocessing step, the goal of which is to favor a larger exploration of the search space at a lower cost, and we show that it allows ants to find better solutions faster. Finally, we evaluate our approach on random binary problems.
Keywords:
ant colony optimization (ACO)
constraint satisfaction problems (CSPs)
local search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12
Papers:
1.9K
Citations:
2.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveMINIMIZING CONFLICTS - A HEURISTIC REPAIR METHOD FOR CONSTRAINT SATISFACTION AND SCHEDULING PROBLEMS
OAAI
OAAIShareSave
ShareSave
View more