When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems
Artificial Intelligence Review
A study of ACO capabilities for solving the maximum clique problem
Journal of Heuristics
Distributed constraint satisfaction, restricted recombination, and genetic protocols
Applied Soft Computing
An ant algorithm for static and dynamic MAX-SAT problems
Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems
Computational Optimization and Applications
Ants can solve the team orienteering problem
Computers and Industrial Engineering
Integration of ACO in a Constraint Programming Language
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Solving the Attribute Reduction Problem with Ant Colony Optimization
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Advances in Engineering Software
Managing Diversity on an AIS That Solves 3-Colouring Problems
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
A New Strategy Based on GRASP to Solve a Macro Mine Planning
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
An ant colony optimization approach for the multidimensional knapsack problem
Journal of Heuristics
An improved ant colony optimisation algorithm for the 2D HP protein folding problem
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Searching for maximum cliques with ant colony optimization
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Ant colony optimization with adaptive fitness function for satisfiability testing
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
DFS-tree based heuristic search
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
NAIS: a calibrated immune inspired algorithm to solve binary constraint satisfaction problems
ICARIS'07 Proceedings of the 6th international conference on Artificial immune systems
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Information Sciences: an International Journal
Ant colony optimization-based algorithm for airline crew scheduling problem
Expert Systems with Applications: An International Journal
Solving the attribute reduction problem with ant colony optimization
Transactions on rough sets XIII
Car sequencing with constraint-based ACO
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Heuristic techniques for variable and value ordering in CSPs
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Comparing the performance of evolutionary algorithms for permutation constraint satisfaction
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Evolutionary computation approaches to the Curriculum Sequencing problem
Natural Computing: an international journal
The power of ants in solving Distributed Constraint Satisfaction Problems
Applied Soft Computing
A hybrid discrete particle swarm algorithm for hard binary CSPs
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
An enhanced heuristic searching algorithm for complicated constrained optimization problems
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Higher order pheromone models in ant colony optimisation
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
A hybrid particle swarm optimization for binary CSPs
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Miner ants colony: a new approach to solve a mine planning problem
IDA'05 Proceedings of the 6th international conference on Advances in Intelligent Data Analysis
The biologically inspired distributed file system: an emergent thinker instantiation
Self-star Properties in Complex Information Systems
Strong combination of ant colony optimization with constraint programming optimization
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Are state-of-the-art fine-tuning algorithms able to detect a dummy parameter?
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Hi-index | 0.00 |
We describe a novel 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