A portfolio optimization approach to selection in multiobjective evolutionary algorithms

被引:0
作者
机构
[1] Centre for Cybercrime and Computer Security, School of Computing Science, Newcastle University, Newcastle upon Tyne
[2] CISUC, Department of Informatics Engineering, University of Coimbra, Pólo II, Pinhal de Marrocos, Coimbra
[3] Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333 CA, Leiden
来源
| 1600年 / Springer Verlag卷 / 8672期
基金
芬兰科学院;
关键词
Evolutionary algorithms; Fitness assignment; Multiobjective knapsack problem; Portfolio selection; Sharpe ratio;
D O I
10.1007/978-3-319-10762-2_66
中图分类号
学科分类号
摘要
In this work, a new approach to selection in multiobjective evolutionary algorithms (MOEAs) is proposed. It is based on the portfolio selection problem, which is well known in financial management. The idea of optimizing a portfolio of investments according to both expected return and risk is transferred to evolutionary selection, and fitness assignment is reinterpreted as the allocation of capital to the individuals in the population, while taking into account both individual quality and population diversity. The resulting selection procedure, which unifies parental and environmental selection, is instantiated by defining a suitable notion of (random) return for multiobjective optimization. Preliminary experiments on multiobjective multidimensional knapsack problem instances show that such a procedure is able to preserve diversity while promoting convergence towards the Pareto-optimal front. © Springer International Publishing Switzerland 2014.
引用
收藏
页码:672 / 681
页数:9
相关论文
共 50 条