Multi-objective Bonobo Optimizer with decomposition method

This is the Matlab code for Multi-objective Bonobo Optimizer (MOBO) with a decomposition method. It is named as MOBO3.

This is the Matlab code for Multi-objective Bonobo Optimizer (MOBO) with a decomposition method. It is named as MOBO3. This can solve only two-objective problems.
Three versions of MOBO were developed,
such as MOBO with grid-index approach (MOBO1), MOBO with non-dominated sorting and crowding distance approach (MOBO2) and MOBO with decomposition technique (MOBO3).
Among these three versions, MOBO2 approach was found to have better performances compared to other two approaches, in general.
This is written for solving unconstrained optimization problems.
However, it can also solve constrained optimization problems with penalty function approaches.

User should write his/her own objective function and modify accordingly.

Modify the common parameters and algorithm-specific parameters as per the needs of the problem.

For details of the MOBO algorithms, kindly refer and cite as mentioned below:
Das, A.K., Nikum, A.K., Krishnan, S.V. et al. Multi-objective Bonobo Optimizer (MOBO): an intelligent heuristic for multi-criteria optimization.
Knowl Inf Syst (2020). https://doi.org/10.1007/s10115-020-01503-x

For any query, please email to: [e-mail]