A Novel Hybrid Genetic Algorithm for Unconstrained and Constrained Function Optimization

Abstract

During the past decade, academic and industrial communities are highly interested in evolutionary techniques for solving optimization problems. Genetic Algorithm (GA) has proved its robustness in solving all most all types of optimization problems. To improve the performance of GA, several modifications have already been done within GA. Recently GA has been hybridized with many other nature-inspired algorithms. As such Bacterial Foraging Optimization (BFO) is popular bio inspired algorithm based on the foraging behavior of E. coli bacteria. Many researchers took active interest in hybridizing GA with BFO. Motivated by such popular hybridization of GA, an attempt has been made in this chapter to hybridize GA with BFO in a novel fashion. The Chemo-taxis step of BFO plays a major role in BFO. So an attempt has been made to hybridize Chemo-tactic step with GA cycle and the algorithm is named as Chemo-inspired Genetic Algorithm (CGA). It has been applied on benchmark functions and real life application problem to prove its efficacy.

A review on genetic algorithm: past, present, and future

“…The other metaheuristic techniques can be used with GA to resolve this problem. Hybrid GAs have been used to solve the issues mentioned in the preceding subsections [29,137,186].…”