Skip to main content
SpringerLink
Log in

Time-Varying Mean-Variance Portfolio Selection under Transaction Costs and Cardinality Constraint Problem via Beetle Antennae Search Algorithm (BAS)

  • Original Research
  • Published:
Operations Research Forum Aims and scope Submit manuscript

Abstract

The Markowitz mean-variance portfolio selection is widely acclaimed as a very important investment strategy. A popular option to solve the static mean-variance portfolio selection (MVPS) problem is based on the use of quadratic programming (QP) methods. On the other hand, the static portfolio selection under transaction costs (PSTC) problem is usually approached with nonlinear programming (NLP) methods. In this article, we define and study the time-varying mean-variance portfolio selection under transaction costs and cardinality constraint (TV-MVPSTC-CC) problem as a time-varying nonlinear programming (TVNLP) problem. The TV-MVPSTC-CC also comprises the properties of a moving average. These properties make the TV-MVPSTC-CC an even greater analysis tool suitable to evaluate investments and identify trading opportunities across a continuous-time period. Using the Beetle Antennae Search (BAS) algorithm, we also provide an online solution to the static NLP problem. To the best of our knowledge, this is an innovative approach that incorporates modern meta-heuristic optimization techniques to provide an online, thus more realistic, solution to the TV-MVPSTC-CC problem. In this way, we present an online solution to a time-varying financial problem while eliminating the restrictions of static methods. Our approach is also verified by numerical experiments and computer simulations as an excellent alternative to traditional approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Ogryczak W, Sliwinski T (2011) On solving the dual for portfolio selection by optimizing conditional value at risk. Comput Optim Appl 50(3):591–595

    Article  Google Scholar 

  2. Konno H, Tanaka K, Yamamoto R (2011) Construction of a portfolio with shorter downside tail and longer upside tail. Comput Optim Appl 48(2):199–212

    Article  Google Scholar 

  3. Soleimani H, Golmakani HR, Salimi MH (2009) Markowitz-based portfolio selection with minimum transaction lots, cardinality constraints and regarding sector capitalization using genetic algorithm. Expert Systems with Applications 36(3):5058–5063

    Article  Google Scholar 

  4. Ye K, Parpas P, Rustem B (2012) Robust portfolio optimization: a conic programming approach. Comput Optim Appl 52(2):463–481

    Article  Google Scholar 

  5. Konno H, Akishino K, Yamamoto R (2005) Optimization of a long-short portfolio under nonconvex transaction cost. Comput Optim Appl 32(1–2):115–132

    Article  Google Scholar 

  6. Katsikis VN, Mourtas SD (2019) A heuristic process on the existence of positive bases with applications to minimum-cost portfolio insurance in C[a, b]. Appl Math Comput 349:221–244

    Google Scholar 

  7. Katsikis VN, Mourtas SD (2019) ORPIT: A Matlab Toolbox for Option Replication and Portfolio Insurance in Incomplete Markets. Comput Econ. p 1

  8. Corsaro S, Simone VD (2019) Adaptive \({l_1}\)-regularization for short-selling control in portfolio selection. Comput Optim Appl 72(2):457–478

    Article  Google Scholar 

  9. Katsikis VN, Mourtas SD, Stanimirović PS, Li S, Cao X (2020) Time-varying minimum-cost portfolio insurance under transaction costs problem via beetle antennae search algorithm (BAS). Appl Math Comput 385:125453

    Google Scholar 

  10. Yang XS (2014) Nature-inspired optimization algorithms. Elsevier

  11. Storn R, Price KV (1997) Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359

    Article  Google Scholar 

  12. Khan AH, Cao X, Katsikis VN, Stanimirovic P, Brajevic I, Li S, Kadry S, Nam Y (2020) Optimal portfolio management for engineering problems using nonconvex cardinality constraint: a computing perspective. IEEE Access, p 1

  13. Khan AT, Cao X, Li S, Hu B, Katsikis VN (2020) Quantum beetle antennae search: A novel technique for the constrained portfolio optimization problem. Science China Inf Sci

  14. Khan AH, Cao X, Li S, Luo C (2020) Using social behavior of beetles to establish a computational model for operational management. IEEE Transactions on Computational Social Systems, pp 1–11

  15. Xie S, Chu X, Zheng M, Liu C (2019) Ship predictive collision avoidance method based on an improved beetle antennae search algorithm. Ocean Engineering 192:106542

    Article  Google Scholar 

  16. Zhang J, Huang Y, Ma G, Nener B (2020) Multi-objective beetle antennae search algorithm. arXiv preprint. arXiv:2002.10090

  17. Wang J, Chen H (2018) BSAS: Beetle swarm antennae search algorithm for optimization problems. arXiv preprint. arXiv:1807.10470

  18. Markowitz H (1952) Portfolio selection. J Financ 7(1):77–91

    Google Scholar 

  19. Kulali I (2016) Portfolio optimization analysis with markowitz quadratic mean-variance model. European Journal of Business and Management 8(7):73–79

    Google Scholar 

  20. Lobo MS, Fazel M, Boyd S (2007) Portfolio optimization with linear and fixed transaction costs. Ann Oper Res 152:341–365

    Article  Google Scholar 

  21. Mansini R, Ogryczak W, Speranza MG (2015) Portfolio optimization with transaction costs, chapter 3, EURO Advanced Tutorials on Operational Research. Springer International Publishing, pp 47–62

  22. Xia Y, Liu B, Wang S, Lai KK (2000) A model for portfolio selection with order of expected returns. Comput Oper Res 27(5):409–422

    Article  Google Scholar 

  23. Cornuéjols G, Peña J, Tütüncü R (2018) Optimization methods in finance. Cambridge University Press, second edition, Cambridge

    Book  Google Scholar 

  24. Dai Z (2019) A closer look at the minimum-variance portfolio optimization model. Math Probl Eng 2019:1–8

    Google Scholar 

  25. Bielecki TR, Jin H, Pliska SR, Zhou XY (2005) Continuous-time mean-variance portfolio selection with bankruptcy prohibition. Math Financ 15(2):213–244

    Article  Google Scholar 

  26. Draviam T, Chellathurai T (2002) Generalized Markowitz mean-variance principles for multi-period portfolio-selection problems. Proc R Soc Lond A 458:2571–2607

    Article  Google Scholar 

  27. Markowitz HM (1994) The general mean-variance portfolio selection problem, Philosophical Transactions of the Royal Society of London. Series A: Phys Eng Sci 347(1684):543–549

    Google Scholar 

  28. Zakamulin V (2017) Market timing with moving averages: the anatomy and performance of trading rules. Springer

  29. Markowitz HM (1959) Portfolio selection: efficient diversification of investments. Cowles Foundation Monograph: No. 16. Yale University Press

  30. Deb K (2013) Optimization for engineering design: algorithms and examples. PHI, second edition

  31. Jiang X, Li S (2017) BAS: Beetle Antennae Search algorithm for optimization problems. arXiv preprint. abs/1710.10724

  32. Khan AH, Cao X, Li S, Katsikis VN, Liao L (2020) BAS-ADAM: an ADAM based approach to improve the performance of beetle antennae search optimizer. IEEE/CAA Journal of Automatica Sinica 7(2):461–471

    Article  Google Scholar 

  33. Zhu Z, Zhang Z, Man W, Tong X, Qiu J, Li F (2018) A new beetle antennae search algorithm for multi-objective energy management in microgrid. In Proc. 13th IEEE Conf. Industrial Electronics and Applications (ICIEA), pp 1599–1603

  34. Wu Q, Shen X, Jin Y, Chen Z, Li S, Khan AH, Chen D (2019) Intelligent beetle antennae search for UAV sensing and avoidance of obstacles. Sensors 19:1758

    Article  Google Scholar 

  35. Xu X, Deng K, Shen B (2020) A beetle antennae search algorithm based on Levy flights and adaptive strategy. Systems Science & Control Engineering 8:35–47

    Article  Google Scholar 

  36. de Boor C (1978) A practical guide to splines, vol. 27. Springer-verlag New York

