Heuristic Ant Colony Optimization with Applications in Communication Systems
DOI:
https://doi.org/10.5433/1679-0375.2014v35n1p63Keywords:
Ant Colony Optimization (ACO)Abstract
This work explores the heuristic optimization algorithm based on ant colonies (ACO), deployed on complex optimization problems, aiming to achieve an iterative and feasible method which is able to solve NP and NP-Hard problems related to wireless networks. Furthermore, the convergence and performance of the Ant Colony Optimization algorithm for continuous domains are addressed through dozens of benchmark functions, which in turn, differ on each other regarding the number of dimensions and the difficulty w.r.t. the optimization (number of local optima). Finally, the applicability of the ACO is depicted in an minimum power control problem for CDMA networks.Downloads
Downloads
Published
How to Cite
Issue
Section
License
The Copyright Declaration for articles published in this journal is the author’s right. Since manuscripts are published in an open access Journal, they are free to use, with their own attributions, in educational and non-commercial applications. The Journal has the right to make, in the original document, changes regarding linguistic norms, orthography, and grammar, with the purpose of ensuring the standard norms of the language and the credibility of the Journal. It will, however, respect the writing style of the authors. When necessary, conceptual changes, corrections, or suggestions will be forwarded to the authors. In such cases, the manuscript shall be subjected to a new evaluation after revision. Responsibility for the opinions expressed in the manuscripts lies entirely with the authors.
This journal is licensed with a license Creative Commons Attribution-NonCommercial 4.0 International.
