Affiliation:
1. Computer Science Division, Stellenbosh University, Stellenbosch 7600, South Africa
2. Department of Industrial Engineering, Stellenbosh University, Stellenbosch 7600, South Africa
Abstract
Portfolio optimization is a multi-objective optimization problem (MOOP) with risk and profit, or some form of the two, as competing objectives. Single-objective portfolio optimization requires a trade-off coefficient to be specified in order to balance the two objectives. Erwin and Engelbrecht proposed a set-based approach to single-objective portfolio optimization, namely, set-based particle swarm optimization (SBPSO). SBPSO selects a sub-set of assets that form a search space for a secondary optimization task to optimize the asset weights. The authors found that SBPSO was able to identify good solutions to portfolio optimization problems and noted the benefits of redefining the portfolio optimization problem as a set-based problem. This paper proposes the first multi-objective optimization (MOO) approach to SBPSO, and its performance is investigated for multi-objective portfolio optimization. Alongside this investigation, the performance of multi-guide particle swarm optimization (MGPSO) for multi-objective portfolio optimization is evaluated and the performance of SBPSO for portfolio optimization is compared against multi-objective algorithms. It is shown that SBPSO is as competitive as multi-objective algorithms, albeit with multiple runs. The proposed multi-objective SBPSO, i.e., multi-guide set-based particle swarm optimization (MGSBPSO), performs similarly to other multi-objective algorithms while obtaining a more diverse set of optimal solutions.
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference33 articles.
1. A rapidly converging artificial bee colony algorithm for portfolio optimization;Cura;Knowl.-Based Syst.,2021
2. A parallel variable neighborhood search algorithm with quadratic programming for cardinality constrained portfolio optimization;Akbay;Knowl.-Based Syst.,2020
3. A comprehensive review of deterministic models and applications for mean-variance portfolio optimization;Kalayci;Expert Syst. Appl.,2019
4. Heuristic algorithms for the cardinality constrained efficient frontier;Lucas;Eur. J. Oper. Res.,2011
5. Moral-Escudero, R., Ruiz-Torrubiano, R., and Suarez, A. (2006, January 16–21). Selection of optimal investment portfolios with cardinality constraints. Proceedings of the IEEE International Conference on Evolutionary Computation, Vancouver, BC, Canada.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献