|国家预印本平台
首页|基于L支配的高维多目标人工蜂群算法

基于L支配的高维多目标人工蜂群算法

Many objectives Artificial Bee Colony algorithm based on pareto optimization and L-Optimality

中文摘要英文摘要

针对人工蜂群算法尚不能处理高维多目标优化的问题,改进以L支配及为基础的新型适应值评价方式,将高维多目标问题转化成单目标问题,构成基于L支配的高维多目标人工蜂群算法(many objectives artificial bee colony algorithm based on pareto optimization and L-Optimality)。对DTLZ标准测试函数测试,结果表明,本文方法能够收敛至最优非支配前沿,有效解决了高维多目标优化问题,且与MDMOEA方法相比,计算量少、收敛速度快。

onsidering many objectives optimization problems can't be solved by Artificial Bee Colony Algorithm, a many objectives artificial bee colony algorithm based on pareto optimization and L-Optimality has been proposed in this paper. Many objectives optimization problems are transformed into single objective optimization problem by an improved fitness value evaluation method by L-Optimality. The results tested on the standard DTLZ function show that the proposed method can converge to the optimal non-dominated front, compared with the MDMOEA method, and have the less calculation and fast convergence speed. Many objectives optimization problems have been solved effectively.

毕晓君

计算技术、计算机技术

人工蜂群算法高维多目标优化问题harmonic距离

rtificial Bee Colony AlgorithmMany Objectives optimization problemsharmonic distance

毕晓君.基于L支配的高维多目标人工蜂群算法[EB/OL].(2013-03-29)[2025-08-11].http://www.paper.edu.cn/releasepaper/content/201303-970.点此复制

评论