This study suggests a novel cooperative multi-simplex algorithm that generalizes a local search optimizer to design a novel global search heuristic algorithm. The proposed algorithm exploits the vertex sharing strategy to enhance the search abilities of the working simplexes. The vertex sharing among the simplexes is carried out through cooperative step that is based on fitness of the underlying simplex. The proposed algorithm is applied to solve some systems of nonlinear equations by transforming them to optimization problems. Comparative analysis of results shows that the proposed method is practical and effective.
Keywords:
Subject: Computer Science and Mathematics - Data Structures, Algorithms and Complexity
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.