An Ant Colony Optimization Based on Information Entropy for Constraint Satisfaction Problems

Solving the constraint satisfaction problem (CSP) is to find an assignment of values to variables that satisfies a set of constraints. Ant colony optimization (ACO) is an efficient algorithm for solving CSPs. However, the existing ACO-based algorithms suffer from the constructed assignment with high cost. To improve the solution quality of ACO for solving CSPs, an ant colony optimization based on information entropy (ACOE) is proposed in this paper. The proposed algorithm can automatically call a crossover-based local search according to real-time information entropy. We first describe ACOE for solving CSPs and show how it constructs assignments. Then, we use a ranking-based strategy to update the pheromone, which weights the pheromone according to the rank of these ants. Furthermore, we introduce the crossover-based local search that uses a crossover operation to optimize the current best assignment. Finally, we compare ACOE with seven algorithms on binary CSPs. The experimental results revealed that our method outperformed the other compared algorithms in terms of the cost comparison, data distribution, convergence performance, and hypothesis test.

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

[2]  Milan Tuba,et al.  Performance of Elephant Herding Optimization and Tree Growth Algorithm Adapted for Node Localization in Wireless Sensor Networks , 2019, Sensors.

[3]  Jano I. van Hemert,et al.  Comparing evolutionary algorithms on binary constraint satisfaction problems , 2003, IEEE Trans. Evol. Comput..

[4]  Kazunori Mizuno,et al.  Experimental Evaluation of Artificial Bee Colony with Greedy Scouts for Constraint Satisfaction Problems , 2013, 2013 Conference on Technologies and Applications of Artificial Intelligence.

[5]  Lionel Levine,et al.  Interpolating between random walk and rotor walk , 2016, Random Struct. Algorithms.

[6]  Xiaojie Liu,et al.  Ant-colony algorithm with a strengthened negative-feedback mechanism for constraint-satisfaction problems , 2017, Inf. Sci..

[7]  B. Naudts,et al.  Swarm intelligence on the binary constraint satisfaction problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

[9]  Ling Xu,et al.  Study on a Novel Fault Damage Degree Identification Method Using High-Order Differential Mathematical Morphology Gradient Spectrum Entropy , 2018, Entropy.

[10]  Wu Deng,et al.  An Improved Ant Colony Optimization Algorithm Based on Hybrid Strategies for Scheduling Problem , 2019, IEEE Access.

[11]  Hailong Wang,et al.  Modified Backtracking Search Optimization Algorithm Inspired by Simulated Annealing for Constrained Engineering Optimization Problems , 2018, Comput. Intell. Neurosci..

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

[13]  Qin Zhang,et al.  An improved ant colony optimization algorithm with strengthened pheromone updating mechanism for constraint satisfaction problem , 2017, Neural Computing and Applications.

[14]  Bo Li,et al.  Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment , 2017, Applied Soft Computing.

[15]  Milan Tuba,et al.  Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Optimization Problem with Entropy Diversity Constraint , 2014, TheScientificWorldJournal.

[16]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

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

[18]  Xuetao Wei,et al.  Finding the most influential product under distribution constraints through dominance tests , 2018, Applied Intelligence.

[19]  Barnaby Martin,et al.  Discrete Temporal Constraint Satisfaction Problems , 2018, J. ACM.

[20]  Bo Li,et al.  Study on an airport gate assignment method based on improved ACO algorithm , 2018, Kybernetes.

[21]  Deo Prakash Vidyarthi,et al.  Improved auto control ant colony optimization using lazy ant approach for grid scheduling problem , 2016, Future Gener. Comput. Syst..

[22]  Zhanshan Li,et al.  A Novel Strategy of Combining Variable Ordering Heuristics for Constraint Satisfaction Problems , 2018, IEEE Access.

[23]  João P. S. Catalão,et al.  A Multi-Objective Optimization Approach to Risk-Constrained Energy and Reserve Procurement Using Demand Response , 2018, IEEE Transactions on Power Systems.

[24]  Hongjie Fu.  A Hybrid Differential Evolution Algorithm for Binary CSPs , 2010 .

[25]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

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

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

[28]  Javier Del Ser,et al.  Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems , 2017, Appl. Soft Comput..

[29]  Wu Deng,et al.  A Novel Fault Diagnosis Method Based on Integrating Empirical Wavelet Transform and Fuzzy Entropy for Motor Bearing , 2018, IEEE Access.

[30]  Jean-Jacques E. Slotine,et al.  Solving Constraint-Satisfaction Problems with Distributed Neocortical-Like Neuronal Networks , 2018, Neural Computation.

[31]  J. Christopher Beck,et al.  Mixed-Integer and Constraint Programming Techniques for Mobile Robot Task Planning , 2016, IEEE Robotics and Automation Letters.