Multi-objective Optimization Using BFO Algorithm

This paper describes a novel bacterial foraging optimization (BFO) approach to multi-objective optimization, called Multi-objective Bacterial Foraging Optimization (MBFO). The search for Pareto optimal set of multi-objective optimization problems is implemented. Compared with the proposed algorithm MOPSO and NSGAII, simulation results (measured by Diversity and Generational Distance metric) on test problems show that the proposed MBFO is able to find a much better spread of solutions and faster convergence to the true Pareto-optimal front. It suggests that the proposed MBFO is very promising in dealing with multi-objective optimization problems.