A Branch and Bound Based on NSGAII Algorithm for Multi-Objective Mixed Integer Non Linear Optimization Problems
Abstract
Multi-Objective Mixed-Integer Non-Linear Programming problems (MO-MINLPs) appear in several real-world applications, especially in the mechanical engineering field. To determine a good approximated Pareto front for this type of problems, we propose a general hybrid approach based on a Multi-Criteria Branch-and-Bound (MCBB) and Non-dominated Sorting Genetic Algorithm 2 (NSGAII). We present a computational experiment based on a statistical assessment to compare the performance of the proposed algorithm (BnB-NSGAII) with NSGAII using well-known metrics from literature. We propose a new metric, Investment Ratio (IR), that relate the quality of the solution to the consumed effort. We consider five real-world mechanical engineering problems and two mathematical ones to be used as test problems in this experiment. Experimental results indicate that BnB-NSGAII could be a competitive alternative for solving MO-MINLPs.
Cite
@article{arxiv.2012.00115,
title = {A Branch and Bound Based on NSGAII Algorithm for Multi-Objective Mixed Integer Non Linear Optimization Problems},
author = {Ahmed Jaber and Pascal Lafon and Rafic Younes},
journal= {arXiv preprint arXiv:2012.00115},
year = {2021}
}
Comments
This article has been submitted for publication in Engineering Optimization Journal, published by Taylor & Francis. The article contains 28 pages, 13 figures, and 5 tables