An Ant Colony Optimization Based on Information Entropy for Constraint Satisfaction Problems
AbstractSolving 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. View Full-Text
Share & Cite This Article
Guan, B.; Zhao, Y.; Li, Y. An Ant Colony Optimization Based on Information Entropy for Constraint Satisfaction Problems. Entropy 2019, 21, 766.
Guan B, Zhao Y, Li Y. An Ant Colony Optimization Based on Information Entropy for Constraint Satisfaction Problems. Entropy. 2019; 21(8):766.Chicago/Turabian Style
Guan, Boxin; Zhao, Yuhai; Li, Yuan. 2019. "An Ant Colony Optimization Based on Information Entropy for Constraint Satisfaction Problems." Entropy 21, no. 8: 766.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.