Zi xuan loke and Say leng goh and Graham Kendall and Salwani Abdullah and Nasser r. Sabar (2023) Portfolio Optimization Problem: A Taxonomic Review of Solution Methodologies. IEEE Access. pp. 1-21. ISSN 2169-3536
Text
ABSTRACT.pdf Download (39kB) |
|
Text
FULL TEXT.pdf Restricted to Registered users only Download (3MB) | Request a copy |
Abstract
This survey paper provides an overview of current developments for the Portfolio Optimisation Problem (POP) based on articles published from 2018 to 2022. It reviews the latest solution methodologies utilised in addressing POPs in terms of mechanisms and performance. The methodologies are categorised as Metaheuristic, Mathematical Optimisation, Hybrid Approaches, Matheuristic and Machine Learning. The datasets (benchmark, real-world, and hypothetical) utilised in portfolio optimisation research are provided. The state-of-the-art methodologies for benchmark datasets are presented accordingly. Populationbased metaheuristics are the most preferred techniques among researchers in addressing the POP. Hybrid approaches is an emerging trend (2018 onwards). The OR-Library is the most widely used benchmark dataset for researchers to compare their methodologies in addressing POP. The research challenges and opportunities are discussed. The summarisation of the published papers in this survey provides an insight to researchers in identifying emerging trends and gaps in this research area.
Item Type: | Article |
---|---|
Keyword: | Hybrid approaches, machine learning, mathematical optimisation, matheuristic, metaheuristic. |
Subjects: | Q Science > QA Mathematics > QA1-939 Mathematics Q Science > QA Mathematics > QA1-939 Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science |
Department: | FACULTY > Faculty of Computing and Informatics |
Depositing User: | ABDULLAH BIN SABUDIN - |
Date Deposited: | 29 Nov 2023 10:05 |
Last Modified: | 29 Nov 2023 10:05 |
URI: | https://eprints.ums.edu.my/id/eprint/37693 |
Actions (login required)
View Item |