No Free Lunch Theorem for Optimization No Free Lunch Theorem for Optimization According to No Free Lunch Theorem "There is no universal better algorithm exist that can solve all types of optimization problems". Today, Metaheuristic Optimization Algorithms are used in different areas to solve complex real work optimization problems. For example in Industrial Areas, Operation Research, Medical Field, Engineering design and other as you can see below: History of Metaheuristic Optimization Algorithms: Genetic Algorithms (G.A.) - 1960's - 1970's Simulated Annealing (S.A.) - 1983 Tabu Search (T.S.) - 1986 Ant Colony Optimization Algorithm - 1992 Particle Swarm Optimization Algorithm - 1995 Differential Evolution (D.E.) -1997 Harmony Search (H.S.) - 2001 Honey Bee Algorithm (H.B.A.) - 2004 Artificial Bee Colony (A.B.C.) - 2005 ... Battle Royal Optimization Algorithm (B.R.O.A.) - 2020 In 1997, D.H. Wolpher and W. G. Macready published No Free Lunch Theorem for optimization.
