ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

A Multiobjective Evolutionary Algorithm Based on Objective-Space Localization Selection

Zhou, Yuren; Chen, Zefeng*; Huang, Zhengxin; Xiang, Yi南阳理工学院; 中山大学
IEEE Transactions on Cybernetics2022-5DOI: 10.1109/TCYB.2020.3016426
5被引11阅读
引用收藏
分享

摘要

This article proposes a simple yet effective multiobjective evolutionary algorithm (EA) for dealing with problems with irregular Pareto front. The proposed algorithm does not need to deal with the issues of predefining weight vectors and calculating indicators in the search process. It is mainly based on the thought of adaptively selecting multiple promising search directions according to crowdedness information in local objective spaces. Concretely, the proposed algorithm attempts to dynamically delete an individual of poor quality until enough individuals survive into the next generation. In this environmental selection process, the proposed algorithm considers two or three individuals in the most crowded area, which is determined by the local information in objective space, according to a probability selection mechanism, and deletes the worst of them from the current population. Thus, these surviving individuals are representative of promising search directions. The performance of the proposed algorithm is verified and compared with seven state-of-the-art algorithms [including four general multi/many-objective EAs and three algorithms specially designed for dealing with problems with irregular Pareto-optimal front (PF)] on a variety of complicated problems with different numbers of objectives ranging from 2 to 15. Empirical results demonstrate that the proposed algorithm has a strong competitiveness power in terms of both the performance and the algorithm compactness, and it can well deal with different types of problems with irregular PF and problems with different numbers of objectives.

学科与关键词

关键词
SociologyStatisticsEvolutionary computationOptimizationHeuristic algorithmsSearch problemsComputer scienceEvolutionary algorithm (EA)irregular Pareto frontmultiobjective optimizationprojection
相关
加载中…
  • A Survey of Evolutionary Algorithms for Multi-Objective Optimization Problems With Irregular Pareto Fronts
    Hua, Yicun; Liu, Qiqi; Hao, Kuangrong; Jin, Yaochu*IEEE/CAA Journal of Automatica Sinica, 2021, 8(2): 303-318.被引 161
  • A Many-Objective Evolutionary Algorithm With Pareto-Adaptive Reference Points
    Xiang, Yi; Zhou, Yuren*; Yang, Xiaowei; Huang, HanIEEE Transactions on Evolutionary Computation, 2020, 24(1): 99-113.被引 59
  • An Evolutionary Algorithm for Multi and Many-Objective Optimization With Adaptive Mating and Environmental Selection
    Palakonda, Vikas; Mallipeddi, Rammohan*IEEE Access, 2020, 8: 82781-82796.被引 17
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Cybernetics
发表日期
2022-05
卷期
第 52 卷, 第 5 期
页码
3888-3901
DOI
10.1109/TCYB.2020.3016426
语言
ENGLISH
期刊等级
1区
成果收录
SCIE
资助标注
National Natural Science Foundation of China [61773410, 61673403]; Science and Technology Program of Guangzhou [202002030355]; Fundamental Research Funds for the Central Universities [2019MS088]

作者

  • Z

    Zhou, Yuren (第一作者)

    sun yat sen univ

  • C

    Chen, Zefeng (通讯)

    nanyang technol univ

查看全部 4 位作者收起作者
  • H

    Huang, Zhengxin

    youjiang med univ nationalities

  • X

    Xiang, Yi

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417