Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization

Bai-Pin Ni, Ying Wang, Jingfu Huang, Guocheng Li
{"title":"Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization","authors":"Bai-Pin Ni, Ying Wang, Jingfu Huang, Guocheng Li","doi":"10.1142/s0129054122420151","DOIUrl":null,"url":null,"abstract":"A portfolio selection problem with cardinality constraints has been proved to be an NP-hard problem, and it is difficult to solve by the traditional optimization methods. This study considers it to be a hybrid of a classical feature selection problem and a standard mean-variance (MV) portfolio selection model. In particular, we propose a new hybrid meta-heuristic algorithm that combines an enhanced binary honey badger algorithm (EBHBA) with quadratic programming to address this issue. First, we employ the proposed EBHBA algorithm to select a portfolio of [Formula: see text] stocks from [Formula: see text] candidate stocks. Second, based on its choice we transform the problem into a mean-variance model, whose objective function could be defined as the fitness function of EBHBA. Finally, the optimal solution to the model could be found with the quadratic programming method. We also test our approach using the benchmark data sets available at the OR-Library involving real capital markets, where indices are derived from major stock markets around the world. Computational results demonstrate that the proposed method can achieve a satisfactory result for portfolio selection with cardinality constraints and perform well in searching non-dominated portfolios with high expected returns.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"113 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Found. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129054122420151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A portfolio selection problem with cardinality constraints has been proved to be an NP-hard problem, and it is difficult to solve by the traditional optimization methods. This study considers it to be a hybrid of a classical feature selection problem and a standard mean-variance (MV) portfolio selection model. In particular, we propose a new hybrid meta-heuristic algorithm that combines an enhanced binary honey badger algorithm (EBHBA) with quadratic programming to address this issue. First, we employ the proposed EBHBA algorithm to select a portfolio of [Formula: see text] stocks from [Formula: see text] candidate stocks. Second, based on its choice we transform the problem into a mean-variance model, whose objective function could be defined as the fitness function of EBHBA. Finally, the optimal solution to the model could be found with the quadratic programming method. We also test our approach using the benchmark data sets available at the OR-Library involving real capital markets, where indices are derived from major stock markets around the world. Computational results demonstrate that the proposed method can achieve a satisfactory result for portfolio selection with cardinality constraints and perform well in searching non-dominated portfolios with high expected returns.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于二次规划的混合增强二元蜜獾算法用于基数约束投资组合优化
具有基数约束的投资组合选择问题是一个np困难问题,传统的优化方法难以求解。本研究将其视为经典特征选择问题与标准均值-方差(MV)投资组合选择模型的混合。特别地,我们提出了一种新的混合元启发式算法,该算法将增强型二元蜜獾算法(EBHBA)与二次规划相结合来解决这一问题。首先,我们采用提出的EBHBA算法从[公式:见文]候选股票中选择[公式:见文]股票组合。其次,根据其选择将问题转化为均值-方差模型,其目标函数可定义为EBHBA的适应度函数。最后,利用二次规划方法求出模型的最优解。我们还使用OR-Library中涉及真实资本市场的基准数据集来测试我们的方法,其中的指数来自世界各地的主要股票市场。计算结果表明,该方法在具有基数约束的组合选择中取得了满意的结果,在搜索具有高期望收益的非主导组合方面表现良好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Hardest LL(k) Language Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface Transportation Problem Allowing Sending and Bringing Back Online and Approximate Network Construction from Bounded Connectivity Constraints
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1