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 条
  • [31] Multi-species particle swarm optimizer for multimodal function optimization
    Iwamatsu, M
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2006, E89D (03): : 1181 - 1187
  • [32] CRYPTANALYSIS OF TREE-STRUCTURED CIPHERS
    MILLAN, W
    DAWSON, EP
    OCONNOR, LJ
    ELECTRONICS LETTERS, 1994, 30 (12) : 941 - 942
  • [33] Tree-Structured Nonlinear Regression
    Chang, Youngjae
    Kim, Hyeonsoo
    KOREAN JOURNAL OF APPLIED STATISTICS, 2011, 24 (05) : 759 - 768
  • [34] Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
    Liang, J. J.
    Qin, A. K.
    Suganthan, Ponnuthurai Nagaratnam
    Baskar, S.
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (03) : 281 - 295
  • [35] Multi-level particle swarm optimizer for multimodal optimization problems
    Pan, Hao
    Yuan, Hui
    Yue, Qiang
    Ouyang, Haibin
    Gu, Fangqing
    Li, Fei
    INFORMATION SCIENCES, 2025, 702
  • [36] Distributed learning particle swarm optimizer for global optimization of multimodal problems
    Geng Zhang
    Yangmin Li
    Yuhui Shi
    Frontiers of Computer Science, 2018, 12 : 122 - 134
  • [37] Diversity Enhanced Particle Swarm Optimizer for Global Optimization of Multimodal Problems
    Zhao, S. Z.
    Suganthan, P. N.
    2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, : 590 - 597
  • [38] Competitive tree-structured dictionaries
    Goodrich, MT
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 494 - 495
  • [39] Tree-Structured Shading Decomposition
    Geng, Chen
    Yu, Hong-Xing
    Zhang, Sharon
    Agrawala, Maneesh
    Wu, Jiajun
    2023 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION, ICCV, 2023, : 488 - 498
  • [40] Tree-Structured Haar Transforms
    Karen Egiazarian
    Jaakko Astola
    Journal of Mathematical Imaging and Vision, 2002, 16 : 269 - 279