Skip to main content
Log in

A Comparative Study of Four Parallel and Distributed PSO Methods

New Generation Computing Aims and scope Submit manuscript

Abstract

We present four new parallel and distributed particle swarm optimization methods consisting in a genetic algorithm whose individuals are co-evolving swarms, an “island model”-based multi-swarm system, where swarms are independent and interact by means of particle migrations at regular time steps, and their respective variants enriched by adding a repulsive component to the particles. We study the proposed methods on a wide set of problems including theoretically hand-tailored benchmarks and complex real-life applications from the field of drug discovery, with a particular focus on the generalization ability of the obtained solutions. We show that the proposed repulsive multi-swarm system has a better optimization ability than all the other presented methods on all the studied problems. Interestingly, the proposed repulsive multi-swarm system is also the one that returns the most general solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Archetti, F., Giordani, I. and Vanneschi, L., “Genetic programming for anticancer therapeutic response prediction using the NCI-60 dataset,” Computers and Operations Research, 37, 8, pp. 1395–1405, 2010. Impact Factor: 1.789.

  2. Archetti F., Giordani I., Vanneschi L., (2010) “Genetic programming for QSAR investigation of docking energy”. Applied Soft Computing 10, 1, 170–182

    Article  Google Scholar 

  3. Archetti, F., Messina, E., Lanzeni, S. and Vanneschi, L., “Genetic programming for computational pharmacokinetics in drug discovery and development,” Genetic Programming and Evolvable Machines, 8, 4, pp. 17–26, 2007.

    Article  Google Scholar 

  4. Arumugam, M. S. and Rao, M., “On the improved performances of the particle swarm optimization algorithms with adaptive parameters, cross-over operators and root mean square (rms) variants for computing optimal control of a class of hybrid systems,” Journal of Applied Soft Computing, 8, pp. 324–336, 2008.

    Article  Google Scholar 

  5. Blackwell, T. and Branke, J., “Multi-swarm optimization in dynamic environments,” in EvoWorkshops (Raidl, G. R. et al. eds.), LNCS, Springer, pp. 489–500, 2004.

  6. Blackwell, T. M., “Swarm music: improvised music with multi-swarms,” in Proc. of the 2003 AISB Symp. on Artificial Intelligence and Creativity in Arts and Science, pp. 41–49, 2003.

  7. Bonabeau, E., Dorigo, M. and Theraulaz, G., Swarm Intelligence: From Natural to Artificial Systems (Santa Fe Institute Studies in the Sciences of Complexity), Oxford University Press, New York, NY, 1999.

  8. Cagnoni, S., Vanneschi, L., Azzini, A. and Tettamanzi, A., “A critical assessment of some variants of particle swarm optimization,” in European Workshop on Bio-inspired algorithms for continuous parameter optimisation, EvoNUM'08, Springer Verlag, pp. 565–574, 2008.

  9. Clerc, M. ed., Particle Swarm Optimization, ISTE, 2006.

  10. Diosan, L. and Oltean, M., “Evolving the structure of the particle swarm optimization algorithms,” in EvoCOP'06, Springer Verlag, pp. 25–36, 2006.

  11. Diosan, L. and Oltean, M., “What else is evolution of pso telling us?” Journal of Artificial Evolution and Applications, 1, 5, pp. 1–12, 2008.

    Article  Google Scholar 

  12. Fernández, F., Tomassini, M. and Vanneschi, L., “An empirical study of multipopulation genetic programming,” Genetic Programming and Evolvable Machines, 4, 1, pp. 21–52, 2003.

    Article  MATH  Google Scholar 

  13. Jiang, Y., Huang, W., Chen, L., “Applying multi-swarm accelerating particle swarm optimization to dynamic continuous functions,” in 2009 Second International Workshop on Knowledge Discovery and Data Mining, pp. 710–713, 2009.

  14. Kameyama, K., “Particle swarm optimization - a survey,” IEICE Transactions, 92-D, 7, pp. 1354–1361, 2009.

  15. Kennedy, J. and Eberhart, R., “Particle swarm optimization,” in Proc. IEEE Int. conf. on Neural Networks, 4, IEEE Computer Society, pp. 1942–1948, 1995.

  16. Kennedy, J. and Mendes, R., “Population structure and particle swarm performance,” in IEEE Congress on Evolutionary Computation, CEC'02, IEEE Computer Society, pp. 1671–1676, 2002.

  17. Kennedy, J., Poli, R. and Blackwell, T., “Particle swarm optimization: an overview,” Swarm Intelligence, 1, 1, pp. 33–57, 2007.

    Article  Google Scholar 

  18. Kennedy, J. and Eberhart, R. C., Swarm Intelligence, Morgan Kaufmann Publishers, 2001.

  19. Kwong, H. and Jacob, C., “Evolutionary exploration of dynamic swarm behavior,” in IEEE Congress on Evolutionary Computation, CEC'03, IEEE Press, pp. 367–374, 2003.

  20. Li, C. and Yang, S., “Fast multi-swarm optimization for dynamic optimization problems,” in ICNC '08: Proc. of the 2008 Fourth International Conference on Natural Computation, Washington, DC, USA, IEEE Computer Society, pp. 624–628, 2008.

  21. Liang, J. J. and Suganthan, P. N., “Dynamic multi-swarm particle swarm optimizer with local search,” in 2005 IEEE Congress on Evolutionary Computation, CEC 2005, 1, pp. 522–528, 2005.

  22. Lu, F.-Q., Huang, M., Ching, W.-K., Wang, X.-W. and Sun, X.-l., “Multi-swarm particle swarm optimization based risk management model for virtual enterprise,” in GEC '09: Proc. of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, New York, NY, USA, ACM, pp. 387–392, 2009.

  23. Niu, B., Zhu, Y., He, X. and Wu, H., “MCPSO: A multi-swarm cooperative particle swarm optimizer,” Applied Mathematics and Computation, 2, 185, pp. 1050–1062, 2007.

    Article  Google Scholar 

  24. Poli, R., “Analysis of the publications on the applications of particle swarm optimisation,” J. Artif. Evol. App., 2008, 1, pp. 1–10, January 2008.

  25. Poli, R., “Analysis of the publications on the applications of particle swarm optimization,” Journal of Artificial Evolution and Applications, 2009, (in press).

  26. N. C. M. Project, National Cancer Institute, Bethesda MD, 2008. See http://genome-www.stanford.edu/nci60/.

  27. Riget, J. and Vesterstrm, J., “A diversity-guided particle swarm optimizer - the arpso,” Technical report, Dept. of Comput. Sci., Aarhus Univ., Denmark, 2002.

  28. Ross, S. M., Introduction to Probability and Statistics for Engineers and scientists, Academic Press, New York, 2000.

    MATH  Google Scholar 

  29. Ross, D. T. et al., “Systematic variation in gene expression patterns in human cancer cell lines,” Nat Genet, 24, 3, pp. 227–235, 2000.

    Article  Google Scholar 

  30. Sherf, U. et al., “A gene expression database for the molecular pharmacology of cancer”. Nat Genet 24, 3, pp. 236–244, 2000.

    Article  Google Scholar 

  31. Shi, Y. H. and Eberhart, R., “A modified particle swarm optimizer,” in Proc. IEEE Int. Conference on Evolutionary Computation, IEEE Computer Society, pp. 69–73, 1998.

  32. Smola, A. J. and Scholkopf, B., “A Tutorial on Support Vector Regression,” Technical Report Technical Report Series - NC2-TR-1998-030, NeuroCOLT2, 1999.

  33. Srinivasan, D. and Seow, T. H., “Particle swarm inspired evolutionary algorithm (ps-ea) for multi-objective optimization problem,” in IEEE Congress on Evolutionary Computation, CEC03, IEEE Press, pp. 2292–2297, 2003.

  34. Suganthan, P., Hansen, N., Liang, J., Deb, K., Chen, Y., Auger, A. and Tiwari, S., “Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization,” Technical Report Number 2005005, Nanyang Technological University, 2005.

  35. Valle, Y. D., Venayagamoorthy, G., Mohagheghi, S., Hernandez, J. and Harley, R., “Particle swarm optimization: Basic concepts, variants and applications in power systems,” IEEE Transactions on Evolutionary Computation, 12, 2, pp. 171–195, 2008.

    Article  Google Scholar 

  36. Vanneschi, L., “Theory and Practice for Efficient Genetic Programming,” Ph.D. thesis, Faculty of Sciences, University of Lausanne, Switzerland, 2004.

  37. Vanneschi, L., Codecasa, D. and Mauri, G., “A study of parallel and distributed particle swarm optimization methods,” in Proc. of the 2nd workshop on Bio-inspired algorithms for distributed systems, BADS'10, New York, NY, USA, ACM, pp. 9–16, 2010.

  38. Vanneschi, L., Codecasa, D. and Mauri, G., “An empirical comparison of parallel and distributed particle swarm optimization methods,” in Proc. of the Genetic and Evolutionary Computation Conference, GECCO 2010 (Branke, J. et al. eds.), ACM Press, 2010. To appear.

  39. Wang, Y. and Yang, Y., “An interactive multi-swarm pso for multiobjective optimization problems,” Expert Systems with Applications, In press, 2008. On-line version available at http://www.sciencedirect.com.

  40. Weka, A multi-task machine learning software developed by Waikato University, 2006. See http://www.cs.waikato.ac.nz/ml/weka.

  41. White, T. and Pagurek, B., “Towards multi-swarm problem solving in networks,” in Proc. of Third International Conference on Multi-Agent Systems (ICMAS'98), IEEE Computer Society, pp. 333–340, 1998.

  42. Wu, Z. and Zhou, J., “A self-adaptive particle swarm optimization algorithm with individual coefficients adjustment,” in Proc. IEEE International Conference on Computational Intelligence and Security, CIS'07, IEEE Computer Society, pp. 133–136, 2007.

  43. You, X., Liu, S. and Zheng, W., “Double-particle swarm optimization with induction enhanced evolutionary strategy to solve constrained optimization problems,” in IEEE International Conference on Natural Computing, ICNC'07, IEEE Computer Society, pp. 527–531, 2007.

  44. Zhigljavsky, A. and Zilinskas, A., “Stochastic Global Optimization,” Springer Optimization and Its Applications, 9, Springer, 2008.

  45. Zhiming, L., Cheng, W. and Jian, L., “Solving constrained optimization via a modified genetic particle swarm optimization,” in Workshop on Knowledge Discovery and Data Mining, WKDD'08, IEEE Computer Society, pp. 217–220, 2008.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Leonardo Vanneschi.

About this article

Cite this article

Vanneschi, L., Codecasa, D. & Mauri, G. A Comparative Study of Four Parallel and Distributed PSO Methods. New Gener. Comput. 29, 129–161 (2011). https://doi.org/10.1007/s00354-010-0102-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00354-010-0102-z

Keywords

Navigation