Set-Based Evolutionary Optimization Algorithms Integrating Decision-Maker’s Preferences for Many-Objective Optimization Problems

GONG Dun-wei; WANG Geng-xing; SUN Xiao-yan

doi:10.3969/j.issn.0372-2112.2014.05.015

您当前的位置：

首页 >

文章列表页 >

Set-Based Evolutionary Optimization Algorithms Integrating Decision-Maker’s Preferences for Many-Objective Optimization Problems

更新时间：2025-07-16

- Set-Based Evolutionary Optimization Algorithms Integrating Decision-Maker’s Preferences for Many-Objective Optimization Problems
- Acta Electronica Sinica Vol. 42, Issue 5, Pages: 933-939(2014)
- 作者机构：
  
  中国矿业大学信息与电气工程学院,江苏,徐州,221116
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61105063);Fundamental Research Funds for the Central Universities (No.2013XK09);Graduate Research Innovation Program of univerities in Jiangsu Province (No.CXZZ13-0932)
- DOI：10.3969/j.issn.0372-2112.2014.05.015
  CLC： TN911.23
- Published：2014
- 稿件说明：
移动端阅览
GONG Dun-wei, WANG Geng-xing, SUN Xiao-yan. Set-Based Evolutionary Optimization Algorithms Integrating Decision-Maker’s Preferences for Many-Objective Optimization Problems[J]. Acta Electronica Sinica, 2014, 42(5): 933-939.
DOI：

GONG Dun-wei, WANG Geng-xing, SUN Xiao-yan. Set-Based Evolutionary Optimization Algorithms Integrating Decision-Maker’s Preferences for Many-Objective Optimization Problems[J]. Acta Electronica Sinica, 2014, 42(5): 933-939. DOI： 10.3969/j.issn.0372-2112.2014.05.015.

摘要

高维多目标优化问题普遍存在且非常重要，但是，已有的解决方法却很少.本文提出一种有效解决该问题的融入决策者偏好的集合进化优化方法，该方法首先基于决策者给出的每个目标的偏好区域，将原优化问题的目标函数转化为期望函数；然后，以原优化问题的多个解形成的集合为新的决策变量，以超体积和决策者期望满足度为新的目标函数，将优化问题转化为2目标优化问题；最后，采用多目标集合进化优化方法求解，得到满足决策者偏好且收敛性和分布性均衡的Pareto优化解集.将所提方法应用于4个基准高维多目标优化问题，并与其他2种方法比较，实验结果验证了所提方法的优越性.

Abstract

Many-objective optimization problems are common and important in real-world applications

previous theories and methods suitable for them

however

are few so far.We presented a set-based many-objective evolutionary optimization algorithm with integrating a decision-maker's preferences to effectively solve the problems above in this study.In the proposed method

each objective function of the original optimization problem was first transformed into a desirability function based on preference areas given by the decision-maker over it;thereafter

the optimization problem was further transformed into a bi-objective optimization one by taking such indicators as hyper-volume and the decision-maker's satisfaction as two new objectives in which a set formed by multiple solutions of the original optimization problem is as the new decision variable;finally

the transformed bi-objective optimization problem was solved by using a set-based evolutionary optimization algorithm to obtain a Pareto optimal set which meets the decision-maker's preferences and balances the convergence and the distribution.The proposed method was applied to four benchmark many-objective optimization problems and compared with the other methods.The experimental results showed its advantages.

关键词

Keywords

references

Views

1600

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Many-Objective Evolutionary Algorithm Based on Dynamic Decomposition and Angle Penalty Distance

Many-Objective Evolutionary Algorithm Based on SOM Clustering and Adaptive Operator Selection

Laplacian MinMax Discriminant Analysis and its Applications

A New Method for Steganalysis Techniques:IKLDA

Face Recognition Using Tensor Locality Discriminant Projection

Related Author

YAO Min-li

ZHANG Feng-gan

WANG Xu-jian

ZHONG Pei-long

LI Ming

HE Chao

CHEN Hao

Related Institution

Rocket Force University of Engineering

School of Information Engineering, Nanchang Hangkong University

Key Laboratory of Nondestructive Testing, Ministry of Education, Nanchang Hangkong University

School of Automation, Nanjing University of Aeronautics and Astronautics

College of BusinessEastern Washington UniversitySpokane WA 99202USA

⁰