The effect of velocity sparsity on the performance of cardinality constrained particle swarm optimization
The Particle Swarm Optimization (PSO) algorithm is a flexible heuristic optimizer that can be used for solving cardinality constrained binary optimization problems. In such problems, only K elements of the N-dimensional solution vector can be non-zero. The typical solution is to use a mapping function to enforce the cardinality constraint on the trial PSO solution. In this paper, we show that when K is small compared to N, the use of the mapped solution in the velocity vector tends to lead to early stagnation. As a solution, we recommend to use the untransformed solution as a direction in the velocity vector. We use numerical experiments to document the gains in performance when K is small compared to N.
KeywordsBinary particle swarm optimization Cardinality mapping Portfolio optimization
This paper was written while Chunlin Wan was visiting the finance department of the Solvay Business School at Vrije Universiteit Brussel. We are grateful to the Editor (Oleg Prokopyev), the associate editor, an anonymous referee, Xiang Deng, Paola Festa, Jiayin Gu, Nanjing Huang, Joao Miranda, Giang Nguyen, Wajid Raza and Marjan Wauters for helpful comments and suggestions. Financial support from the Chinese Scholarship Council and the National Natural Science Foundation of China (Grant Number 71742004) is gratefully acknowledged.
- 1.Ardia, D., Boudt, K., Carl, P., Mullen, K.M., Peterson, B.G.: Differential evolution with DEoptim: an application to non-convex portfolio optimization. R J. 3(1), 27–34 (2011)Google Scholar
- 2.Ardia, D., Mullen, K., Peterson, B., Ulrich, J.: DEoptim: differential evolution optimization in R. R package version 2.2-4 (2007)Google Scholar
- 4.Chang, T.-J., Yang, S.-C., Chang, K.-J.: Portfolio optimization problems in different risk measures using genetic algorithm. Expert Syst. Appl. 36(7), 10529–10537 (2009)Google Scholar
- 6.Deng, G.-F., Lin, W.-T., Lo, C.-C.: Markowitz-based portfolio selection with cardinality constraints using improved particle swarm optimization. Expert Syst. Appl. 39(4), 4558–4566 (2012)Google Scholar
- 10.Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Paper Presented at IEEE International Conference on Neural Networks, Perth, Australia. IEEE Service Center, Piscataway, NJ (1995)Google Scholar
- 11.Markowitz, H.: Portfolio selection. J. Finance 7(1), 77–91 (1952)Google Scholar
- 12.Poli, R., Kennedy, J., Blackwell, T.: Particle swarm optimization. Swarm Intell. 1(1), 33–57 (2007)Google Scholar
- 13.Pouya, A.R., Solimanpur, M., Rezaee, M.J.: Solving multi-objective portfolio optimization problem using invasive weed optimization. Swarm Evol. Comput. 28, 42–57 (2016)Google Scholar
- 14.Ratnaweera, A., Halgamuge, S.K., Watson, H.C.: Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans. Evol. Comput. 8(3), 240–255 (2004)Google Scholar
- 15.Sedighizadeh, D., Masehian, E.: Particle swarm optimization methods, taxonomy and applications. Int. J. Comput. Theory Eng. 1(5), 486–502 (2009)Google Scholar