.png){kind=icon}
返回
Genetic relation algorithm with guided mutation for the large-scale portfolio optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2010.08.120.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The survey of the relevant literatures shows that there have been many studies for portfolio optimization problems and that the number of studies which have investigated the optimum portfolio using evolutionary computation is quite large. But, almost none of these studies deals with genetic relation algorithm (GRA), where GRA is one of the evolutionary methods with graph structure. This study presents an approach to large-scale portfolio optimization problems using GRA with a new operator, called guided mutation. In order to pick up the most efficient portfolio, GRA considers the correlation coefficient between stock brands as strength, which indicates the relation between nodes in each individual of GRA. Guided mutation generates offspring according to the average value of correlation coefficients in each individual, which means to enhance the exploitation ability of evolution of GRA. A genetic relation algorithm with guided mutation (CRA/G) for the portfolio optimization is proposed in this paper. Genetic network programming (GNP), which was proposed in our previous research, is used to validate the performance of the portfolio generated with CRA/G. The results show that CRA/G approach is successful in portfolio optimization. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Portfolio optimization
Genetic relation algorithm
Guided mutation
Genetic network programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
Incidence of Hepatitis C Infection among Prisoners by Routine Laboratory Values during a 20-Year Period.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
查看更多内容