ORCID

Abstract

This work chronicles research into the solution of portfolio problems with metaheuristic solvers. In particular, a genetic algorithm for solving the cardinality constrained portfolio optimisation problem with minimum asset proportions is presented and tested on the datasets of [1]. These datasets form benchmark instances used to test portfolio optimisers and are based upon indices ranging from 31 to 225 assets. The results of the GA are indicatively compared to solutions of [2] for a variety of minimum proportions, suggesting that solutions exhibit certain clustering characteristics for higher proportions. Further work is also discussed. This research is based upon the first part of the ongoing PhD thesis of the first author.

DOI

10.1145/3319619.3321900

Publication Date

2019-07-16

Publication Title

Default journal

First Page

358

Last Page

359

Embargo Period

2023-07-19

Organisational Unit

School of Engineering, Computing and Mathematics

Share

COinS