Improved cooperative Ant Colony Optimization for the solution of binary combinatorial optimization applications

Use this link to cite
http://hdl.handle.net/2183/36241
Except where otherwise noted, this item's license is described as Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
Collections
- Investigación (FIC) [1617]
Metadata
Show full item recordTitle
Improved cooperative Ant Colony Optimization for the solution of binary combinatorial optimization applicationsDate
2024Citation
Prado-Rodríguez, R., González, P., Banga, J. R., & Doallo, R. (2024). Improved cooperative Ant Colony Optimization for the solution of binary combinatorial optimization applications. Expert Systems, e13554. https://doi.org/10.1111/exsy
Abstract
[Abstract]: Binary combinatorial optimization plays a crucial role in various scientific and engineering fields. While deterministic approaches have traditionally been used to solve these problems, stochastic methods, particularly metaheuristics, have gained popularity in recent years for efficiently handling large problem instances. Ant Colony Optimization (ACO) is among the most successful metaheuristics and is frequently employed in non-binary combinatorial problems due to its adaptability. Although for binary combinatorial problems ACO can suffer from issues such as rapid convergence to local minima, its eminently parallel structure means that it can be exploited to solve large and complex problems also in this field. In order to provide a versatile ACO implementation that achieves competitive results across a wide range of binary combinatorial optimization problems, we introduce a parallel multicolony strategy with an improved cooperation scheme to maintain search diversity. We evaluate our proposal (Binary Parallel Cooperative ACO, BiPCACO) using a comprehensive benchmark framework, showcasing its performance and, most importantly, its flexibility as a successful all-purpose solver for binary combinatorial problems.
Keywords
Ant Colony Optimization
binary combinatorial optimization
metaheuristic
parallel strategies
binary combinatorial optimization
metaheuristic
parallel strategies
Description
Financiado para publicación en acceso aberto: Universidade da Coruña/CISUG
Editor version
Rights
Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)