Proximity ranking-based multimodal differential evolution

被引:16
|
作者
Zhang, Junna [1 ,2 ]
Chen, Degang [1 ,2 ]
Yang, Qiang [3 ]
Wang, Yiqiao [4 ]
Liu, Dong [1 ,2 ]
Jeon, Sang-Woon [5 ]
Zhang, Jun [5 ]
机构
[1] Henan Normal Univ, Coll Comp & Informat Engn, Xinxiang, Peoples R China
[2] Key Lab Artificial Intelligence & Personalized Lea, Xinxiang, Peoples R China
[3] Nanjing Univ Informat Sci & Technol, Sch Artificial Intelligence, Nanjing, Peoples R China
[4] Beijing Univ Chinese Med, Sch Management, Beijing, Peoples R China
[5] Hanyang Univ, Dept Elect & Elect Engn, Ansan, South Korea
基金
中国国家自然科学基金; 新加坡国家研究基金会;
关键词
Differential evolution; Multimodal optimization problems; Proximity ranking based individual selection; Multimodal differential evolution; Adaptive local search; MULTIOBJECTIVE OPTIMIZATION; GENETIC ALGORITHM; SWARM OPTIMIZER; MUTATION; STRATEGIES; POPULATION; ENSEMBLE; SEARCH;
D O I
10.1016/j.swevo.2023.101277
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multimodal optimization aiming at locating multiple global optima at a time has received extensive attention from researchers since it can afford multiple choices for decision-makers. To effectively locate as many optima of multimodal optimization problems (MMOPs) as possible, this paper proposes a novel differential evolution framework, named proximity ranking-based multimodal differential evolution (PRMDE). Firstly, a proximity ranking-based individual selection method is proposed to randomly select parent individuals involved in the mutation operation. Specifically, instead of the classical uniform selection, this paper devises a non-linear weight function to calculate the selection probabilities of individuals according to their proximity rankings and then randomly selects parent individuals based on the roulette wheel selection strategy. In this way, each individual is likely mutated by its Euclidian neighbors. Secondly, an adaptive parameter adjustment strategy is further devised for the selection probability calculation, so that the selection probabilities of closer individuals to each target individual gradually increase as the evolution continues. Thirdly, an adaptive local search strategy is designed to carry out the Gaussian distribution based local search adaptively around individuals. In this way, better in-dividuals have higher chances to conduct local search to subtly improve their quality. By means of the cohesive cooperation among the three main mechanisms, PRMDE is expectedly capable of simultaneously locating mul-tiple optima of MMOPs. Theoretically, any mutation strategy can be embedded into PRMDE to deal with MMOPs. Four classical mutation strategies are adopted in this paper to instantiate PRMDE. Experiments carried out on the publicly acknowledged CEC2013 benchmark MMOP set demonstrate that PRMDE is effective to solve MMOPs and attains considerably competitive or even far better optimization performance than several representative and state-of-the-art multimodal optimization methods.
引用
收藏
页数:21
相关论文
共 50 条
  • [31] Implementing Ranking-Based Semantics in ConArg
    Bistarelli, Stefano
    Faloci, Francesco
    Taticchi, Carlo
    [J]. 2019 IEEE 31ST INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2019), 2019, : 1180 - 1187
  • [32] Ranking-based evaluation of regression models
    Rosset, S
    Perlich, C
    Zadrozny, B
    [J]. Fifth IEEE International Conference on Data Mining, Proceedings, 2005, : 370 - 377
  • [33] A Ranking-based approach for Hierarchical Classification
    Naik, Azad
    Rangwala, Huzefa
    [J]. PROCEEDINGS OF THE 2015 IEEE INTERNATIONAL CONFERENCE ON DATA SCIENCE AND ADVANCED ANALYTICS (IEEE DSAA 2015), 2015, : 1062 - 1071
  • [34] Ranking-based instance selection for pattern classification
    Cavalcanti, George D. C.
    Soares, Rodolfo J. O.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2020, 150
  • [35] Projective Ranking-Based GNN Evasion Attacks
    Zhang, He
    Yuan, Xingliang
    Zhou, Chuan
    Pan, Shirui
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (08) : 8402 - 8416
  • [36] Ranking-Based Semantics from the Perspective of Claims
    Bistarelli, Stefano
    Dvorak, Wolfgang
    Taticchi, Carlo
    Woltran, Stefan
    [J]. COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020), 2020, 326 : 111 - 122
  • [37] Ranking-Based Semantics for Sets of Attacking Arguments
    Yun, Bruno
    Vesic, Srdjan
    Croitoru, Madalina
    [J]. THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 3033 - 3040
  • [38] On the Characteristics of Ranking-based Gender Bias Measures
    Klasnja, Anja
    Arabzadeh, Negar
    Mehrvarz, Mahbod
    Bagheri, Ebrahim
    [J]. PROCEEDINGS OF THE 14TH ACM WEB SCIENCE CONFERENCE, WEBSCI 2022, 2022, : 245 - 249
  • [39] Viewpoints Using Ranking-Based Argumentation Semantics
    Yun, Bruno
    Vesic, Srdjan
    Croitoru, Madalina
    Bisquert, Pierre
    [J]. COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2018), 2018, 305 : 381 - 392
  • [40] Ranking-Based Black-Box Complexity
    Doerr, Benjamin
    Winzen, Carola
    [J]. ALGORITHMICA, 2014, 68 (03) : 571 - 609