DOI QR코드

DOI QR Code

A Study on Portfolios Using Simulated Annealing and Tabu Search Algorithms

시뮬레이티드 어닐링와 타부 검색 알고리즘을 활용한 포트폴리오 연구

  • Woo Sik Lee (College of Business Administration, Gyeongsang National University)
  • 이우식 (경상국립대학교 경영대학)
  • Received : 2024.03.28
  • Accepted : 2024.04.09
  • Published : 2024.04.30

Abstract

Metaheuristics' impact is profound across many fields, yet domestic financial portfolio optimization research falls short, particularly in asset allocation. This study delves into metaheuristics for portfolio optimization, examining theoretical and practical benefits. Findings indicate portfolios optimized via metaheuristics outperform the Dow Jones Index in Sharpe ratios, underscoring their potential to enhance risk-adjusted returns significantly. Tabu search, in comparison to Simulated Annealing, demonstrates superior performance by efficiently navigating the search space. Despite these advancements, practical application remains challenging due to the complexities in metaheuristic implementation. The study advocates for broader algorithmic exploration, including population-based metaheuristics, to refine asset allocation strategies further. This research marks a step towards optimizing portfolios from an extensive array of financial assets, aiming for maximum efficacy in investment outcomes.

Keywords

References

  1. D. Ahn, and S. Park, "Linear programming models using a Dantzig type risk f or portf olio optimization," The Korean Journal of applied Statistics, vol. 35, no. 2, pp. 229-250, (2022).
  2. W. Yoo, and Y. Choi, "A Study on the Improvement of Strategic Asset Allocation Using Global Investor's Reference Portfolio," Korea Finance Association Conference, pp. 214-324, (2019).
  3. R. Mansini, W. Ogryczak, M. Speranza, "Twenty years of linear programming based portfolio optimization," European Journal of Operational Research, vol. 234, pp. 518-535, (2014).
  4. T. Kim, "The Optimal Mean-Variance Portfolio Formulation by Mathematical Planning," Korean Society of Industrial and Systems Engineering, vol. 32 no. 4, pp. 63-71, (2009).
  5. R. Mansini and M. Speranza, "Heuristic algorithms for the portfolio selection problem with minimum transaction lots," European Journal of Operational Research, vol. 114, pp. 219-233, (1999).
  6. I. Mohammadi and H. M. Khoshouei and A. A. Chadegan, "Portfolio optimization in the capital market bubble space, an application of meta-heuristic algorithms," Managerial Finance, vol. 49, pp. 741-757, (2022).
  7. K. Erwin and A. Engelbrecht, "Meta-heuristics for portfolio optimization," Soft Computing, vol. 27, pp. 19045-19073, (2023).
  8. J. Park, and D. Kim, "Portfolio Performance Analysis using Genetic Algorithms and Fund standardization". JOURNAL OF CORPORATION AND INNOVATION, vol. 44, no. 2, pp. 77-89, (2021).
  9. J. Kim, and J. Lee, "A Study on the Ef f icient Selection of the Assets in the Reduced Search Space using Monte-Carlo Genetic Algorithm," Journal of Korean Institute of Intelligent Systems, vol. 30, no. 1, pp. 21-27, (2020).
  10. P. Jang, "Performance Analysis of Trading Strategy using Gradient Boosting Machine Learning and Genetic Algorithm," Journal of the Korea Society of Computer and Information, vol. 27, no. 11, pp. 147-155, (2022).
  11. S. Kim and C. Kim, and K. Han, "Using Tabu Search f or L(2,1)-coloring Problem of Graphs with Diameter 2," Journal of Digital Convergence, vol. 20, no. 2, pp. 345-351, (2022).