Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2017, Article ID 2013673, 15 pages
https://doi.org/10.1155/2017/2013673
Research Article

GPU-Based Parallel Particle Swarm Optimization Methods for Graph Drawing

1College of Management Science and Engineering, Shandong Normal University, Jinan, Shandong, China
2College of Business, The University of Texas at San Antonio, San Antonio, TX, USA

Correspondence should be addressed to Jianhua Qu; moc.361@8791hjuq

Received 17 March 2017; Accepted 15 June 2017; Published 30 July 2017

Academic Editor: Filippo Cacace

Copyright © 2017 Jianhua Qu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. E. Kruja, J. Marks, A. Blair, and R. Waters, “A short note on the history of graph drawing,” in Proceedings of the 9th Intl. Symp. Graph Drawing (GD ’01), vol. 2265, pp. 272–286, Springer-Verlag, London, UK.
  2. W. T. Tutte, “How to draw a graph,” Proceedings of the London Mathematical Society. Third Series, vol. 13, pp. 743–767, 1963. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. K. Sugiyama, S. Tagawa, and M. Toda, “Methods for visual understanding of hierarchical system structures,” Institute of Electrical and Electronic Engineers. Transactions on Systems, Man, and Cybernetics, vol. 11, no. 2, pp. 109–125, 1981. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. P. Eades, “A heuristic for graph drawing,” Congressus Numerantium, vol. 42, pp. 149–160, 1984. View at Google Scholar
  5. M. Chimani and C. Gutwenger, “Algorithms for the hypergraph and the minor crossing number problems,” Journal of Graph Algorithms and Applications, vol. 19, no. 1, pp. 191–222, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. M. A. Bekos, M. Kaufmann, S. G. Kobourov, and A. Symvonis, “Smooth orthogonal layouts,” Journal of Graph Algorithms and Applications, vol. 17, no. 5, pp. 575–595, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. T. Kamada and S. Kawai, “An algorithm for drawing general undirected graphs,” Information Processing Letters, vol. 31, no. 1, pp. 7–15, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. T. M. J. Fruchterman and E. M. Reingold, “Graph drawing by force-directed placement,” Software—Practice and Experience, vol. 21, no. 11, pp. 1129–1164, 1991. View at Publisher · View at Google Scholar · View at Scopus
  9. R. C. Eberhart and J. Kennedy, “New optimizer using particle swarm theory,” in Proceedings of the Proc. 6th Intl. Symp. on Micro Machine and Human Science, pp. 39–43, Nagoya, Japan, 1995.
  10. R. C. Eberhart, J. Kennedy, and Y. Shi, Swarm Intelligence, Morgan Kaufmann Publishers, 2001.
  11. J. Park and K.-Y. Kim, “Instance variant nearest neighbor using particle swarm optimization for function approximation,” Applied Soft Computing Journal, vol. 40, pp. 331–341, 2016. View at Publisher · View at Google Scholar · View at Scopus
  12. F. Valdez, P. Melin, and O. Castillo, “Modular Neural Networks architecture optimization with a new nature inspired method using a fuzzy combination of Particle Swarm Optimization and Genetic Algorithms,” Information Sciences, vol. 270, pp. 143–153, 2014. View at Publisher · View at Google Scholar · View at Scopus
  13. M. R. Bonyadi, Z. Michalewicz, and X. Li, “An analysis of the velocity updating rule of the particle swarm optimization algorithm,” Journal of Heuristics, vol. 20, no. 4, pp. 417–452, 2014. View at Publisher · View at Google Scholar · View at Scopus
  14. D. Chen, J. Chen, H. Jiang, F. Zou, and T. Liu, “An improved PSO algorithm based on particle exploration for function optimization and the modeling of chaotic systems,” Soft Computing, vol. 19, no. 11, pp. 3071–3081, 2014. View at Publisher · View at Google Scholar · View at Scopus
  15. C. W. Cleghorn and A. P. Engelbrecht, “Particle swarm variants: standardized convergence analysis,” Swarm Intelligence, vol. 9, no. 2-3, pp. 177–203, 2015. View at Publisher · View at Google Scholar · View at Scopus
  16. N. B. Yahia, N. Bellamine, and H. B. Ghésala, “Combined use of community detection and particle swarm optimization to support decision making,” Journal of Computing, vol. 4, no. 5, pp. 157–163, 2012. View at Google Scholar
  17. L. Mussi, F. Daolio, and S. Cagnoni, “Evaluation of parallel particle swarm optimization algorithms within the CUDA™ architecture,” Information Sciences, vol. 181, no. 20, pp. 4642–4657, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. L. De P. Veronese and R. A. Krohling, “Swarm's flight: Accelerating the particles using C-CUDA,” in Proceedings of the 2009 IEEE Congress on Evolutionary Computation, CEC 2009, pp. 3264–3270, nor, May 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. W. Wang, Y. Hong, and T. Kou, “Performance gains in parallel particle swarm optimization via NVIDIA GPU,” in Proceedings of the Workshop on Computational Mathematics and Mechanics, 2009.
  20. Y. Zhou and Y. Tan, “GPU-based parallel particle swarm optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '09), pp. 1493–1500, May 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. NVIDIA, CUDA programming guide v. 8.0, NVIDIA Corporation, https://docs.nvidia.com/cuda/cuda-c-programming-guide/, 2016.
  22. B.-I. Koh, A. D. George, R. T. Haftka, and B. J. Fregly, “Parallel asynchronous particle swarm optimization,” International Journal for Numerical Methods in Engineering, vol. 67, no. 4, pp. 578–595, 2006. View at Publisher · View at Google Scholar · View at Scopus
  23. J. F. Chang, S. C. Chu, J. F. Roddick, and J. S. Pan, “A parallel particle swarm optimization algorithm with communication strategies,” Journal of Information Science and Engineering, vol. 21, no. 4, pp. 809–818, 2005. View at Google Scholar
  24. M. Waintraub, R. Schirru, and C. M. N. A. Pereira, “Multiprocessor modeling of parallel Particle Swarm Optimization applied to nuclear engineering problems,” Progress in Nuclear Energy, vol. 51, no. 6, pp. 680–688, 2009. View at Publisher · View at Google Scholar · View at Scopus
  25. Y. Zhang, D. Gallipoli, and C. Augarde, “Parallel Hybrid Particle Swarm Optimization and Applications in Geotechnical Engineering,” in Proceedings of the 4th Intl. Symp. Advances in Computation and Intelligence (ISICA’09), vol. 5821, pp. 466–475, Springer Berlin Heidelberg, Berlin, Germany.
  26. J.-M. Li, X.-J. Wang, R.-S. He, and Z.-X. Chi, “An efficient fine-grained parallel genetic algorithm based on GPU-accelerated,” in Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops, NPC 2007, pp. 855–862, chn, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  27. H. Prasain, G. K. Jha, P. Thulasiraman, and R. Thulasiram, A Parallel Particle Swarm Optimization Algorithm for Option Pricing. Doctoral dissertation, The University of Manitoba Winnipeg, Manitoba, Canada, 2010.
  28. S. Solomon, P. Thulasiraman, and R. K. Thulasiram, “Collaborative multi-swarm PSO for task matching using graphics processing units,” in Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference (GECCO '11), pp. 1563–1570, July 2011. View at Publisher · View at Google Scholar · View at Scopus
  29. V. Roberge and M. Tarbouchi, “Parallel particle swarm optimization on graphical processing unit for pose estimation,” WSEAS Transactions on Computers, vol. 11, no. 6, pp. 170–179, 2012. View at Google Scholar · View at Scopus
  30. D. L. Souza, O. N. Teixeira, D. C. Monteiro, and R. C. L. de Oliveira, “A new cooperative evolutionary multi-swarm optimizer algorithm based on CUDA architecture applied to engineering optimization,” in Proceedings of the Combinations of Intelligent Methods and Applications, pp. 95–115, Springer, Berlin, Germany, 2013.
  31. Y. Hu, “Efficient, high-quality force-directed graph drawing,” The Mathematica Journal, vol. 10, no. 1, pp. 37–71, 2011. View at Google Scholar
  32. M. Girvan and M. E. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 99, no. 12, pp. 7821–7826, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  33. D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, and S. M. Dawson, “The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: can geographic isolation explain this unique trait?” Behavioral Ecology and Sociobiology, vol. 54, no. 4, pp. 396–405, 2003. View at Publisher · View at Google Scholar · View at Scopus