Optimization of cardinality constrained portfolios with a hybrid local search algorithm

Optimization of cardinality constrained portfolios with a hybrid local search algorithm

0.00 Avg rating0 Votes
Article ID: iaor2005973
Country: Germany
Volume: 25
Issue: 4
Start Page Number: 481
End Page Number: 495
Publication Date: Jan 2003
Journal: OR Spektrum
Authors: ,
Keywords: heuristics, optimization: simulated annealing
Abstract:

One of the main advantages of portfolios over single assets is that risk can be diversified without necessarily reducing the expected return – provided “proper” assets are selected and they are assigned the “proper” weights. Since in practice investors tend to restrict themselves to a rather small number of different assets, the decision which securities to include is a crucial one that turns out to be NP-hard. In this paper we suggest a hybrid local search algorithm which combines principles of Simulated Annealing and evolutionary strategies and which proves to be a highly efficiently approach this problem.

Reviews

Required fields are marked *. Your email address will not be published.