Cooperative Multi-Simplex Algorithm: An Innovation from Localization to Globalization

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.