Using Multi-Objective Bat Algorithm for Solving Multi-Objective Non-linear Programming Problem
Human beings are greatly inspired by nature. Nature has the ability to solve very complex problems in its own distinctive way. The problems around us are becoming more and more complex in the real time and at the same instance our mother nature is guiding us to solve these natural problems. Nature gives some of the logical and effective ways to find solutions to these problems. Nature acts as an optimized source for solving the complex problems. Decomposition is a basic strategy in traditional multi-objective optimization. However, it has not yet been widely used in multi-objective evolutionary optimization.
Although computational strategies for taking care of Multi-objective Optimization Problems (MOPs) have been accessible for a long time, the ongoing utilization of Evolutionary Algorithm (EAs) to such issues gives a vehicle to tackle extremely enormous scope MOPs.
MOBATD is a multi-objective bat algorithm that incorporates the dominance concept with the decomposition approach. Whilst decomposition simplifies the MOP by rewriting it as a set of Tchebycheff Approach, solving these problems simultaneously, within the BAT framework, might lead to premature convergence because of the leader selection process which uses the Tchebycheff Approach as a criterion. Dominance plays a major role in building the leaders archive, allowing the selected leaders to cover less dense regions while avoiding local optima and resulting in a more diverse approximated Pareto front. The results from 5 standard MOPs show that the MOBATD outperforms some developmental methods based on decomposition. All the results were achieved by MATLAB (R2017b).