Download references

Acknowledgements

Predrag Stanimirović acknowledges support from the Ministry of Education, Science and Technological Development, Republic of Serbia, Grant No. 174013.

Author information

Authors and Affiliations

  1. Department of Economics, Division of Mathematics and Informatics, National and Kapodistrian University of Athens, Sofokleous 1 Street, 10559, Athens, Greece

    Vasilios N. Katsikis & Spyridon D. Mourtas

  2. Faculty of Sciences and Mathematics, University of Niš, Višegradska 33, 18000, Niš, Serbia

    Predrag S. Stanimirović

  3. Swansea University, Swansea, UK

    Shuai Li

  4. School of Management, Shanghai University, Shanghai, China

    Xinwei Cao

Authors
  1. Vasilios N. Katsikis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Spyridon D. Mourtas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Predrag S. Stanimirović
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shuai Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xinwei Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vasilios N. Katsikis.

Ethics declarations

Conflict of Interest

The authors declare that they have no conflict of interest.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Katsikis, V.N., Mourtas, S.D., Stanimirović, P.S. et al. Time-Varying Mean-Variance Portfolio Selection under Transaction Costs and Cardinality Constraint Problem via Beetle Antennae Search Algorithm (BAS). SN Oper. Res. Forum 2, 18 (2021). https://doi.org/10.1007/s43069-021-00060-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s43069-021-00060-5

Keywords

Search

Navigation