By Topic

The Interactive Pareto Iterated Local Search (iPILS) Metaheuristic and its Application to the Biobjective Portfolio Optimization Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Geiger, M.J. ; Dept. of Ind. Manage., Hohenheim Univ., Stuttgart

The article presents an approach to interactively solve multi-objective optimization problems. While the identification of efficient solutions is supported by computational intelligence techniques on the basis of local search, the search is directed by partial preference information obtained from the decision maker. An application of the approach to biobjective portfolio optimization, modeled as the well-known knapsack problem, is reported, and experimental results are reported for benchmark instances taken from the literature. In brief, we obtain encouraging results that show the applicability of the approach to the described problem. In order to stipulate a better understanding of the underlying structures of biobjective knapsack problems, we also study the characteristics of the search space of instances for which the optimal alternatives are known. As a result, optimal alternatives have been found to be relatively concentrated in alternative space, making the resolution of the studied instances possible with reasonable effort

Published in:

Computational Intelligence in Multicriteria Decision Making, IEEE Symposium on

Date of Conference:

1-5 April 2007