Learning and focusing strategies to improve ACO that solves CSP
Authors:
- Nicolás Rojas-MoralesNRNicolás Rojas-Morales
- María-Cristina RiffMRMaría-Cristina Riff
- Bertrand NeveuBNBertrand Neveu
- 1 October 2021
- journal article
- research article
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 105
Abstract
No abstract availableKeywords
Funding Information
- Universidad Técnica Federico Santa María (PI_LII_2020_8, 1200126)
- Fondo Nacional de Desarrollo Científico y Tecnológico (PI_LII_2020_8, 1200126)
This publication has 23 references indexed in Scilit:
- Combining CSP and MPC for the operational control of water networksEngineering Applications of Artificial Intelligence, 2016
- Constraint satisfaction problem based on flow graph to study the resilience of inland navigation networks in a climate change context**This work is a contribution to GEPET-Eau project which is granted by the French ministry MEDDE-GICC, ORNERC and the DGTIM. http://gepeteau.wordpress.com/enversion/.IFAC-PapersOnLine, 2016
- MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and AntColonyIEEE Transactions on Cybernetics, 2013
- The power of ants in solving Distributed Constraint Satisfaction ProblemsApplied Soft Computing, 2012
- Partially constrained ant colony optimization algorithm for the solution of constrained optimization problems: Application to storm water network designAdvances in Water Resources, 2007
- When Ants Attack: Ant Algorithms for Constraint Satisfaction ProblemsArtificial Intelligence Review, 2005
- Ants can solve constraint satisfaction problemsIEEE Transactions on Evolutionary Computation, 2002
- – Ant SystemFuture Generation Computer Systems, 2000
- Ant-Based Load Balancing in Telecommunications NetworksAdaptive Behavior, 1997
- Distributed constrained heuristic searchIEEE Transactions on Systems, Man, and Cybernetics, 1991