A knowledge guided bacterial foraging optimization algorithm for many-objective optimization problems

被引:0
|
作者
Cuicui Yang
Yannan Weng
Junzhong Ji
Tongxuan Wu
机构
[1] Beijing University of Technology,Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology, College of Computer Science, Faculty of Information Technology
来源
关键词
Many-objective optimization problems; Bacterial foraging optimization; Consensus directions; Orthogonal nearest neighbor; Elite knowledge;
D O I
暂无
中图分类号
学科分类号
摘要
Despite that evolutionary and swarm intelligence algorithms have achieved considerable success on multi-objective optimization problems, they face huge challenges when dealing with many-objective optimization problems (MaOPs). There is an urgent call for effective evolutionary and swarm intelligence algorithms for MaOPs. Inspired by the satisfactory performance of bacterial foraging optimization (BFO) on the single-objective optimization problems, this paper extends BFO to deal with MaOPs and proposes a knowledge guided BFO for MaOPs (called as KLBFO). Firstly, KLBFO learns promising direction knowledge based on group decision making idea to guide the population to converge toward proper directions. Secondly, KLBFO learns elite knowledge by a new biological mechanism to accelerate the population to converge. Thirdly, KLBFO learns density knowledge by a new diversity management strategy based on orthogonal grid to produce well-distributed solutions. The performance of KLBFO is comprehensively evaluated by comparing it with eight state-of-the-art algorithms on two suites of test problems and one real-world problem. The empirical results have validated the superior performance of KLBFO for MaOPs.
引用
收藏
页码:21275 / 21299
页数:24
相关论文
共 50 条
  • [41] Many-objective optimization with dynamic constraint handling for constrained optimization problems
    Xi Li
    Sanyou Zeng
    Changhe Li
    Jiantao Ma
    Soft Computing, 2017, 21 : 7435 - 7445
  • [42] A new evolutionary algorithm based on contraction method for many-objective optimization problems
    Wang, Y. (ywang@xidian.edu.cn), 1600, Elsevier Inc. (245):
  • [43] A Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems
    Gong, Dunwei
    Sun, Jing
    Miao, Zhuang
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (01) : 47 - 60
  • [44] Adaptive boosting learning evolutionary algorithm for complex many-objective optimization problems
    Hu Z.-Y.
    Li Y.-L.
    Wei Z.-H.
    Yang J.-M.
    Kongzhi yu Juece/Control and Decision, 2022, 37 (11): : 2849 - 2859
  • [46] An adaptive clustering-based evolutionary algorithm for many-objective optimization problems
    Liu, Songbai
    Yu, Qiyuan
    Lin, Qiuzhen
    Tan, Kay Chen
    INFORMATION SCIENCES, 2020, 537 : 261 - 283
  • [47] A Uniform Evolutionary Algorithm Based on Decomposition and Contraction for Many-Objective Optimization Problems
    Dai, Cai
    Wang, Yuping
    Hu, Lijuan
    PROCEEDINGS OF THE 18TH ASIA PACIFIC SYMPOSIUM ON INTELLIGENT AND EVOLUTIONARY SYSTEMS, VOL 2, 2015, : 167 - 177
  • [48] Rank-based multimodal immune algorithm for many-objective optimization problems
    Zhang, Hainan
    Gan, Jianhou
    Zhou, Juxiang
    Gao, Wei
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2024, 133
  • [49] A new evolutionary algorithm based on contraction method for many-objective optimization problems
    Dai Cai
    Wang Yuping
    Ye Miao
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 245 : 191 - 205
  • [50] IGD Indicator-Based Evolutionary Algorithm for Many-Objective Optimization Problems
    Sun, Yanan
    Yen, Gary G.
    Yi, Zhang
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2019, 23 (02) : 173 - 187