Squirrel search algorithm for portfolio optimization

被引:27
作者
Dhaini, Mahdi [1 ]
Mansour, Nashat [1 ]
机构
[1] Lebanese American Univ, Dept Comp Sci & Math, POB 13-5053 Chouran, Beirut 11022801, Lebanon
关键词
Swarm Intelligence; Portfolio optimization; Squirrel search algorithm; Markowitz; Sharpe; Mean-variance; ARTIFICIAL BEE COLONY;
D O I
10.1016/j.eswa.2021.114968
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Portfolio Optimization is a standard financial engineering problem. It aims for finding the best allocation of resources for a set of assets. This problem has been studied and different models have been proposed since the classical Mean-Variance model was introduced by Harry Markowitz in 1952 and the later modified version by William Sharpe. The inclusion of real-life constraints to the problem has led to the introduction of the extended Mean-Variance model. However, the successes of nature-inspired algorithms in hard computational optimization problems have encouraged researchers to design and apply these algorithms for a variety of optimization problems. In this paper, we design and adapt a Squirrel Search Algorithm (SSA) for the unconstrained and constrained portfolio optimization problems. SSA is a very recent swarm intelligence algorithm inspired by the dynamic foraging behavior of flying squirrels. The proposed SSA metaheuristic approach is compared with a variety of approaches presented in the literature such as classical single metaheuristics, hybrid metaheuristic approaches and multi-objective optimization approaches for portfolio optimization. Comparative analysis and computational results using different performance indicators show the superiority of the proposed approach for the unconstrained portfolio optimization using both extended Mean-Variance and Sharpe models. For the constrained version of the problem, the proposed approach has also achieved highly competitive results for the different models adopted.
引用
收藏
页数:14
相关论文
共 49 条
[41]   Hybridized Artificial Bee Colony Algorithm for Constrained Portfolio Optimization Problem [J].
Strumberger, Ivana ;
Tuba, Eva ;
Bacanin, Nebojsa ;
Beko, Marko ;
Tuba, Milan .
2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, :887-894
[42]   Upgraded Firefly Algorithm for Portfolio Optimization Problem [J].
Tuba, Milan ;
Bacanin, Nebojsa .
2014 UKSIM-AMSS 16TH INTERNATIONAL CONFERENCE ON COMPUTER MODELLING AND SIMULATION (UKSIM), 2014, :113-118
[43]   Artificial Bee Colony Algorithm Hybridized with Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Selection Problem [J].
Tuba, Milan ;
Bacanin, Nebojsa .
APPLIED MATHEMATICS & INFORMATION SCIENCES, 2014, 8 (06) :2831-2844
[44]   Dynamic Multiobjective Squirrel Search Algorithm Based on Decomposition With Evolutionary Direction Prediction and Bidirectional Memory Populations [J].
Wang, Yanjiao ;
Du, Tianlin ;
Liu, Tingting ;
Zhang, Lei .
IEEE ACCESS, 2019, 7 :115997-116013
[45]  
Wolpert D. H., 1997, IEEE Transactions on Evolutionary Computation, V1, P67, DOI 10.1109/4235.585893
[46]   Heuristic algorithms for the cardinality constrained efficient frontier [J].
Woodside-Oriakhi, M. ;
Lucas, C. ;
Beasley, J. E. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 213 (03) :538-550
[47]  
Xu R. T., 2010, P INT C TECHN APPL A
[48]   Particle Swarm Optimization (PSO) for the constrained portfolio optimization problem [J].
Zhu, Hanhong ;
Wang, Yi ;
Wang, Kesheng ;
Chen, Yun .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (08) :10161-10169
[49]  
Zitzler E., 2001, SPEA2 IMPROVING STRE