Implementation of e-New Local Search based Multiobjective Optimization Algorithm and Multiobjective Co-variance based Artificial Bee Colony Algorithm in Stocks Portfolio Optimization Problem

R. Ramadhiani, M. Yan, G. Hertono, B. Handari
{"title":"Implementation of e-New Local Search based Multiobjective Optimization Algorithm and Multiobjective Co-variance based Artificial Bee Colony Algorithm in Stocks Portfolio Optimization Problem","authors":"R. Ramadhiani, M. Yan, G. Hertono, B. Handari","doi":"10.1109/ICICOS.2018.8621646","DOIUrl":null,"url":null,"abstract":"The problem of portfolio optimization is a research topic that is quite widely discussed in the financial sector. The first model in this problem is the mean-variance model that focuses on expected return and risk without considering the constraints contained in the real problem. In this paper, a portfolio optimization model with real constraints which is commonly known as the Mean-Variance Cardinality Constrained Portfolio Optimization (MVCCPO) model is considered. The e-New Local Search based Multi-objective Optimization Algorithm (e-NSLS) and Multi-objective Covariance based Artificial Bee Colony (M -CABC) algorithm are used to solve portfolio optimization problem on datasets involving up to 225 assets. Obtained results are compared with the unconstrained efficient frontier of the corresponding data sets. The numerical simulations state that e-NSLS algorithm gives a better solution than M-CABC, where the solutions produced by e-NSLS are nearer to the corresponding unconstrained efficient frontier than the solutions generated by M-CABC.","PeriodicalId":438473,"journal":{"name":"2018 2nd International Conference on Informatics and Computational Sciences (ICICoS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 2nd International Conference on Informatics and Computational Sciences (ICICoS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICOS.2018.8621646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The problem of portfolio optimization is a research topic that is quite widely discussed in the financial sector. The first model in this problem is the mean-variance model that focuses on expected return and risk without considering the constraints contained in the real problem. In this paper, a portfolio optimization model with real constraints which is commonly known as the Mean-Variance Cardinality Constrained Portfolio Optimization (MVCCPO) model is considered. The e-New Local Search based Multi-objective Optimization Algorithm (e-NSLS) and Multi-objective Covariance based Artificial Bee Colony (M -CABC) algorithm are used to solve portfolio optimization problem on datasets involving up to 225 assets. Obtained results are compared with the unconstrained efficient frontier of the corresponding data sets. The numerical simulations state that e-NSLS algorithm gives a better solution than M-CABC, where the solutions produced by e-NSLS are nearer to the corresponding unconstrained efficient frontier than the solutions generated by M-CABC.
基于e-New局部搜索的多目标优化算法和基于多目标协方差的人工蜂群算法在股票组合优化问题中的实现
投资组合优化问题是金融领域广泛讨论的一个研究课题。该问题中的第一个模型是均值-方差模型,它只关注预期收益和风险,而不考虑实际问题中的约束条件。本文考虑了一种具有实际约束的投资组合优化模型,即均值-方差基数约束投资组合优化模型(MVCCPO)。采用基于e-New局部搜索的多目标优化算法(e-NSLS)和基于多目标协方差的人工蜂群(M -CABC)算法求解225个资产的数据集上的投资组合优化问题。将所得结果与相应数据集的无约束有效边界进行了比较。数值模拟结果表明,e-NSLS算法的解比M-CABC算法的解更接近相应的无约束有效边界,e-NSLS算法的解比M-CABC算法的解更接近无约束有效边界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信