Interactive evolutionary multi-objective optimization for quasi-concave preference functions

doi:10.1016/j.ejor.2010.02.027

Interactive evolutionary multi-objective optimization for quasi-concave preference functions

2010-10-01

62

PRE

AI

DOI：10.1016/j.ejor.2010.02.027

Original

Original request for help

Save

Abstract

En 中文

We present a new hybrid approach to interactive evolutionary multi-objective optimization that uses a partial preference order to act as the fitness function in a customized genetic algorithm. We periodically send solutions to the decision maker (DM) for her evaluation and use the resulting preference information to form preference cones consisting of inferior solutions. The cones allow its to implicitly rank solutions that the DM has not considered. This technique avoids assuming an exact form for the preference function, but does assume that the preference function is quasi-concave. This paper describes the genetic algorithm and demonstrates its performance on the multi-objective knapsack problem. (C) 2010 Elsevier By. All rights reserved.

Keywords:

Interactive optimization

Multi-objective optimization

Evolutionary optimization

Knapsack problem

Interactive evolutionary multi-objective optimization for quasi-concave preference functions

Abstract

Journal

Organization