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

被引:1
作者
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
相关论文
共 70 条
[1]   An Enhanced Decomposition-Based Evolutionary Algorithm With Adaptive Reference Vectors [J].
Asafuddoula, Md ;
Singh, Hemant Kumar ;
Ray, Tapabrata .
IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (08) :2321-2334
[2]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[3]   Dynamical decomposition and selection based evolutionary algorithm for many-objective optimization [J].
Bao, Qian ;
Wang, Maocai ;
Dai, Guangming ;
Chen, Xiaoyu ;
Song, Zhiming .
APPLIED SOFT COMPUTING, 2023, 141
[4]  
Bertsekas D. P., 1988, Annals of Operations Research, V14, P105, DOI 10.1007/BF02186476
[5]  
Blank Julian, 2019, Evolutionary Multi-Criterion Optimization. 10th International Conference, EMO 2019. Proceedings: Lecture Notes in Computer Science (LNCS 11411), P229, DOI 10.1007/978-3-030-12598-1_19
[6]   The balance between proximity and diversity in multiobjective evolutionary algorithms [J].
Bosman, PAN ;
Thierens, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :174-188
[7]   A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) :773-791
[8]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[9]   A decomposition-based many-objective evolutionary algorithm updating weights when required [J].
de Farias, Lucas R. C. ;
Araujo, Aluizio F. R. .
SWARM AND EVOLUTIONARY COMPUTATION, 2022, 68
[10]   MOEA/D with Uniformly Randomly Adaptive Weights [J].
de Farias, Lucas R. C. ;
Braga, Pedro H. M. ;
Bassani, Hansenclever F. ;
Araujo, Aluizio F. R. .
GECCO'18: PROCEEDINGS OF THE 2018 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2018, :641-648