Hybridized Artificial Bee Colony Algorithm for Constrained Portfolio Optimization Problem

被引:11
|
作者
Strumberger, Ivana [1 ]
Tuba, Eva [1 ]
Bacanin, Nebojsa [1 ]
Beko, Marko [2 ]
Tuba, Milan [1 ]
机构
[1] Singidunum Univ, Fac Informat & Comp, Belgrade, Serbia
[2] Univ Lusofona Humanidades & Tecnol, CICANT CIC DIGITAL, Lisbon, Portugal
关键词
FIREFLY ALGORITHM; FIREWORKS ALGORITHM;
D O I
10.1109/CEC.2018.8477732
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Portfolio selection problem that deals with the optimal allocation of capital is a well-known hard optimization problem in the domains of economics and finance. Basic version of the problem is multi-objective since it deals with maximization of return with simultaneous minimization of risk. Additional real world constraints, including cardinality, make the problem even harder. Many techniques and heuristics have been applied to this intractable optimization problem, however swarm intelligence algorithms have been implemented only few times for this task, even though they are known to be very successful for that class of problems. In this paper, we hybridized artificial bee colony algorithm with elements inspired by genetic algorithms to obtain better balance between intensification and diversification, especially during late stages, and applied the proposed improved algorithm to the cardinality constrained mean-variance version of the portfolio selection problem. Experimental results on standard benchmark datasets from five stock indexes and comparative analysis with other cutting edge algorithms have shown that our proposed algorithm achieved better results considering all relevant metrics i.e. mean Euclidean distance between standard efficiency frontier and heuristic efficiency frontier from sets of Pareto optimal portfolios obtained by tested algorithms, mean return error and variance of return error.
引用
收藏
页码:887 / 894
页数:8
相关论文
共 50 条