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...

Descripción completa

Detalles Bibliográficos
Autores principales: Guan, Boxin, Zhao, Yuhai, Li, Yuan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2019
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515295/
https://www.ncbi.nlm.nih.gov/pubmed/33267479
http://dx.doi.org/10.3390/e21080766

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7515295/
https://www.ncbi.nlm.nih.gov/pubmed/33267479
http://dx.doi.org/10.3390/e21080766

Ejemplares similares