A preference based interactive evolutionary algorithm for multi-objective optimization: PIE

Authors:
Karthik Sindhya;Ana Belen Ruiz;Kaisa Miettinen
Affiliations:
Department of Mathematical Information Technology, University of Jyväskylä, Finland;Department of Applied Economics (Mathematics), University of Malaga, Malaga, Spain;Department of Mathematical Information Technology, University of Jyväskylä, Finland
Venue:
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Year:
2011

Citing 6
Cited 0

Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
A preference-based evolutionary algorithm for multi-objective optimization

Evolutionary Computation
Quantifying the effects of objective space dimension in evolutionary multiobjective optimization

EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Toward an estimation of nadir objective vector using a hybrid of evolutionary and local search approaches

IEEE Transactions on Evolutionary Computation
Global formulation for interactive multiobjective optimization

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new Preference-based Interactive Evolutionary (PIE) algorithm for multi-objective optimization which exploits the advantages of both evolutionary algorithms and multiple criteria decision making approaches. Our algorithm uses achievement scalarizing functions and the potential of population based evolutionary algorithms to help the decision maker to direct the search towards the desired Pareto optimal solution. Starting from an approximated nadir point, the PIE algorithm improves progressively the objective function values of a solution by finding a better solution at each iteration that improves the previous one. The decision maker decides from which solution, in which direction, and at what distance from the Pareto front to find the next solution. Thus, the PIE algorithm is guided interactively by the decision maker. A flexible approach is obtained with the use of archive sets to store all the solutions generated during an evolutionary algorithm's run, as it allows the decision maker to freely navigate and inspect previous solutions if needed. The PIE algorithm is demonstrated using a pollution monitoring station problem and shown to be effective in helping the decision maker to find a solution that satisfies her/his preferences.