An Improved MOEA/D with an Auction-Based Matching Mechanism

被引:0
|
作者
Li, Guangjian [1 ]
Zheng, Mingfa [2 ]
He, Guangjun [1 ]
Mei, Yu [2 ]
Sun, Gaoji [3 ]
Zhong, Haitao [2 ]
机构
[1] Air Force Engn Univ, Air Def & Antimissile Sch, Xian 710051, Peoples R China
[2] Air Force Engn Univ, Fundamentals Dept, Xian 710051, Peoples R China
[3] Zhejiang Normal Univ, Coll Econ & Management, Jinhua 321004, Peoples R China
关键词
MOEA/D; multi-objective optimization problem; auction theory; weight vectors adjustment; 68 Computer Science; 90 Operations research; mathematical programming; MULTIOBJECTIVE EVOLUTIONARY ALGORITHM; DECOMPOSITION; OPTIMIZATION; DIVERSITY; SELECTION; SEARCH;
D O I
10.3390/axioms13090644
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Multi-objective optimization problems (MOPs) constitute a vital component in the field of mathematical optimization and operations research. The multi-objective evolutionary algorithm based on decomposition (MOEA/D) decomposes a MOP into a set of single-objective subproblems and approximates the true Pareto front (PF) by optimizing these subproblems in a collaborative manner. However, most existing MOEA/Ds maintain population diversity by limiting the replacement region or scale, which come at the cost of decreasing convergence. To better balance convergence and diversity, we introduce auction theory into algorithm design and propose an auction-based matching (ABM) mechanism to coordinate the replacement procedure in MOEA/D. In the ABM mechanism, each subproblem can be associated with its preferred individual in a competitive manner by simulating the auction process in economic activities. The integration of ABM into MOEA/D forms the proposed MOEA/D-ABM. Furthermore, to make the appropriate distribution of weight vectors, a modified adjustment strategy is utilized to adaptively adjust the weight vectors during the evolution process, where the trigger timing is determined by the convergence activity of the population. Finally, MOEA/D-ABM is compared with six state-of-the-art multi-objective evolutionary algorithms (MOEAs) on some benchmark problems with two to ten objectives. The experimental results show the competitiveness of MOEA/D-ABM in the performance of diversity and convergence. They also demonstrate that the use of the ABM mechanism can greatly improve the convergence rate of the algorithm.
引用
收藏
页数:33
相关论文
共 50 条
  • [21] MOEA/D-AMS: Improving MOEA/D by an Adaptive Mating Selection Mechanism
    Chiang, Tsung-Che
    Lai, Yung-Pin
    2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, : 1473 - 1480
  • [22] Cooperative ARQ via Auction-Based Spectrum Leasing
    Stanojev, Igor
    Simeone, Osvaldo
    Spagnolini, Umberto
    Bar-Ness, Yeheskel
    Pickholtz, Raymond L.
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (06) : 1843 - 1856
  • [23] Auction-Based Pricing Schemes for Distributed Partner Selection in Cooperative Wireless Networks
    Ma, Bo
    Ge, Jianhua
    Han, Weiliang
    Li, Jing
    WIRELESS PERSONAL COMMUNICATIONS, 2017, 96 (01) : 265 - 290
  • [24] An auction-based airport slot reallocation scheme considering the grandfather rights of airlines
    Lee, Heeyeon
    Jung, Jihyeok
    Lee, Deok-Joo
    JOURNAL OF AIR TRANSPORT MANAGEMENT, 2024, 118
  • [25] MOEA/D with a self-adaptive weight vector adjustment strategy based on chain segmentation
    Dong, Zhiming
    Wang, Xianpeng
    Tang, Lixin
    INFORMATION SCIENCES, 2020, 521 : 209 - 230
  • [26] Welding robot path planning problem based on discrete MOEA/D with hybrid environment selection
    Zhou, Xin
    Wang, Xuewu
    Gu, Xingsheng
    NEURAL COMPUTING & APPLICATIONS, 2021, 33 (19) : 12881 - 12903
  • [27] An Auction-Based Bid Prediction Mechanism for Fog-Cloud Offloading Using Q-Learning
    Besharati, Reza
    Rezvani, Mohammad Hossein
    Sadeghi, Mohammad Mehdi Gilanian
    COMPLEXITY, 2023, 2023
  • [28] A hybrid algorithm based on MOEA/D and local search for multiobjective optimization
    Leung, Man-Fai
    Ng, Sin-Chun
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [29] RAIM: A Reverse Auction-Based Incentive Mechanism for Mobile Data Offloading Through Opportunistic Mobile Networks
    Zhou, Huan
    Wu, Tong
    Chen, Xin
    He, Shibo
    Wu, Jie
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2022, 9 (06): : 3909 - 3921
  • [30] An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
    Fan, Zhun
    Li, Wenji
    Cai, Xinye
    Huang, Han
    Fang, Yi
    You, Yugen
    Mo, Jiajie
    Wei, Caimin
    Goodman, Erik
    SOFT COMPUTING, 2019, 23 (23) : 12491 - 12510