A tree-structured random walking swarm optimizer for multimodal optimization

被引:11
|
作者
Zhang, Yu-Hui [1 ,2 ]
Gong, Yue-Jiao [2 ]
Yuan, Hua-Qiang [3 ]
Zhang, Jun [2 ]
机构
[1] Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou, Guangdong, Peoples R China
[2] South China Univ Technol, Sch Comp Sci & Technol, Guangdong Prov Key Lab Computat Intelligence & Cy, Guangzhou, Guangdong, Peoples R China
[3] Dongguan Univ Technol, Dongguan, Peoples R China
基金
中国国家自然科学基金;
关键词
Artificial bee colony (ABC); Evolutionary algorithm (EA); Minimum spanning tree (MST); Multimodal optimization; Niching method; BEE COLONY ALGORITHM; DIFFERENTIAL EVOLUTION; GLOBAL OPTIMIZATION; GENETIC ALGORITHM;
D O I
10.1016/j.asoc.2019.02.015
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper develops a novel tree structured random walking swarm optimizer for seeking multiple optima in multimodal landscapes. First, we show that the artificial bee colony algorithm has some distinct advantages over the other swarm intelligence algorithms for accomplishing the multimodal optimization task, from analytical and experimental perspectives. Then, a tree-structured niching strategy is developed to assist the algorithm in exploring multiple optima simultaneously. The strategy constructs a weighted complete graph based on the positions of the food sources (candidate solutions). A minimum spanning tree that encodes the distribution of the food sources is built upon the complete graph to guide the search of the bee swarm. Each artificial bee sets out from a food source and flies along the edges of the tree to gather information about the search space. The dance trajectories of bees are simulated by a random walk model considering both distance and fitness information. Then, mutant vectors are selected from the trajectories to update the food source. This graph-based search method is introduced to simultaneously promote the progress of exploitation and exploration in multimodal environments. Extensive experiments indicate that our proposed algorithm outperforms several state-of-the-art algorithms. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:94 / 108
页数:15
相关论文
共 50 条
  • [1] Bayesian Optimization with Tree-structured Dependencies
    Jenatton, Rodolphe
    Archambeau, Cedric
    Gonzalez, Javier
    Seeger, Matthias
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [2] Optimization techniques for tree-structured nonlinear problems
    Jens Hübner
    Martin Schmidt
    Marc C. Steinbach
    Computational Management Science, 2020, 17 : 409 - 436
  • [3] Optimization techniques for tree-structured nonlinear problems
    Huebner, Jens
    Schmidt, Martin
    Steinbach, Marc C.
    COMPUTATIONAL MANAGEMENT SCIENCE, 2020, 17 (03) : 409 - 436
  • [4] Image segmentation by tree-structured Markov random fields
    Poggi, G
    Ragozini, ARP
    IEEE SIGNAL PROCESSING LETTERS, 1999, 6 (07) : 155 - 157
  • [5] Tree-structured conditional random fields for semantic annotation
    Tang, Jie
    Hong, Mingcai
    Li, Juanzi
    Liang, Bangyong
    SEMANTIC WEB - ISEC 2006, PROCEEDINGS, 2006, 4273 : 640 - 653
  • [6] Learning Tree-structured Approximations for Conditional Random Fields
    Skurikhin, Alexei N.
    2014 IEEE APPLIED IMAGERY PATTERN RECOGNITION WORKSHOP (AIPR), 2014,
  • [7] Multi-objective particle swarm optimization algorithm based on tree-structured unbounded archive
    Ji C.-M.
    Ma H.-Y.
    Li N.-N.
    Wu J.-J.
    Peng Y.
    Wang L.-P.
    Kongzhi yu Juece/Control and Decision, 2020, 35 (11): : 2675 - 2686
  • [8] Multimodal function optimization using an improved swarm optimizer
    Jiao, Weidong
    Yang, Shixi
    Chang, Yongping
    Yan, Gongbiao
    Jixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering, 2008, 44 (09): : 113 - 116
  • [9] Robust Optimization for Tree-Structured Stochastic Network Design
    Wu, Xiaojian
    Kumar, Akshat
    Sheldon, Daniel
    Zilberstein, Shlomo
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 4545 - 4551
  • [10] TREE-STRUCTURED PROGRAMS
    WEGNER, E
    COMMUNICATIONS OF THE ACM, 1973, 16 (11) : 704 - 705