A Parallel Framework for Multi-Population Cultural Algorithm and Its Applications in TSP

  • Olgierd UnoldEmail author
  • Radosław Tarnawski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10710)


This paper presents a novel parallel framework based on the Multi-Population Cultural Algorithm (MPCA) scheme for optimization problems. Contrary to the existing variants of Cultural Algorithm (CA), the proposed parallel framework for MPCA (PFMPCA) allows the use of any implemented metaheuristic both in a belief, and in a population space. Furthermore, the proposed approach permits CA to evolve simultaneously multiple population and belief sub-spaces, leveraging the dual inheritance mechanism and utilizing multi-population approach. Moreover, each sub-population (in population or belief space) is able to communicate between each other. PFMPCA has been implemented on Graphics Processing Units (GPUs) using CUDA programming model. The performance of the developed framework was evaluated using asymmetric Travelling Salesman Problem (ATSP). The MPCA for TSP implemented by means of the parallel framework proves to have an extensible architecture designed to accommodate changes and good performances.


Cultural Algorithm Multi-Population GPU computing CUDA architecture Travelling Salesman Problem Ant Colony Optimization Genetic Algorithm 



The work was supported by statutory grant of the Wroclaw University of Science and Technology, Poland.

Author Contribution

OU initiated and designed the study, supervised the work, made statistical tests. RT implemented the framework, performed the experiments. Both authors wrote and approved the final manuscript.


  1. 1.
    Ali, M.Z.: Using cultural algorithms to solve optimization problems with a social fabric approach. Ph.D. thesis, Wayne State University (2008)Google Scholar
  2. 2.
    Ali, M.Z., Awad, N.H., Suganthan, P.N., Reynolds, R.G.: A modified cultural algorithm with a balanced performance for the differential evolution frameworks. Knowl. Based Syst. 111, 73–86 (2016)CrossRefGoogle Scholar
  3. 3.
    Digalakis, J.G., Margaritis, K.G.: A multipopulation cultural algorithm for the electrical generator scheduling problem. Mathe. Comput. Simul. 60(3), 293–301 (2002)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Dong, J., Yuan, B.: GPU-accelerated standard and multi-population cultural algorithms. In: 2013 International Conference on Service Sciences (ICSS), pp. 129–133. IEEE (2013)Google Scholar
  5. 5.
    Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. thesis, Politecnico di Milano, Italy (1992)Google Scholar
  6. 6.
    Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Mach. Learn. 3(2), 95–99 (1988)CrossRefGoogle Scholar
  7. 7.
    Guo, Y.N., Cheng, J., Cao, Y.Y., Lin, Y.: A novel multi-population cultural algorithm adopting knowledge migration. Soft Comput. 15(5), 897–905 (2011)CrossRefGoogle Scholar
  8. 8.
    Guo, Y.N., Liu, D.: Multi-population cooperative particle swarm cultural algorithms. In: 2011 Seventh International Conference on Natural Computation (ICNC), vol. 3, pp. 1351–1355. IEEE (2011)Google Scholar
  9. 9.
    Hlynka, A.W., Kobti, Z.: Knowledge sharing through agent migration with multi-population cultural algorithm. In: FLAIRS Conference (2013)Google Scholar
  10. 10.
    Hlynka, A.W., Kobti, Z.: Heritage-dynamic cultural algorithm for multi-population solutions. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 4398–4404. IEEE (2016)Google Scholar
  11. 11.
    Hoffman, K.L., Padberg, M., Rinaldi, G.: Traveling salesman problem. In: Gass, S.I., Fu, M.C. (eds.) Encyclopedia of Operations Research and Management Science, pp. 1573–1578. Springer, New York (2013). Scholar
  12. 12.
    Kobti, Z., et al.: Heterogeneous multi-population cultural algorithm. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 292–299. IEEE (2013)Google Scholar
  13. 13.
    Nvidia: Nvidia CUDA (2017).
  14. 14.
    Odili, J.B., Mohmad Kahar, M.N.: Solving the traveling salesman’s problem using the african buffalo optimization. Comput. Intell. Neurosci. 2016, 3 (2016)CrossRefGoogle Scholar
  15. 15.
    Reinhelt, G.: TSPLIB: a library of sample instances for the TSP (and related problems) from various sources and of various types (2017).
  16. 16.
    Reynolds, R.G.: An introduction to cultural algorithms. In: Proceedings of the Third Annual Conference on Evolutionary Programming, Singapore, pp. 131–139 (1994)Google Scholar
  17. 17.
    Stützle, T., Hoos, H.: MAX-MIN ant system and local search for the traveling salesman problem. In: IEEE International Conference on Evolutionary Computation, pp. 309–314. IEEE (1997)Google Scholar
  18. 18.
    Unold, O., Tarnawski, R.: Cultural Ant Colony Optimization on GPUs for Travelling Salesman Problem. In: Pardalos, P.M., Conca, P., Giuffrida, G., Nicosia, G. (eds.) MOD 2016. LNCS, vol. 10122, pp. 317–329. Springer, Cham (2016). Scholar
  19. 19.
    Xiao, S., Feng, W.: Inter-block GPU communication via fast barrier synchronization. In: 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), pp. 1–12. IEEE (2010)Google Scholar
  20. 20.
    Xu, W., Wang, R., Zhang, L., Gu, X.: A multi-population cultural algorithm with adaptive diversity preservation and its application in ammonia synthesis process. Neural Comput. Appl. 21(6), 1129–1140 (2012)CrossRefGoogle Scholar
  21. 21.
    Yuan, S., Skinner, B., Huang, S., Liu, D.: A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms. Eur. J. Oper. Res. 228(1), 72–82 (2013)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Zadeh, P.M., Kobti, Z.: A multi-population cultural algorithm for community detection in social networks. Procedia Comput. Sci. 52, 342–349 (2015)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Department of Computer Engineering, Faculty of ElectronicsWroclaw University of Science and TechnologyWroclawPoland

Personalised recommendations