...
首页> 外文期刊>Applied Soft Computing >A learning-guided multi-objective evolutionary algorithm for constrained portfolio optimization
【24h】

A learning-guided multi-objective evolutionary algorithm for constrained portfolio optimization

机译:约束组合优化的学习指导多目标进化算法

获取原文
获取原文并翻译 | 示例

摘要

Portfolio optimization involves the optimal assignment of limited capital to different available financial assets to achieve a reasonable trade-off between profit and risk objectives. In this paper, we studied the extended Markowitz's mean-variance portfolio optimization model. We considered the cardinality, quantity, pre-assignment and round lot constraints in the extended model. These four real-world constraints limit the number of assets in a portfolio, restrict the minimum and maximum proportions of assets held in the portfolio, require some specific assets to be included in the portfolio and require to invest the assets in units of a certain size respectively. An efficient learning-guided hybrid multi-objective evolutionary algorithm is proposed to solve the constrained portfolio optimization problem in the extended mean-variance framework. A learning-guided solution generation strategy is incorporated into the multi-objective optimization process to promote the efficient convergence by guiding the evolutionary search towards the promising regions of the search space. The proposed algorithm is compared against four existing state-of-the-art multi-objective evolutionary algorithms, namely Non-dominated Sorting Genetic Algorithm (NSGA-II), Strength Pareto Evolutionary Algorithm (SPEA-2), Pareto Envelope-based Selection Algorithm (PESA-II) and Pareto Archived Evolution Strategy (PAES). Computational results are reported for publicly available OR-library datasets from seven market indices involving up to 1318 assets. Experimental results on the constrained portfolio optimization problem demonstrate that the proposed algorithm significantly outperforms the four well-known multi-objective evolutionary algorithms with respect to the quality of obtained efficient frontier in the conducted experiments.
机译:投资组合优化涉及将有限资本分配给不同的可用金融资产,以实现利润和风险目标之间的合理权衡。在本文中,我们研究了扩展的Markowitz的均值方差投资组合优化模型。我们在扩展模型中考虑了基数,数量,预分配和轮批约束。这四个现实世界的限制条件限制了投资组合中资产的数量,限制了投资组合中所持有资产的最小和最大比例,要求将某些特定资产包括在投资组合中,并要求以一定规模的单位进行资产投资分别。提出了一种有效的学习指导混合多目标进化算法,以解决扩展均值-方差框架中的约束组合优化问题。以学习为导向的解决方案生成策略被并入多目标优化过程中,以通过将进化搜索引向搜索空间的有希望区域来促进有效收敛。将提出的算法与四种现有的最新多目标进化算法进行比较,即非支配排序遗传算法(NSGA-II),强度帕累托进化算法(SPEA-2),基于帕累托包络的选择算法(PESA-II)和帕累托存档演进策略(PAES)。报告了公开结果的OR图书馆数据集的计算结果,这些数据来自七个市场指数,涉及多达1318种资产。约束组合优化问题的实验结果表明,在进行的实验中,该算法在获得有效前沿方面的质量方面明显优于四种著名的多目标进化算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号