Preliminary experiments with the Andean Condor Algorithm to solve problems of Continuous Domains
Global Change Science, Viña del Mar, Chile
- Published
- Accepted
- Subject Areas
- Adaptive and Self-Organizing Systems, Algorithms and Analysis of Algorithms, Artificial Intelligence, Autonomous Systems, Optimization Theory and Computation
- Keywords
- Andean Condor Algorithm, Continuous Domains, Nature-inspired algorithms, Metaheuristic, Evolutionary Algorithm, Swarm Intelligence
- Copyright
- © 2019 Almonacid
- Licence
- This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Preprints) and either DOI or URL of the article must be cited.
- Cite this article
- 2019. Preliminary experiments with the Andean Condor Algorithm to solve problems of Continuous Domains. PeerJ Preprints 7:e27678v1 https://doi.org/10.7287/peerj.preprints.27678v1
Abstract
In this article a preliminary experiment is carried out in which a set of elements and procedures are described to be able to solve problems of continuous domains integrated in the Andean Condor Algorithm. The Andean Condor Algorithm is a metaheuristic algorithm of swarm intelligence inspired by the movement pattern of the Andean condor when searching for its food. An experiment focused on solving the problem of the function 1st De Jong's \(f(x_1 \cdots x_n) = \sum_{i=1}^n x_i^2,~ -100 \leq x_i \leq 100\). According to the results obtained, solutions have been obtained close to the overall optimum value of the problem.
Author Comment
This is a preprint submission to PeerJ Preprints.