Abstract

In order to improve the performance of optimization, we apply a hybridization of adaptive biogeography-based optimization (BBO) algorithm and differential evolution (DE) to multi-objective optimization problems (MOPs). A model of multi-objective evolutionary algorithms (MOEAs) is established, in which the habitat suitability index (HSI) is redefined, based on the Pareto dominance relation, and density information among the habitat individuals. Then, we design a new algorithm, in which the modification probability and mutation probability are changed, according to the relation between the cost of fitness function of randomly selected habitats of last generation, and average cost of fitness function of all habitats of last generation. The mutation operators based on DE algorithm, are modified, and the migration operators based on number of iterations, are improved to achieve better convergence performance. Numerical experiments on different ZDT and DTLZ benchmark functions are performed, and the results demonstrate that the proposed MABBO algorithm has better performance on the convergence and the distribution properties comparing to the other MOEAs, and can solve more complex multi-objective optimization problems efficiently.

Highlights

  • Biogeography-based optimization (BBO) algorithm (Simon, 2008) [1] is proposed based on the mechanism for biological species migrating from one place to another

  • The results demonstrate that the proposed MABBO algorithm has better performance on the convergence and the distribution

  • We compare our approach with the results obtained by five other multi-objective evolutionary algorithms (MOEAs) (NSGA-II [49], RM-MEDA [50], MOTLBO [51], HMOEA [52] and BBMO [53]); 2-objective and 3-objective test problems [54] were run with different variable numbers

Read more

Summary

Introduction

Biogeography-based optimization (BBO) algorithm (Simon, 2008) [1] is proposed based on the mechanism for biological species migrating from one place to another. As a population-based stochastic algorithm, BBO algorithm generates the generation population by simulating the migration of the biological species. Two main operators in BBO algorithm are the migration and mutation. Migration operation is based on the emigration rate and immigration rate of each individual in the population. Mutation operation is performed by mutation probability. BBO algorithm has some advantages due to information sharing in the migration process, especially for single-objective optimization problems (SOPs) [2,3,4,5]. BBO algorithm can be used to solve multi-objective benchmark problems [6,7]

Objectives
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.