Optimizing interval multi-objective problems using IEAs with preference direction

Authors:
Jing Sun;Dunwei Gong;Xiaoyan Sun
Affiliations:
School of Information and Electrical Engineering, China University of Mining and Technology, Xuzhou, China;School of Information and Electrical Engineering, China University of Mining and Technology, Xuzhou, China;School of Information and Electrical Engineering, China University of Mining and Technology, Xuzhou, China
Venue:
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Year:
2011

Citing 4
Cited 0

Multiobjective Optimization: Interactive and Evolutionary Approaches

Multiobjective Optimization: Interactive and Evolutionary Approaches
Introduction to Interval Analysis

Introduction to Interval Analysis
Solving interval multi-objective optimization problems using evolutionary algorithms with preference polyhedron

Proceedings of the 13th annual conference on Genetic and evolutionary computation
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interval multi-objective optimization problems (MOPs) are popular and important in real-world applications. We present a novel interactive evolutionary algorithm (IEA) incorporating an optimization-cum-decision-making procedure to obtain the most preferred solution that fits a decision-maker (DM)'s preferences. Our method is applied to two interval MOPs and compared with PPIMOEA and the posteriori method, and the experimental results confirm the superiorities of our method.