A new CSP graph-based representation for Ant Colony Optimization

Constraint Satisfaction Problems (CSP) have been widely studied in several research areas like Artificial Intelligence or Operational Research due their complexity and industrial interest. From previous research areas, heuristic (informed) search methods have been particularly active looking for feasible approaches. One of the critical problems to work with CSP is related to the exponential growth of computational resources needed to solve even the simplest problems. This paper presents a new efficient CSP graph-based representation to solve CSP by using Ant Colony Optimization (ACO) algorithms. This paper presents also a new heuristic (called Oblivion Rate), that have been designed to improve the current state-of-the-art in the application of ACO algorithms on these domains. The presented graph construction provides a strong reduction in both, the number of connections and the number of nodes needed to model the CSP. Also, the new heuristic is used to reduce the number of pheromones in the system (allowing to solve problems with an increasing complexity). This new approach has been tested, as case study, using the classical N-Queens Problem. Experimental results show how the new approach works in both, reducing the complexity of the resulting CSP graph and solving problems with increasing complexity through the utilization of the Oblivion Rate.

[1]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[2]  John Fulcher,et al.  Computational Intelligence: An Introduction , 2008, Computational Intelligence: A Compendium.

[3]  A. E. Eiben,et al.  Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill? , 2005, 2005 IEEE Congress on Evolutionary Computation.

[4]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[5]  Kamran Zamanifar,et al.  The power of ants in solving Distributed Constraint Satisfaction Problems , 2012, Appl. Soft Comput..

[6]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[7]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[8]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[9]  Thomas Bäck,et al.  Evolutionary computation: Toward a new philosophy of machine intelligence , 1997, Complex..

[10]  Ajith Abraham,et al.  Bacterial Foraging Optimization Algorithm: Theoretical Foundations, Analysis, and Applications , 2009, Foundations of Computational Intelligence.

[11]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[12]  Christine Solnon,et al.  Ants can solve constraint satisfaction problems , 2002, IEEE Trans. Evol. Comput..

[13]  Christian Blum,et al.  Swarm Intelligence: Introduction and Applications , 2008, Swarm Intelligence.

[14]  P.-P. Grasse.  La reconstruction du nid et les coordinations interindividuelles chezBellicositermes natalensis etCubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs , 1959, Insectes Sociaux.

[15]  Juan Julián Merelo Guervós,et al.  Solving Master Mind Using GAs and Simulated Annealing: A Case of Dynamic Constraint Optimization , 1996, PPSN.

[16]  Craig W. Reynolds.  Flocks, herds, and schools: a distributed behavioral model , 1987, SIGGRAPH.

[17]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[18]  Mohsin Bilal,et al.  Solution of n-Queen problem using ACO , 2009, 2009 IEEE 13th International Multitopic Conference.

[19]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[20]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[21]  Xin-She Yang,et al.  Engineering Optimizations via Nature-Inspired Virtual Bee Algorithms , 2005, IWINAC.