An Interactive Simple Indicator-Based Evolutionary Algorithm (I-SIBEA) for Multiobjective Optimization Problems

被引:21
|
作者
Chugh, Tinkle [1 ]
Sindhya, Karthik [1 ]
Hakanen, Jussi [1 ]
Miettinen, Kaisa [1 ]
机构
[1] Univ Jyvaskyla, Dept Math Informat Technol, FI-40014 Jyvaskyla, Finland
关键词
D O I
10.1007/978-3-319-15934-8_19
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a new preference based interactive evolutionary algorithm (I-SIBEA) for solving multiobjective optimization problems using weighted hypervolume. Here the decision maker iteratively provides her/his preference information in the form of identifying preferred and/or non-preferred solutions from a set of nondominated solutions. This preference information provided by the decision maker is used to assign weights of the weighted hypervolume calculation to solutions in subsequent generations. In any generation, the weighted hypervolume is calculated and solutions are selected to the next generation based on their contribution to the weighted hypervolume. The algorithm is compared with a recently developed interactive evolutionary algorithm, W-Hype on some benchmark multiobjective optimization problems. The results show significant promise in the use of the I-SIBEA algorithm. In addition, the performance of the algorithm is demonstrated using a human decision maker to show its flexibility towards changes in the preference information. The I-SIBEA algorithm is found to flexibly exploit the preference information from the decision maker and generate solutions in the regions preferable to her/him.
引用
收藏
页码:277 / 291
页数:15
相关论文
共 50 条
  • [41] Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems
    Wang, Yong
    Cai, Zixing
    Guo, Guanqi
    Zhou, Yuren
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2007, 37 (03): : 560 - 575
  • [42] An improved indicator-based two-archive algorithm for many-objective optimization problems
    Song, Weida
    Zhang, Shanxin
    Ge, Wenlong
    Wang, Wei
    COMPUTING, 2024, 106 (05) : 1395 - 1429
  • [43] An Indicator-Based Many-Objective Evolutionary Algorithm With Boundary Protection
    Liang, Zhengping
    Luo, Tingting
    Hu, Kaifeng
    Ma, Xiaoliang
    Zhu, Zexuan
    IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (09) : 4553 - 4566
  • [44] Improved Lebesgue Indicator-Based Evolutionary Algorithm: Reducing Hypervolume Computations
    Zapotecas-Martinez, Saul
    Garcia-Najera, Abel
    Menchaca-Mendez, Adriana
    MATHEMATICS, 2022, 10 (01)
  • [45] An improved indicator-based two-archive algorithm for many-objective optimization problems
    Weida Song
    Shanxin Zhang
    Wenlong Ge
    Wei Wang
    Computing, 2024, 106 : 1395 - 1429
  • [46] An Indicator-Based Firefly Algorithm for Many-Objective Optimization
    Liao, Futao
    Zhang, Shaowei
    Xiao, Dong
    Wang, Hui
    Zhang, Hai
    ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, PT II, ICIC 2024, 2024, 14863 : 231 - 244
  • [47] Multiobjective evolutionary algorithm for dynamic nonlinear constrained optimization problems
    Liu Chun’an1
    2. School of Computer Engineering and Technology
    JournalofSystemsEngineeringandElectronics, 2009, 20 (01) : 204 - 210
  • [48] Multiobjective evolutionary algorithm for dynamic nonlinear constrained optimization problems
    Liu Chun'an
    Wang Yuping
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2009, 20 (01) : 204 - 210
  • [49] A Novel Evolutionary Algorithm for Dynamic Constrained Multiobjective Optimization Problems
    Chen, Qingda
    Ding, Jinliang
    Yang, Shengxiang
    Chai, Tianyou
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (04) : 792 - 806
  • [50] A Preliminary Study of Adaptive Indicator based Evolutionary Algorithm for Dynamic Multiobjective Optimization via Autoencoding
    Zhou, Wei
    Feng, Liang
    Jiang, Siwei
    Zhang, Shu
    Hou, Yaqing
    Ong, Yew-Soon
    Zhu, Zexuan
    Liu, Kai
    2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 796 - 802