{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:08Z","timestamp":1740123488790,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T00:00:00Z","timestamp":1621555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T00:00:00Z","timestamp":1621555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2017RC42","2018RC56"],"award-info":[{"award-number":["2017RC42","2018RC56"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11227-021-03882-6","type":"journal-article","created":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T10:02:42Z","timestamp":1621591362000},"page":"144-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Novel parallel hybrid genetic algorithms on the GPU for the generalized assignment problem"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2819-927X","authenticated-orcid":false,"given":"Huang","family":"Zhi-Bin","sequence":"first","affiliation":[]},{"given":"Fu","family":"Guang-Tao","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Dan-Yang","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ding","family":"Zhe-Lun","sequence":"additional","affiliation":[]},{"given":"Dai","family":"Zhi-Tao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,21]]},"reference":[{"issue":"9","key":"3882_CR1","first-page":"216","volume":"19","author":"ZH Ahmed","year":"2019","unstructured":"Ahmed ZH (2019) Performance analysis of hybrid genetic algorithms for the generalized assignment problem. IJCSNS Int J Comput Sci Netw Secur 19(9):216\u2013222","journal-title":"IJCSNS Int J Comput Sci Netw Secur"},{"issue":"4","key":"3882_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-0526(199903\/04)4:4<31::AID-CPLX5>3.0.CO;2-4","volume":"4","author":"E Alba","year":"1999","unstructured":"Alba E, Troya JM et al (1999) A survey of parallel distributed genetic algorithms. Complexity 4(4):31\u201352","journal-title":"Complexity"},{"key":"3882_CR3","doi-asserted-by":"crossref","unstructured":"Bai X, Zhang Y, Liu F (2020) Particle swarm optimization for two-stage fuzzy generalized assignment problem. In: International Conference on Intelligent Computing, 158\u2013165. Springer","DOI":"10.1007\/978-3-642-14922-1_21"},{"key":"3882_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013130","DOI":"10.1145\/2692916.2555258"},{"key":"3882_CR5","unstructured":"Chen YF, Liu YS, Fan J, Zhao JH (2005) Niche-based genetic & ant colony optimization algorithm for generalized assignment problem. Computer Applications 1"},{"key":"3882_CR6","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.cie.2018.12.067","volume":"128","author":"JR Cheng","year":"2019","unstructured":"Cheng JR, Gen M (2019) Accelerating genetic algorithms with gpu computing: a selective overview. Comput Ind Eng 128:514\u2013525","journal-title":"Comput Ind Eng"},{"issue":"1","key":"3882_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","volume":"24","author":"PC Chu","year":"1997","unstructured":"Chu PC, Beasley JE (1997) A genetic algorithm for the generalised assignment problem. Comput Oper Res 24(1):17\u201323","journal-title":"Comput Oper Res"},{"key":"3882_CR8","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2019) Ant colony optimization: overview and recent advances. In: Handbook of metaheuristics, 311\u2013351. Springer","DOI":"10.1007\/978-3-319-91086-4_10"},{"key":"3882_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013995","DOI":"10.1145\/967900.968102"},{"issue":"8","key":"3882_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/2038037.1941590","volume":"46","author":"S Hong","year":"2011","unstructured":"Hong S, Kim SK, Oguntebi T, Olukotun K (2011) Accelerating cuda graph algorithms at maximum warp. Acm Sigplan Notices 46(8):267\u2013276","journal-title":"Acm Sigplan Notices"},{"key":"3882_CR11","doi-asserted-by":"crossref","unstructured":"Izzo D, Ruci\u0144ski M, Biscani F (2012) The generalized island model. In: Parallel Architectures and Bioinspired Algorithms,  151\u2013169. Springer","DOI":"10.1007\/978-3-642-28789-3_7"},{"key":"3882_CR12","doi-asserted-by":"crossref","unstructured":"Katoch S, Chauhan SS, Kumar V (2020) A review on genetic algorithm: past, present, and future. Multimedia Tools and Applications, 1\u201336","DOI":"10.1007\/s11042-020-10139-6"},{"key":"3882_CR13","doi-asserted-by":"crossref","unstructured":"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\u201364","DOI":"10.1145\/3205289.3205294"},{"issue":"5","key":"3882_CR14","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1134\/S1064230717050070","volume":"56","author":"I Litvinchev","year":"2017","unstructured":"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\u2013809","journal-title":"J Comput Syst Sci Int"},{"key":"3882_CR15","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.parco.2014.04.008","volume":"46","author":"YY Liu","year":"2015","unstructured":"Liu YY, Wang S (2015) A scalable parallel genetic algorithm for the generalized assignment problem. Parallel Comput 46:98\u2013119","journal-title":"Parallel Comput"},{"issue":"3","key":"3882_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s13198-015-0343-9","volume":"6","author":"E Munapo","year":"2015","unstructured":"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\u2013223","journal-title":"Int J Syst Assurance Eng Manag"},{"key":"3882_CR17","unstructured":"Punjwani S (2019) A feasible lagrangian approach with application to the generalized assignment problem. Master\u2019s thesis, University of Waterloo"},{"issue":"1","key":"3882_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01580430","volume":"8","author":"GT Ross","year":"1975","unstructured":"Ross GT, Soland RM (1975) A branch and bound algorithm for the generalized assignment problem. Math Program 8(1):91\u2013103","journal-title":"Math Program"},{"key":"3882_CR19","doi-asserted-by":"crossref","unstructured":"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\u201319","DOI":"10.1007\/s00500-020-04759-1"},{"key":"3882_CR20","doi-asserted-by":"crossref","unstructured":"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\u20136. IEEE","DOI":"10.1109\/HPSR48589.2020.9098989"},{"key":"3882_CR21","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.procs.2017.05.188","volume":"108","author":"DS Souza","year":"2017","unstructured":"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\u20131413","journal-title":"Proc Comput Sci"},{"issue":"3","key":"3882_CR22","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1016\/j.eswa.2012.05.045","volume":"40","author":"P Tapkan","year":"2013","unstructured":"Tapkan P, \u00d6Zbak\u0131R L, Baykaso\u011fLu AA (2013) Solving fuzzy multiple objective generalized assignment problems directly via bees algorithm and fuzzy ranking. Expert Syst Appl 40(3):892\u2013898","journal-title":"Expert Syst Appl"},{"key":"3882_CR23","doi-asserted-by":"publisher","unstructured":"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\u2013110 https:\/\/doi.org\/10.1016\/j.cie.2018.08.007. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835218303796","DOI":"10.1016\/j.cie.2018.08.007"},{"issue":"2","key":"3882_CR24","first-page":"167","volume":"41","author":"W Xiaoqiong","year":"2019","unstructured":"Xiaoqiong W, Huizhen Z, Yuping Z (2019) Lagrangian bat algorithm for solving generalized assignment problems. J Univ Shanghai Sci Technol 41(2):167\u2013173","journal-title":"J Univ Shanghai Sci Technol"},{"issue":"6","key":"3882_CR25","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1007\/s00521-019-04119-7","volume":"32","author":"Z Zhou","year":"2020","unstructured":"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\u20131541","journal-title":"Neural Comput Appl"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03882-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-03882-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03882-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T12:13:53Z","timestamp":1641298433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-03882-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,21]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["3882"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-03882-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2021,5,21]]},"assertion":[{"value":"11 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}