Biogeography-Based Multi-Objective Discrete Optimization with Constraints

Biogeography-based optimization (BBO) is an intelligent evolutionary algorithm based on biological populations, increasing the optimization search ability by adaptive migration operation. However, the original BBO is only feasible for continuous optimization with single-objective optimization, instead of more complex optimization problems, such as discrete and multi-objective optimization problems. Therefore, in this article, we propose the improved BBO algorithm to solve multi-objective discrete optimization problem with multiple constraints. We define the decision matrix, objective vector to fit variables and objective functions of the multi-objective discrete optimization problem, and define the ideal point and utility function so that different candidate solutions can be judged according to a metric. We propose similarity threshold, repeatability threshold, cost threshold, and stagnation threshold to make the proposed algorithm improve the diversity of search solutions and give consideration to convergence. Moreover, we conduct a case study on the NP-hard problem of composite functions, and the experimental results verify the effectiveness and efficiency of our approach.

Authors

Institutions

Publication Details

Journal
Journal of Computational Biology
Published
2025-06-16
DOI
https://doi.org/10.1089/cmb.2024.0931
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Biogeography-Based Multi-Objective Discrete Optimization with Constraints

Chenyan Wang, Bo Hu, Xiangyu Qu, Leyi Hu et al.
Journal of Computational Biology
Advanced Multi-Objective Optimization Algorithms
article

Biogeography-Based Multi-Objective Discrete Optimization with Constraints

Chenyan Wang, Bo Hu, Xiangyu Qu, Leyi Hu, Xuan Liu, Jieyao Wei
article en

Abstract

Biogeography-based optimization (BBO) is an intelligent evolutionary algorithm based on biological populations, increasing the optimization search ability by adaptive migration operation. However, the original BBO is only feasible for continuous optimization with single-objective optimization, instead of more complex optimization problems, such as discrete and multi-objective optimization problems. Therefore, in this article, we propose the improved BBO algorithm to solve multi-objective discrete optimization problem with multiple constraints. We define the decision matrix, objective vector to fit variables and objective functions of the multi-objective discrete optimization problem, and define the ideal point and utility function so that different candidate solutions can be judged according to a metric. We propose similarity threshold, repeatability threshold, cost threshold, and stagnation threshold to make the proposed algorithm improve the diversity of search solutions and give consideration to convergence. Moreover, we conduct a case study on the NP-hard problem of composite functions, and the experimental results verify the effectiveness and efficiency of our approach.

Journal of Computational BiologyVol. 32(9)
Minzu University of China (CN), Hainan University (CN)
Openalex Percentile: Top 85%
Advanced Multi-Objective Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.