No Detail Found!

SOLVING PORTFOLIO SELECTION PROBLEM USING PARTICLE SWARM OPTIMIZATION WITH CARDINALITY AND BOUNDING CONSTRAINTS

Author(s)
THERESA N. ABIODUN Department of Computer and Information Sciences, Covenant University, Ota, Nigeria
AYODELE A. ADEBIYI Department of Computer and Information Sciences, Covenant University, Ota, Nigeria; Department of Computer Science, Landmark University, Omu-Aran, Nigeria
MARION O. ADEBIYI Department of Computer and Information Sciences, Covenant University, Ota, Nigeria; Department of Computer Science, Landmark University, Omu-Aran, Nigeria
Abstract
The portfolio selection of assets for an investment by investors has remain a challenge in building appropriate portfolio of assets when investing hard earned money into different assets in order to maximize returns and minimize associated risk. Different models have been used to resolve the portfolio selection problem but with some limitations due to the complexity and instantaneity of the portfolio optimization model, however, particle swarm optimization (PSO) algorithm is a good alternative to meet the challenge. This study applied cardinality and bounding constraints to portfolio selection model using a meta-heuristic technique of particle swarm optimization. The implementation of the developed model was done with python programming language. The results of this study were compared with that of the genetic algorithms technique as found in extant literature. The results obtained with the model developed shows that particle swarm optimization approach gives a better result than genetic algorithm in solving portfolio selection problem.
Publication Details
Page(s) 780-787
DOI DOI not available
Published Journal: Journal of Theoretical and Applied Information Technology, Volume: 98, Issue: 5, Year: 2020

Request the full text from PASTIC

Keywords
Genetic Algorithm, Particle Swarm Optimization, Cardinality and Bounding Constraints.
0

Citations

0

Downloads

35

Views