A Mayfly algorithm for cardinality constrained portfolio optimization

被引:4
|
作者
Zheng, Xuanyu [1 ,2 ]
Zhang, Changsheng [1 ]
Zhang, Bin [1 ]
机构
[1] Northeastern Univ, Shenyang 110819, Peoples R China
[2] Shenyang Inst Financial Informat Ind Technol, Shenyang 110167, Peoples R China
关键词
Mayfly algorithm; Portfolio optimization; Cardinality constraint; Swarm intelligence algorithm; PARTICLE SWARM OPTIMIZATION; BEE COLONY ALGORITHM; GENETIC ALGORITHM; SELECTION; MODEL; PREDICTION; NETWORK;
D O I
10.1016/j.eswa.2023.120656
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Portfolio optimization is an essential issue in quantitative investing, which aims to find the best set of portfolios by allocating the proportion of assets. One of the most widely studied portfolio optimization models is the cardinality constrained mean-variance model, which incorporates real-world constraints on the number of selected assets and lower and upper bounds on the proportion of each asset. This paper presents a novel metaheuristic algorithm based on the Mayfly algorithm to solve the cardinality constrained mean-variance portfolio optimization problem. To better adapt to this problem, we design and introduce some new features to the proposed algorithm, including (1) a new cardinality constraint handling strategy; (2) a new local search strategy; and (3) changes to the crossover operator. We have designed comparison experiments for the proposed metaheuristic and evaluated its performance using five commonly used performance metrics. The experimental results show that the proposed approach achieves competitive performance on datasets of different sizes. The results also demonstrate the feasibility of this approach in solving the cardinality constrained mean-variance portfolio optimization problem.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] A Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem
    Cui, Tianxiang
    Cheng, Shi
    Bai, Ruibin
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 491 - 498
  • [2] A parallel variable neighborhood search algorithm with quadratic programming for cardinality constrained portfolio optimization
    Akbay, Mehmet Anil
    Kalayci, Can B.
    Polat, Olcay
    KNOWLEDGE-BASED SYSTEMS, 2020, 198
  • [3] An Artificial Bee Colony Algorithm for the Cardinality-Constrained Portfolio Optimization Problems
    Chen, Angela H. L.
    Liang, Yun-Chia
    Liu, Chia-Chien
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [4] On cardinality constrained mean-CVaR portfolio optimization
    Cheng, Runze
    Gao, Jianjun
    2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 1074 - 1079
  • [5] An efficient hybrid metaheuristic algorithm for cardinality constrained portfolio optimization
    Kalayci, Can B.
    Polat, Olcay
    Akbay, Mehmet A.
    SWARM AND EVOLUTIONARY COMPUTATION, 2020, 54
  • [6] Cardinality constrained portfolio optimization with a hybrid scheme combining a Genetic Algorithm and Sonar Inspired Optimization
    Christos Konstantinou
    Alexandros Tzanetos
    Georgios Dounias
    Operational Research, 2022, 22 : 2465 - 2487
  • [7] Cardinality constrained portfolio optimization with a hybrid scheme combining a Genetic Algorithm and Sonar Inspired Optimization
    Konstantinou, Christos
    Tzanetos, Alexandros
    Dounias, Georgios
    OPERATIONAL RESEARCH, 2022, 22 (03) : 2465 - 2487
  • [8] A memetic algorithm for cardinality-constrained portfolio optimization with transaction costs
    Ruiz-Torrubiano, Ruben
    Suarez, Alberto
    APPLIED SOFT COMPUTING, 2015, 36 : 125 - 142
  • [9] An artificial bee colony algorithm with feasibility enforcement and infeasibility toleration procedures for cardinality constrained portfolio optimization
    Kalayci, Can B.
    Ertenlice, Okkes
    Akyer, Hasan
    Aygoren, Hakan
    EXPERT SYSTEMS WITH APPLICATIONS, 2017, 85 : 61 - 75
  • [10] Robust optimization framework for cardinality constrained portfolio problem
    Sadjadi, Seyed Jafar
    Gharakhani, Mohsen
    Safari, Ehram
    APPLIED SOFT COMPUTING, 2012, 12 (01) : 91 - 99