CACO : Competitive Ant Colony Optimization, A Nature-Inspired Metaheuristic For Large-Scale Global Optimization

2013/12/14 by El-Dosuky, M. A.
#FOS: Computer and information sciences #Neural and Evolutionary Computing (cs.NE)

paper · doi:10.48550/arxiv.1312.4044

Abstract

Large-scale problems are nonlinear problems that need metaheuristics, or global optimization algorithms. This paper reviews nature-inspired metaheuristics, then it introduces a framework named Competitive Ant Colony Optimization inspired by the chemical communications among insects. Then a case study is presented to investigate the proposed framework for large-scale global optimization.

Related

• Ant Algorithms for Discrete Optimization
• Evolution of Ant Colony Optimization Algorithm -- A Brief Literature Review
• Accelerating the ANT Colony Optimization By Smart ANTs, Using Genetic Operator
• Applications of Nature-Inspired Metaheuristic Algorithms for Tackling Optimization Problems Across Disciplines
• Herder Ants: Ant Colony Optimization with Aphids for Discrete Event-Triggered Dynamic Optimization Problems