Projectiles Optimization: A Novel Metaheuristic Algorithm For Global Optimization

Metaheuristic optimization algorithms are a relatively new class of optimization algorithms that are widely used for difficult optimization problems in which classic methods cannot be applied and are considered as known and very broad methods for crucial optimization problems. in this study, a new metaheuristic optimization algorithm is presented, the main idea of which is inspired by models in kinematics. this algorithm obtains better results compared to other optimization algorithms in this field and is able to explore new paths in its search for desirable points. hence, after introducing the projectiles optimization (pro) algorithm, in the first experiment, it is evaluated by the determined test functions of the ieee congress on evolutionary computation (cec) and compared with the known and powerful algorithms of this field. in the second try out, the performance of the pro algorithm is measured in two practical applications, one for the training of the multi-layer perceptron (mlp) neural networks and the other for pattern recognition by gaussian mixture modeling (gmm). the results of these comparisons are presented in various tables and figures. based on the presented results, the accuracy and performance of the pro algorithm are much higher than other existing methods