In this paper, it is shown a comparison of the application of particle swarm optimization and genetic algorithms to portfolio management, in a constrained portfolio optimization problem where no short sales are allowed. The objective function to be minimized is the value at risk calculated using historical simulation where several strategies for handling the constraints of the problem were implemented. The results of the experiments performed show that, generally speaking, the methods are capable of consistently finding good solutions quite close to the best solution found in a reasonable amount of time. In addition, it is demonstrated statistically that the algorithms, on average, do not all consistently achieve the same best solution. PSO turned out to be faster than GA, both in terms of number of iterations and in terms of total running time. However, PSO appears to be much more sensitive to the initial position of the particles than GA. Tests were also made regarding the number of particles needed to solve the problem, and 50 particles/chromosomes seem to be enough for problems up to 20 assets.

doi.org/10.1002/int.20360, hdl.handle.net/1765/73562
International Journal of Intelligent Systems
Erasmus School of Economics

Dallagnol, V. A. F., van den Berg, J., & Mous, L. (2009). Portfolio management using value at risk: A comparison between genetic algorithms and particle swarm optimization. International Journal of Intelligent Systems, 24(7), 766–792. doi:10.1002/int.20360