Skip to main content

Advertisement

SpringerLink
Log in

Novel parallel hybrid genetic algorithms on the GPU for the generalized assignment problem

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The emergence of GPU-CPU heterogeneous architecture has led to a significant paradigm shift in parallel programming. How to effectively implement Parallel Genetic Algorithm (GA) in these environments has become one of the current hot issues. GA’s calculation and operators are closely related to specific problems, thereby significantly affecting the acceleration method of GA algorithms. The Generalized Assignment Problem (GAP) is a classic NP-hard combinatorial optimization problem. The more widely used genetic algorithms to solve the GAP in the CPU are difficult to be parallelized in a GPU environment due to severe data dependencies. To address this problem, two algorithms suitable for the implementation on the GPU are proposed, namely RPE algorithm and NNE algorithm, which obtain significant performance speedup by alleviating data dependencies and mutually exclusive synchronization overheads. At the same time, considering the new GPU architecture features and programming models, three different granular implementations of parallel genetic algorithms to solve the GAP are proposed, namely \(\text{ GPGA}_{thread}\), \(\text{ GPGA}_{warpsp}\) and \(\text{ GPGA}_{cgroup}\), by utilizing the warp-specialization technology and the cooperative group mechanism. GPGA series algorithms obtain better solution quality and very significant performance improvements compared with Serial GA, GTS (the GPU-CPU hybrid implementation of Scatter Search with Tabu lists) and Lagrange Relaxation algorithm on a CPU by solving 16 typical large-scale GAP instances.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Ahmed ZH (2019) Performance analysis of hybrid genetic algorithms for the generalized assignment problem. IJCSNS Int J Comput Sci Netw Secur 19(9):216–222

    Google Scholar 

  2. Alba E, Troya JM et al (1999) A survey of parallel distributed genetic algorithms. Complexity 4(4):31–52

    Article  MathSciNet  Google Scholar 

  3. Bai X, Zhang Y, Liu F (2020) Particle swarm optimization for two-stage fuzzy generalized assignment problem. In: International Conference on Intelligent Computing, 158–165. Springer

  4. Bauer M, Treichler S, Aiken A (2014) Singe: leveraging warp specialization for high performance on gpus. In: Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming, 119–130

  5. Chen YF, Liu YS, Fan J, Zhao JH (2005) Niche-based genetic & ant colony optimization algorithm for generalized assignment problem. Computer Applications 1

  6. Cheng JR, Gen M (2019) Accelerating genetic algorithms with gpu computing: a selective overview. Comput Ind Eng 128:514–525

    Article  Google Scholar 

  7. Chu PC, Beasley JE (1997) A genetic algorithm for the generalised assignment problem. Comput Oper Res 24(1):17–23

    Article  MathSciNet  Google Scholar 

  8. Dorigo M, Stützle T (2019) Ant colony optimization: overview and recent advances. In: Handbook of metaheuristics, 311–351. Springer

  9. Feltl H, Raidl GR (2004) An improved hybrid genetic algorithm for the generalized assignment problem. In: Proceedings of the 2004 ACM symposium on Applied computing, 990–995

  10. Hong S, Kim SK, Oguntebi T, Olukotun K (2011) Accelerating cuda graph algorithms at maximum warp. Acm Sigplan Notices 46(8):267–276

    Article  Google Scholar 

  11. Izzo D, Ruciński M, Biscani F (2012) The generalized island model. In: Parallel Architectures and Bioinspired Algorithms, 151–169. Springer

  12. Katoch S, Chauhan SS, Kumar V (2020) A review on genetic algorithm: past, present, and future. Multimedia Tools and Applications, 1–36

  13. Li A, Liu W, Wang L, Barker K, Song SL (2018) Warp-consolidation: a novel execution model for gpus. In: Proceedings of the 2018 International Conference on Supercomputing, 53–64

  14. Litvinchev I, Mata M, Saucedo J, Rangel S (2017) Improved lagrangian bounds and heuristics for the generalized assignment problem. J Comput Syst Sci Int 56(5):803–809

    Article  MathSciNet  Google Scholar 

  15. Liu YY, Wang S (2015) A scalable parallel genetic algorithm for the generalized assignment problem. Parallel Comput 46:98–119

    Article  MathSciNet  Google Scholar 

  16. Munapo E, Lesaoana M, Nyamugure P, Kumar S (2015) A transportation branch and bound algorithm for solving the generalized assignment problem. Int J Syst Assurance Eng Manag 6(3):217–223

    Article  Google Scholar 

  17. Punjwani S (2019) A feasible lagrangian approach with application to the generalized assignment problem. Master’s thesis, University of Waterloo

  18. Ross GT, Soland RM (1975) A branch and bound algorithm for the generalized assignment problem. Math Program 8(1):91–103

    Article  MathSciNet  Google Scholar 

  19. Shi X, Long W, Li, Y, Deng D, Wei Y (2020) Research on the performance of multi-population genetic algorithms with different complex network structures. Soft Computing ,1–19

  20. Shivgan R, Dong Z (2020) Energy-efficient drone coverage path planning using genetic algorithm. In: 2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR), 1–6. IEEE

  21. Souza DS, Santos HG, Coelho IM (2017) A hybrid heuristic in gpu-cpu based on scatter search for the generalized assignment problem. Proc Comput Sci 108:1404–1413

    Article  Google Scholar 

  22. Tapkan P, ÖZbakıR L, BaykasoğLu AA (2013) Solving fuzzy multiple objective generalized assignment problems directly via bees algorithm and fuzzy ranking. Expert Syst Appl 40(3):892–898

    Article  Google Scholar 

  23. Wu W, Iori M, Martello S, Yagiura M (2018) Exact and heuristic algorithms for the interval min-max regret generalized assignment problem. Comput Ind Eng 125:98–110 https://doi.org/10.1016/j.cie.2018.08.007. http://www.sciencedirect.com/science/article/pii/S0360835218303796

  24. Xiaoqiong W, Huizhen Z, Yuping Z (2019) Lagrangian bat algorithm for solving generalized assignment problems. J Univ Shanghai Sci Technol 41(2):167–173

    Google Scholar 

  25. Zhou Z, Li F et al (2020) An improved genetic algorithm using greedy strategy toward task scheduling optimization in cloud environments. Neural Comput Appl 32(6):1531–1541

    Article  Google Scholar 

Download references

Acknowledgements

We thank the anonymous reviewers for their comments and suggestions on the paper. This work was supported by the Fundamental Research Funds for the Central Universities (2017RC42, 2018RC56) and supported by IBM SUR Project.

Author information

Authors and Affiliations

  1. Beijing Key Lab of Intelligent Telecommunication Software and Multimedia, School of Computer Science, Beijing University of Posts and Telecommunications (BUPT), Beijing, 100876, CO, China

    Huang Zhi-Bin, Fu Guang-Tao, Dong Dan-Yang, Xiao Chen, Ding Zhe-Lun & Dai Zhi-Tao

Authors
  1. Huang Zhi-Bin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fu Guang-Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dong Dan-Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiao Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ding Zhe-Lun
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Dai Zhi-Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Huang Zhi-Bin.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhi-Bin, H., Guang-Tao, F., Dan-Yang, D. et al. Novel parallel hybrid genetic algorithms on the GPU for the generalized assignment problem. J Supercomput 78, 144–167 (2022). https://doi.org/10.1007/s11227-021-03882-6

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-03882-6

Keywords

Search

Navigation