Ananya Algorithm: A Simple and New Optimization Algorithm for Engineering Optimization

Abstract

Optimization is the act of making the best or most effective use of a situation or resource. It involves maximizing or minimizing a mathematical function. A new and simple metaheuristic optimization algorithm is developed and proposed in this paper as Ananya Algorithm. Simplicity is the beauty of the proposed algorithm. Ananya algorithm is one of the simplest optimization algorithms to implement, among all optimization techniques. This algorithm has only two candidates hence it avoids large calculations. This algorithm moves towards a better solution with the difference between the mean of variables and the best variable. This algorithm works on simple calculations and does not involve any complicated calculations. This algorithm is tested for thirty unconstrained benchmark functions like sphere function, Beale function, Goldstein-Price function, Booth Function, Matyas Function, and convergence graph shown for the same. Every time this algorithm got successful to achieve an optimum solution. It takes a little CPU time to optimize. Ananya algorithm is compared to particle swarm optimization (PSO) and genetic algorithm (GA). It required lesser mean functional evaluation to achieve an optimal solution, hence the Ananya algorithm has better performance than the two algorithms.