期刊文献+

人工蜂群算法在投资组合中的应用

Application of Artificial Bee Colony Algorithm in Portfolio
下载PDF
导出
摘要 人工蜂群算法是一种人工智能算法,被广泛地应用于求解各类优化问题,都达到了较为理想的结果。本文主要利用改进的人工蜂群算法研究了经典的证券投资组合优化模型,首先过基于公司基本面设计的计分函数挑选出股票,然后利用人工蜂群算法优化被挑选股票的权重。将人工蜂群算法与差分进化算法、粒子群算法等经典优化算法进行性能比较,从而验证算法的有效性以及所得模型的实用性。后改进MATLAB仿真实验,结果表明,在一定的风险水平下,改进的人工蜂群算法构建的投资组合与上述对比算法构建的投资组合以及指数型投资组合相比,获得的收益更高。 Artificial Bee Colony Algorithm is one of the artificial-intelligence algorithms, which has already applied into various optimization problems widely and has got excellent result. The objective of this paper is to create an optimum portfolio using ABC algorithm. The algorithm selects stocks on the basis of the scoring function designed on company fundamentals, and then assigns optimum weights to the selected stocks by ABC algorithm. Comparing the ABC algorithm with differential evolution algorithm and particle swarm optimization algorithm, it is verified that the validity of the algorithm and the practicality of the model. The results have been demonstrated by developing a MATLAB code to implement the algorithm shows that the portfolio which is constructed by the proposed ABC algorithm gets more profits than others, including the exponential portfolio.
出处 《计算机科学与应用》 2017年第11期1135-1145,共11页 Computer Science and Application
  • 相关文献

参考文献6

二级参考文献53

  • 1李爱国.多粒子群协同优化算法[J].复旦学报(自然科学版),2004,43(5):923-925. 被引量:398
  • 2马永开,唐小我.非负约束条件下组合证券投资决策方法的进一步研究[J].预测,1996,15(4):53-56. 被引量:31
  • 3李荣,周激流,徐自励.基于网格和排序的自适应遗传算法及其性能分析[J].四川大学学报(自然科学版),2007,44(3):531-534. 被引量:4
  • 4胡恒滔,龙建忠.基于蚁群算法的模糊C-均值聚类算法在声纹识别中的应用[J].四川大学学报(自然科学版),2007,44(3):543-547. 被引量:10
  • 5Uzsoy R. Scheduling a single batch processing machine with non-identical job sizes [J]. International Journal of Production Research, 1994, 32:1615.
  • 6Dupont L, Jolai G F. Minimizing makespan on a single batch processing machine with non-identical job sizes [J]. European journal of Automation Systems, 1998, 32: 431.
  • 7Dupont L, Dhaenens F C. Minimizing the makespan on a batch machine with nonidentical job sizes:an exact procedure []. Computers & Operations Research, 2002, 29: 807.
  • 8Sevaux M, Peres S D. Genetic algorithms to minimize the weighted number of late jobs on a single machine [J ]. European Journal of Operational Research, 2003, 151: 296.
  • 9Kashan A H, Karimi B, Jolai F. Minimizing makespan on a single batch processing machine with non-identieal job sizes:a hybrid genetic approach[J]. Proceedings Lecture Notes in Computer Science, 2006, 3906: 135.
  • 10Purushothaman D, Paraveen K M, Krishnaswami S. Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms[J]. International Journal of Production Economics, 2006, 103(2):882.

共引文献58

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部