Abstract
This paper describes a novel initialization for Deterministic Particle Swarm Optimization (DPSO), based on choosing specific dense initial positions and velocities for particles. This choice tends to induce orthogonality of particles’ trajectories, in the early iterations, in order to better explore the search space. Our proposal represents an improvement, by the same authors, of the theoretical analysis on a previously proposed PSO reformulation, namely the initialization ORTHOinit. A preliminary experience on constrained Portfolio Selection problems confirms our expectations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks, Perth, Australia, IV, pp. 1942–1948. IEEE Service Center, Piscataway, NJ (1995)
Clerc, M., Kennedy, J.: The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6(1), 58–73 (2002)
Ozcan, E., Mohan, C.K.: Particle swarm optimization: surfing the waves. In: Proceedings of the 1999 IEEE Congress on Evolutionary Computation, pp. 1939–1944. IEEE Service Center, Piscataway (1999)
Poli, R.: The Sampling Distribution of Particle Swarm Optimisers and their Stability. Technical report CSM-465, University of Essex (2007)
Trelea, I.C.: The particle swarm optimization algorithm: convergence analysis and parameter selection. Inf. Process. Lett. 85, 317–325 (2003)
van den Berg, F., Engelbrecht, F.: A study of particle swarm optimization particle trajectories. Inf. Sci. 176, 937–971 (2006)
Campana, E.F., Diez, M., Fasano, G., Peri, D.: Initial particles position for PSO, in bound constrained optimization. In: Tan, Y., Shi, Y., Mo, H. (eds.) Advances in Swarm Intelligence. LNCS, vol. 7928, pp. 112–119. Springer, Heidelberg (2013)
Diez, M., Serani, A., Leotardi, C., Campana, E.F., Peri, D., Iemma, U., Fasano, G., Giove, S.: A proposal of PSO particles’ initialization for costly unconstrained optimization problems: ORTHOinit. In: Tan, Y., Shi, Y., Coello Coello, C.A. (eds.) Advances in Swarm Intelligence. LNCS, vol. 8794, pp. 126–133. Springer, Switzerland (2014)
Campana, E.F., Fasano, G., Pinto, A.: Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization. J. Global Optim. 48, 347–397 (2010)
Zheng, Y., Ma, L., Zhang, L., Qian, J.: On the convergence analysis and parameter selection in particle swarm optimization. In: Proceedings of the International Conference on Machine Learning and Cybernetics, pp. 1802–1807 (2003)
Corazza, M., Fasano, G., Gusso, R.: Particle Swarm Optimization with non-smooth penalty reformulation, for a complex portfolio selection problem. Appl. Math. Comput. 224, 611–624 (2013)
Acknowledgments
The research is partially supported by the Italian Flagship Project RITMARE, coordinated by the Italian National Research Council and funded by the Italian Ministry of Education, University and Research. Matteo Diez is grateful to Dr Woei-Min Lin and Dr Ki-Han Kim of the US Navy Office of Naval Research, for their support through NICOP grant N62909-15-1-2016.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Diez, M., Serani, A., Leotardi, C., Campana, E.F., Fasano, G., Gusso, R. (2016). Dense Orthogonal Initialization for Deterministic PSO: ORTHOinit+ . In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2016. Lecture Notes in Computer Science(), vol 9712. Springer, Cham. https://doi.org/10.1007/978-3-319-41000-5_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-41000-5_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40999-3
Online ISBN: 978-3-319-41000-5
eBook Packages: Computer ScienceComputer Science (R0)