Clustering-Aided Grid-Based One-to-One Selection-Driven Evolutionary Algorithm for Multi/Many-Objective Optimization

被引:7
作者
Palakonda, Vikas [1 ]
Kang, Jae-Mo [1 ]
Jung, Heechul [1 ]
机构
[1] Kyungpook Natl Univ, Dept Artificial Intelligence, Daegu 41566, South Korea
基金
新加坡国家研究基金会;
关键词
Optimization; Statistics; Sociology; Convergence; Clustering algorithms; Evolutionary computation; Benchmark testing; Optimization methods; Nearest neighbor methods; diversity; multi-objective optimization; many-objective optimization; K-means clustering; grid settings; DECOMPOSITION; CONVERGENCE; DIVERSITY; MOEA/D;
D O I
10.1109/ACCESS.2024.3398415
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multiobjective evolutionary algorithms are highly effective in solving multiobjective optimization problems (MOPs). The selection strategy, involving mating and environmental selection, is crucial in shaping these algorithms. However, when applied to many-objective optimization (MaOPs) with more than three objectives, existing methods face challenges due to reduced selection pressure and issues in maintaining diversity, making them less efficient. To address these challenges, we present a novel approach in this paper: the clustering-aided grid-based one-to-one selection-driven evolutionary algorithm (ClGrMOEA), designed to handle both MOPs and MaOPs effectively. The proposed ClGrMOEA introduces a hybrid approach that combines clustering-based mating selection with grid-based one-to-one environmental selection to balance convergence and diversity in MOPs and MaOPs. The mating selection employs K-means clustering to partition the objective space and utilizes a convergence indicator based on Euclidean distance to select promising solutions for offspring generation. The environmental selection combines Pareto dominance with grid-based one-to-one selection, using grid coordinate point distance to select promising solutions. An external archive based on Pareto dominance and crowding distance preserves elite individuals. Extensive experiments are conducted on 19 benchmark problems and 16 real-world problems to validate the superior performance of ClGrMOEA compared to seven state-of-the-art algorithms. The experimental results demonstrate that ClGrMOEA significantly outperforms these benchmark algorithms.
引用
收藏
页码:120612 / 120623
页数:12
相关论文
共 44 条
[1]  
[Anonymous], 2001, SPEA2: Improving the Strength Pareto Evolutionary Algorithm
[2]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[3]   An External Archive Guided Multiobjective Evolutionary Algorithm Based on Decomposition for Combinatorial Optimization [J].
Cai, Xinye ;
Li, Yexing ;
Fan, Zhun ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (04) :508-523
[4]   A genetic algorithm based approach to solve multi-resource multi-objective knapsack problem for vegetable wholesalers in fuzzy environment [J].
Changdar, Chiranjit ;
Pal, Rajat Kumar ;
Mahapatra, Ghanshaym Singha ;
Khan, Abhinandan .
OPERATIONAL RESEARCH, 2020, 20 (03) :1321-1352
[5]   Multi-objective approach to the optimization of shape and envelope in building energy design [J].
Ciardiello, Adriana ;
Rosso, Federica ;
Dell'Olmo, Jacopo ;
Ciancio, Virgilio ;
Ferrero, Marco ;
Salata, Ferdinando .
APPLIED ENERGY, 2020, 280
[6]  
Coello C. A. C., 2007, Multi objective Optimization
[7]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[8]  
Deb K., 1995, Complex Systems, V9, P115
[9]  
Deb K., 1996, COMPUTER SCI INFORMA, V26, P30, DOI DOI 10.1007/978-3-662-03423-127
[10]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601