Abstract
In portfolio optimization, the fundamental goal of an investor is to optimally allocate investments between different assets. Mean-variance optimization methods make unrealistic assumptions to solve the problem of optimal allocation. On the other hand, when realistic constraints like holding size and cardinality are introduced it leads to optimal asset allocation which differ from the mean variance optimization. The resulting optimization problem become quite complex as it exhibits multiple local extrema and discontinuities. Heuristic algorithms work well for the complex problem. Therefore, a heuristic algorithm is developed which is based on hill climbing complete (HC-C). It is utilized to solve the extended portfolio optimization problem. In order to validate its performance, the proposed HC-C is tested with standard portfolio optimization problem. Experimental results are benchmarked with the quadratic programming method and threshold accepting (TA) algorithm.
Recommended Citation
John, C. (2022). Complete Neighbourhood Search Heuristic Algorithm for Portfolio Optimization. Tanzania Journal of Engineering and Technology (TJET), 40(2), 97-104. https://doi.org/https://doi.org/10.52339/tjet.v40i2.736
Publisher Name
University of Dar es Salaam
Included in
Computer-Aided Engineering and Design Commons, Cybersecurity Commons, Databases and Information Systems Commons, Dynamics and Dynamical Systems Commons, Dynamic Systems Commons, Electrical and Electronics Commons, Electro-Mechanical Systems Commons, Electronic Devices and Semiconductor Manufacturing Commons, Systems and Communications Commons