A new metaphor-less optimization algorithm for synthesis of mechanisms.

This paper proposes a novel metaphor-less optimization algorithm which makes use of maximum and minimum values obtained in the current candidate group and their interaction, hence it is named as max–min-greedy-interaction (MaGI) algorithm. The algorithm begins with the candidate group initialization and identification of maximum and minimum values of candidates. These values are utilized during updation and greedy interaction among the candidates. The proposed algorithm is also applied to synthesize four-bar linkage for prescribed path. It is reported that the MaGI performs better in comparison with the contemporary and well-established algorithms. The algorithm's effectiveness and performance have been validated on three unimodal unconstrained functions (for exploitation ability), three constrained, and three non-trivial mechanism problems (for exploration ability) which makes the algorithm acceptable and reliable for varied applications. [ABSTRACT FROM AUTHOR]