A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems
Authors:
- 5 April 2021
- journal article
- research article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 54 (6) , 1004-1022
Abstract
Solving Multi-Objective Mixed Integer NonLinear Programming (MO-MINLP) problems is a point of interest for many researchers as they appear in several real-world applications, especially in the mechanical engineering field. Many researchers have proposed using hybrids of metaheuristics with mono-objective branch and bound. Others have suggested using heuristics with Multi-Criteria Branch and Bound (MCBB). A general hybrid approach is proposed based on MCBB and Non-dominated Sorting Genetic Algorithm 2 (NSGAII) to enhance the approximated Pareto front of MO-MINLP problems. A computational experiment based on statistical assessment is presented to compare the performance of the proposed algorithm (BnB-NSGAII) with NSGAII using well-known metrics from the literature. To evaluate the computational efficiency, a new metric, the Investment Ratio (IR), is proposed that relates the quality of solution to the consumed effort. Experimental results on five real-world mechanical engineering problems and two mathematical ones indicate that BnB-NSGAII could be a competitive alternative for solving MO-MINLP problems.Keywords
Funding Information
- Lebanese University (LU)
- regional council of the ‘Grand Est’
- European Development Fund
This publication has 33 references indexed in Scilit:
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPsEuropean Journal of Operational Research, 2017
- Exploration and exploitation in evolutionary algorithmsACM Computing Surveys, 2013
- Hybrid metaheuristics in combinatorial optimization: A surveyApplied Soft Computing, 2011
- Direct Multisearch for Multiobjective OptimizationSIAM Journal on Optimization, 2011
- Mesh adaptive direct search algorithms for mixed variable optimizationOptimization Letters, 2008
- Hybridizations of Metaheuristics With Branch & Bound Derivates2008
- Embedding Branch and Bound within Evolutionary AlgorithmsApplied Intelligence, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Solving Vehicle Routing Problems Using Constraint Programming and MetaheuristicsJournal of Heuristics, 2000
- Mechanical Component Design for Multiple Ojectives Using Elitist Non-dominated Sorting GA2000