Ant-colony algorithm with a strengthened negative-feedback mechanism for constraint-satisfaction problems

Describing the definition and usage of negative feedback in ant colony optimization.Proposing a new negative pheromone matrix and combined with positive pheromone matrix in probability formula.A novel strengthening negative feedback mechanism is proposed to improve efficiency and avoid local optimal.Detail experiment design has been given for evaluating the proposed approaches based on different standard real datasets and synthetically generated datasets. Ant Colony Optimization (ACO) is an efficient way to solve binary constraint-satisfaction problems (CSPs). In recent years, new improvements have only considered enhancing the positive feedback to increase the convergence speed. However, through the study and analysis of these enhanced ACO algorithms, we determined that they still suffer from the problem of easily getting in locally optimal solutions. Thus, an improved ACO algorithm with a strengthened negative-feedback mechanism is designed to tackle CSPs. This new algorithm takes advantage of search-history information and continually obtains failure experience to guide the ant swarm exploring the unknown space during the optimization process. The starting point of this algorithm is to utilize the negative feedback to improve the diversity of solutions. Finally, we use 24 CSP samples and 25 Queen samples to perform experiments, compare this algorithm with other related algorithms and conduct performance assessment. The preliminary results show that ACO with negative feedback outperforms the compared algorithms in identifying high-quality solutions.

[1]  Mihaela Breaban,et al.  A new PSO approach to constraint satisfaction , 2007, 2007 IEEE Congress on Evolutionary Computation.

[2]  Giovanni Iacca,et al.  Multi-Strategy coevolving aging Particle Optimization , 2014, Int. J. Neural Syst..

[3]  Ke Xu,et al.  Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..

[4]  Alan M. Frieze,et al.  Analyzing Walksat on Random Formulas , 2011, ANALCO.

[5]  Pinar Çivicioglu,et al.  Backtracking Search Optimization Algorithm for numerical optimization problems , 2013, Appl. Math. Comput..

[6]  Eli Ben-Sasson,et al.  Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs , 2007, SIAM J. Comput..

[7]  Yun Fan,et al.  On the phase transitions of random k-constraint satisfaction problems , 2011, Artif. Intell..

[8]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[9]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[10]  Derek G. Bridge,et al.  When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems , 2005, Artificial Intelligence Review.

[11]  Ferrante Neri,et al.  Towards Artificial Speech Therapy: A Neural System for Impaired Speech Segmentation , 2016, Int. J. Neural Syst..

[12]  Iván García-Magariño,et al.  Modular design of a hybrid genetic algorithm for a flexible job-shop scheduling problem , 2011, Knowl. Based Syst..

[13]  Toby Walsh,et al.  Random Constraint Satisfaction: Theory Meets Practice , 1998, CP.

[14]  Ferrante Neri,et al.  An Optimization Spiking Neural P System for Approximately Solving Combinatorial Optimization Problems , 2014, Int. J. Neural Syst..

[15]  Teresa Bernarda Ludermir,et al.  Many Objective Particle Swarm Optimization , 2016, Inf. Sci..

[16]  Kenneth O. Stanley,et al.  Exploiting Open-Endedness to Solve Problems Through the Search for Novelty , 2008, ALIFE.

[17]  Narasimhan Sundararajan,et al.  Dynamic mentoring and self-regulation based particle swarm optimization algorithm for solving complex real-world optimization problems , 2016, Inf. Sci..

[18]  Anuraganand Sharma,et al.  Analysis of evolutionary operators for ICHEA in solving constraint optimization problems , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[19]  Malek Mouhoub,et al.  A New Approach to Constraint Weight Learning for Variable Ordering in CSPs , 2013, ArXiv.

[20]  Ponnuthurai N. Suganthan,et al.  A decremental stochastic fractal differential evolution for global numerical optimization , 2016, Inf. Sci..

[21]  Kazunori Mizuno,et al.  Solving Constraint Satisfaction Problems by ACO with Cunning Ants , 2011, 2011 International Conference on Technologies and Applications of Artificial Intelligence.

[22]  Wei Xu,et al.  Performances of pure random walk algorithms on constraint satisfaction problems with growing domains , 2015, Journal of Combinatorial Optimization.

[23]  Mihaela Breaban,et al.  Incorporating Inference into Evolutionary Algorithms for Max-CSP , 2006, Hybrid Metaheuristics.

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

[25]  Liang Gao,et al.  Backtracking Search Algorithm with three constraint handling methods for constrained optimization problems , 2015, Expert Syst. Appl..

[26]  Mihaela Breaban,et al.  A New Scheme of Using Inference Inside Evolutionary Computation Techniques to Solve CSPs , 2006, 2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[27]  Shengxiang Yang,et al.  Ant colony optimization with self-adaptive evaporation rate in dynamic environments , 2014, 2014 IEEE Symposium on Computational Intelligence in Dynamic and Uncertain Environments (CIDUE).

[28]  Urszula Boryczka,et al.  Collective data mining in the ant colony decision tree approach , 2016, Inf. Sci..

[29]  Antonio González-Pardo,et al.  A new CSP graph-based representation for Ant Colony Optimization , 2013, 2013 IEEE Congress on Evolutionary Computation.