Artificial Bee Colony Algorithm Hybridized with Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Selection Problem

被引:89
作者
Tuba, Milan [1 ]
Bacanin, Nebojsa [1 ]
机构
[1] Megatrend Univ, Fac Comp Sci, Belgrade, Serbia
来源
APPLIED MATHEMATICS & INFORMATION SCIENCES | 2014年 / 8卷 / 06期
关键词
Artificial bee colony algorithm (ABC); firefly algorithm (FA); swarm intelligence; nature inspired algorthms; optimization metaheuristics; portfolio optimization; cardinality constraints; PHEROMONE CORRECTION STRATEGY; OPTIMIZATION ALGORITHM; SEEKER OPTIMIZATION; GENETIC ALGORITHM; ABC;
D O I
10.12785/amis/080619
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Portfolio selection (optimization) problem is a very important and widely researched problem in the areas of finance and economy. Literature review shows that many methods and heuristics were applied to this hard optimization problem, however, there are only few implementations of swarm intelligence metaheuristics. This paper presents artificial bee colony (ABC) algorithm applied to the cardinality constrained mean-variance (CCMV) portfolio optimization model. By analyzing ABC metaheuristic, some deficiencies such as slow convergence to the optimal region, were noticed. In this paper ABC algorithm improved by hybridization with the firefly algorithm (FA) is presented. FA's search procedure was incorporated into the ABC algorithm to enhance the process of exploitation. We tested our proposed algorithm on standard test data used in the literature. Comparison with other state-of-the-art optimization metaheuristics including genetic algorithms, simulated annealing, tabu search and particle swarm optimization (PSO) shows that our approach is superior considering quality of the portfolio optimization results, especially mean Euclidean distance from the standard efficiency frontier.
引用
收藏
页码:2831 / 2844
页数:14
相关论文
共 47 条
[21]  
Forqandoost HK., 2012, INT J TRADE EC FINAN, V3, P148
[22]   Improved ant colony optimization algorithm for the traveling salesman problems [J].
Gan, Rongwei ;
Guo, Qingshun ;
Chang, Huiyou ;
Yi, Yang .
JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2010, 21 (02) :329-333
[23]   Constrained Portfolio Selection using Particle Swarm Optimization [J].
Golmakani, Hamid Reza ;
Fazel, Mehrshad .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (07) :8327-8335
[24]   Ant Colony Optimization Algorithm with Pheromone Correction Strategy for the Minimum Connected Dominating Set Problem [J].
Jovanovic, Raka ;
Tuba, Milan .
COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2013, 10 (01) :133-149
[25]   An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem [J].
Jovanovic, Raka ;
Tuba, Milan .
APPLIED SOFT COMPUTING, 2011, 11 (08) :5360-5366
[26]  
Karaboga D., 2005, Technical Report, Technical report-tr06, V1
[27]   PORTFOLIO SELECTION [J].
Markowitz, Harry .
JOURNAL OF FINANCE, 1952, 7 (01) :77-91
[28]   Constraint-handling in nature-inspired numerical optimization: Past, present and future [J].
Mezura-Montes, Efren ;
Coello Coello, Carlos A. .
SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (04) :173-194
[29]  
Mezura-Montes E, 2009, STUD COMPUT INTELL, V198, P95
[30]   MUTUAL FUND PERFORMANCE [J].
SHARPE, WF .
JOURNAL OF BUSINESS, 1966, 39 (01) :119-138