DeepAI AI Chat
Log In Sign Up

The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization

by   Wei-tian Wu, et al.

A hybrid framework combining the branch and bound method with multiobjective evolutionary algorithms is proposed for nonconvex multiobjective optimization. The hybridization exploits the complementary character of the two optimization strategies. A multiobjective evolutionary algorithm is intended for inducing tight lower and upper bounds during the branch and bound procedure. Tight bounds such as the ones derived in this way can reduce the number of subproblems that have to be solved. The branch and bound method guarantees the global convergence of the framework and improves the search capability of the multiobjective evolutionary algorithm. An implementation of the hybrid framework considering NSGA-II and MOEA/D-DE as multiobjective evolutionary algorithms is presented. Numerical experiments verify the hybrid algorithms benefit from synergy of the branch and bound method and multiobjective evolutionary algorithms.


page 1

page 2

page 3

page 4


Group theory, group actions, evolutionary algorithms, and global optimization

In this paper we use group, action and orbit to understand how evolution...

Global optimization for low-dimensional switching linear regression and bounded-error estimation

The paper provides global optimization algorithms for two particularly d...

Hybridization of interval methods and evolutionary algorithms for solving difficult optimization problems

Reliable global optimization is dedicated to finding a global minimum in...

The Sampling-and-Learning Framework: A Statistical View of Evolutionary Algorithms

Evolutionary algorithms (EAs), a large class of general purpose optimiza...

Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms

The fitness level method is a popular tool for analyzing the computation...

Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems

The only rigorous approaches for achieving a numerical proof of optimali...