Optimasi Portofolio Saham Pertambangan pada Indeks LQ45 Menggunakan Dream Optimization Algorithm

Authors

  • Mahaputra Hidayat Universitas Bhayangkara
  • Syariful Alim Universitas Bhayangkara
  • Arif Arizal Universitas Bhayangkara

DOI:

https://doi.org/10.31102/jatim.v7i2.4242

Keywords:

Dream Optimization Algorithm, LQ45, optimasi portofolio, saham pertambangan, metaheuristik

Abstract

Pemilihan bobot aset pada saham pertambangan menghadapi hubungan imbal hasil–risiko yang nonlinier, volatilitas tinggi, dan perubahan kondisi pasar. Penelitian ini bertujuan mengimplementasikan Dream Optimization Algorithm (DOA) untuk membentuk portofolio saham pertambangan yang termasuk dalam indeks LQ45. Harga penutupan harian Yahoo Finance diminta untuk periode 1 September 2021 hingga 31 Agustus 2026. Dari 14 emiten awal, 13 emiten memenuhi syarat minimal 504 observasi dan menghasilkan panel bersama sebanyak 752 hari pada 7 Juli 2023 sampai 31 Agustus 2026. Fungsi objektif memaksimalkan Sharpe ratio dengan kendala investasi penuh, bobot nonnegatif, dan batas alokasi 20% per saham. DOA dievaluasi melalui tiga jendela walk-forward, masing-masing dengan 504 hari pelatihan dan 63 hari pengujian, serta 10 pengulangan independen. Secara agregat, portofolio DOA menghasilkan imbal hasil tahunan -18,35%, volatilitas 35,37%, Sharpe ratio -0,519, Sortino ratio -0,634, dan maximum drawdown -34,57%. Dua jendela awal menghasilkan Sharpe ratio positif, tetapi penurunan tajam pada jendela ketiga menyebabkan kinerja agregat negatif. Simpangan baku Sharpe ratio pelatihan antarpengulangan berada pada rentang 0,0036 – 0,0090, yang menunjukkan proses optimasi stabil meskipun kinerja pasar di luar sampel tidak stabil. Temuan ini menunjukkan bahwa DOA berhasil diterapkan secara komputasional, tetapi belum menghasilkan kinerja investasi yang konsisten pada seluruh periode pengujian.

Downloads

Download data is not yet available.

References

[1] H. Markowitz, “Portfolio selection,” The Journal of Finance, vol. 7, no. 1, pp. 77–91, 1952, doi: 10.2307/2975974.

[2] W. F. Sharpe, “Mutual fund performance,” The Journal of Business, vol. 39, no. 1, pp. 119–138, 1966.

[3] J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of ICNN’95—International Conference on Neural Networks, 1995, pp. 1942–1948, doi: 10.1109/ICNN.1995.488968.

[4] K. Deb, “An efficient constraint handling method for genetic algorithms,” Computer Methods in Applied Mechanics and Engineering, vol. 186, no. 2–4, pp. 311–338, 2000, doi: 10.1016/S0045-7825(99)00389-8.

[5] A. W. Lo, “The statistics of Sharpe ratios,” Financial Analysts Journal, vol. 58, no. 4, pp. 36–52, 2002, doi: 10.2469/faj.v58.n4.2453.

[6] Y. Lang and Y. Gao, “Dream Optimization Algorithm (DOA): A novel metaheuristic optimization algorithm inspired by human dreams and its applications to real-world engineering problems,” Computer Methods in Applied Mechanics and Engineering, vol. 436, art. 117718, 2025, doi: 10.1016/j.cma.2024.117718.

[7] H. A. Choudhury, N. Sinha, and M. Saikia, “Application of nature-inspired algorithms (NIA) for optimization of video compression,” Journal of Intelligent & Fuzzy Systems, vol. 38, no. 3, pp. 3419–3443, 2020, doi: 10.3233/JIFS-190308.

[8] S. Gupta, K. Deep, and A. P. Engelbrecht, “A memory guided sine cosine algorithm for global optimization,” Engineering Applications of Artificial Intelligence, vol. 93, art. 103718, 2020, doi: 10.1016/j.engappai.2020.103718.

[9] A. V. Lakshmi and P. Mohanaiah, “Intelligent facial emotion recognition based on hybrid whale optimization algorithm and sine cosine algorithm,” Microprocessors and Microsystems, vol. 95, art. 104718, 2022, doi: 10.1016/j.micpro.2022.104718.

[10] M. Kaur, R. Kaur, N. Singh, and G. Dhiman, “SChoA: A newly fusion of sine and cosine with chimp optimization algorithm for HLS of datapaths in digital filters and engineering applications,” Engineering with Computers, vol. 38, pp. 975–1003, 2022, doi: 10.1007/s00366-020-01233-2.

[11] G. Dhiman, “SSC: A hybrid nature-inspired meta-heuristic optimization algorithm for engineering applications,” Knowledge-Based Systems, vol. 222, art. 106926, 2021, doi: 10.1016/j.knosys.2021.106926.

[12] Y. Fan, P. Wang, A. A. Heidari, M. Wang, X. Zhao, H. Chen, and C. Li, “Rationalized fruit fly optimization with sine cosine algorithm: A comprehensive analysis,” Expert Systems with Applications, vol. 157, art. 113486, 2020, doi: 10.1016/j.eswa.2020.113486.

[13] D. Sattar and R. Salim, “A smart metaheuristic algorithm for solving engineering problems,” Engineering with Computers, vol. 37, no. 3, pp. 2389–2417, 2021, doi: 10.1007/s00366-020-00951-x.

[14] J. L. J. Pereira, B. J. Ma, M. B. Francisco, R. F. R. Junior, and G. F. Gomes, “A comparison between chaos theory and Lévy flights in sunflower optimization for feature selection,” Expert Systems, vol. 40, no. 8, art. e13330, 2023, doi: 10.1111/exsy.13330.

[15] C. Taramsco, B. Crawford, R. Soto, E. M. Cortés-Toro, and R. Olivares, “A new metaheuristic based on vapor-liquid equilibrium for solving a new patient bed assignment problem,” Expert Systems with Applications, vol. 158, art. 113506, 2020, doi: 10.1016/j.eswa.2020.113506.

[16] M. Li, Z. Liu, and H. Song, “An improved algorithm optimization algorithm based on Runge–Kutta and golden sine strategy,” Expert Systems with Applications, vol. 247, art. 123262, 2024, doi: 10.1016/j.eswa.2024.123262.

[17] M. Verij Kazemi and E. Fazeli Veysari, “A new optimization algorithm inspired by the quest for the evolution of human society: Human felicity algorithm,” Expert Systems with Applications, vol. 193, art. 116468, 2022, doi: 10.1016/j.eswa.2021.116468.

[18] J. Wang, Y. Chen, C. Lu, A. A. Heidari, Z. Wu, and H. Chen, “The status-based optimization: Algorithm and comprehensive performance analysis,” Neurocomputing, vol. 647, art. 130603, 2025, doi: 10.1016/j.neucom.2025.130603.

Downloads

Published

2026-11-05

How to Cite

Hidayat, M., Alim, S., & Arizal , A. (2026). Optimasi Portofolio Saham Pertambangan pada Indeks LQ45 Menggunakan Dream Optimization Algorithm. Jurnal Aplikasi Teknologi Informasi Dan Manajemen (JATIM), 7(2), 175–185. https://doi.org/10.31102/jatim.v7i2.4242