An improved artificial bee colony algorithm for portfolio optimization Problem

被引：0

作者：

Wang Z. ^{[1
]}

Liu S. ^{[1
]}

Kong X. ^{[1
]}

机构：

[1] Department of Mathematics, Xidian University, Xi'an

来源：

International Journal of Advancements in Computing Technology | 2011年 / 3卷 / 10期

关键词：

Artificial bee colony; Efficient frontier; Portfolio optimization;

D O I：

10.4156/ijact.vol3.issue10.9

中图分类号：

学科分类号：

摘要：

To tackle the cardinality constrained portfolio optimization problem, an improved artificial bee colony algorithm is designed. The Deb's selection rule is introduced to guarantee the feasibility of optimal solution. To improve the convergent speed, a new search strategy is proposed. Furthermore, the Bolzmann selection probability is employed to maintain the population diversity. The experiment results indicate that the proposed algorithm is efficient and effective for the portfolio optimization problem, which can obtain a better portfolio strategy and diversify the portfolio risk efficiently.

引用

页码：67 / 74

页数：7

共 15 条

[11]

Kraboga D., An Idea Based On Honey Bee Swarm For Numerical Optimization, (2005)

[12]

Karaboga D., Basturk B., A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm, Journal of Global Optimization, 39, pp. 459-471, (2007)

[13]

Karaboga D., Basturk B., On the performance of artificial bee colony (ABC) algorithm, Applied Soft Computing, 8, pp. 687-697, (2008)

[14]

Karaboga D., Akay B., A comparative study of artificial bee colony algorithm, Applied Mathematics and Computation, 214, pp. 108-132, (2009)

[15]

Zhu G., Kwong S., Gbest-guided artificial bee colony algorithm for numerical function optimization, Applied Mathematics and Computation, 217, pp. 3166-3173, (2010)

← 1 2 →