Improved simple optimization (SOPT) algorithm for unconstrained non-linear optimization problems

SummaryIn the recent years, population based meta-heuristic are developed to solve non-linear optimization problems. These problems are difficult to solve using traditional methods. Simple optimization (SOPT) algorithm is one of the simple and efficient meta-heuristic techniques to solve the non-linear optimization problems. In this paper, SOPT is compared with some of the well-known meta-heuristic techniques viz. Artificial Bee Colony algorithm (ABC), Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Differential Evolutions (DE). For comparison, SOPT algorithm is coded in MATLAB and 25 standard test functions for unconstrained optimization having different characteristics are run for 30 times each. The results of experiments are compared with previously reported results of other algorithms. Promising and comparable results are obtained for most of the test problems. To improve the performance of SOPT, an improvement in the algorithm is proposed which helps it to come out of local optima when algorithm gets trapped in it. In almost all the test problems, improved SOPT is able to get the actual solution at least once in 30 runs