{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T01:04:10Z","timestamp":1783040650167,"version":"3.54.6"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319234366","type":"print"},{"value":"9783319234373","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,9,9]],"date-time":"2015-09-09T00:00:00Z","timestamp":1441756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,9,9]],"date-time":"2015-09-09T00:00:00Z","timestamp":1441756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-23437-3_53","type":"book-chapter","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T13:18:55Z","timestamp":1441718335000},"page":"615-625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bees Algorithm for the Quadratic Assignment Problem on CUDA Platform"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Chmiel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piotr","family":"Szwed","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,9]]},"reference":[{"issue":"3","key":"53_CR1","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1504\/IJAISC.2013.053392","volume":"3","author":"JC Bansal","year":"2013","unstructured":"Bansal, J.C., Sharma, H., Nagar, A., Arya, K.V.: Balanced artificial bee colony algorithm. Int. J. Artif. Intell. Soft Comput. 3(3), 222\u2013243 (2013)","journal-title":"Int. J. Artif. Intell. Soft Comput."},{"key":"53_CR2","unstructured":"Bermudez, R., Cole, M.H.: A genetic algorithm approach to door assignments in breakbulk terminals. Technical Report MBTC-1102, Mack-Blackwell Transportation Center, University of Arkansas, Fayetteville, Arkansas (2001)"},{"issue":"4","key":"53_CR3","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R Burkard","year":"1997","unstructured":"Burkard, R., Karisch, S., Rendl, F.: QAPLIB\u2014a quadratic assignment problem library. J. Glob. Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"53_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02022999","volume":"41","author":"J Chakrapani","year":"1993","unstructured":"Chakrapani, J., Skorin-Kapov, J.: Massively parallel tabu search for the quadratic assignment problem. Ann. Oper. Res. 41(4), 327\u2013341 (1993)","journal-title":"Ann. Oper. Res."},{"key":"53_CR5","unstructured":"Chmiel, W.: Evolution Algorithms for optimisation of task assignment problem with quadratic cost function. Ph.D. thesis, AGH Technology University, Krak\u00f3w, Poland (2004)"},{"issue":"2","key":"53_CR6","first-page":"117","volume":"15","author":"W Chmiel","year":"2009","unstructured":"Chmiel, W., Kad\u0142uczka, P., Packanik, G.: Performance of swarm algorithms for permutation problems. Automatyka 15(2), 117\u2013126 (2009)","journal-title":"Automatyka"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Chong, C.S., Sivakumar, A.I., Low, M.Y.H., Gay, K.L.: A bee colony optimization algorithm to job shop scheduling. In: WSC 2006. Monterey, USA (2006)","DOI":"10.1109\/WSC.2006.322980"},{"key":"53_CR8","unstructured":"Gr\u00f6tschel, M.: Discrete mathematics in manufacturing. In: Malley, R.E.O. (ed.) ICIAM 1991, pp. 119\u2013145 (1991)"},{"issue":"5","key":"53_CR9","doi-asserted-by":"publisher","first-page":"5438","DOI":"10.1016\/j.eswa.2010.10.010","volume":"38","author":"YM Huang","year":"2011","unstructured":"Huang, Y.M., Lin, J.C.: A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems. Expert Syst. Appl. 38(5), 5438\u20135447 (2011)","journal-title":"Expert Syst. Appl."},{"key":"53_CR10","unstructured":"jcuda.org: JCuda\u2013Java bindings for CUDA (2015), http:\/\/www.jcuda.org"},{"key":"53_CR11","unstructured":"Kirk, D.B., Hwu, W.M.: Programming Massively Parallel Processors: A Hands-on Approach, 1st edn. Morgan Kaufmann Publishers, San Francisco, USA (2010)"},{"key":"53_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities. Econometrica 25, 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"53_CR13","first-page":"63","volume-title":"Natural Computing Series","author":"Fr\u00e9d\u00e9ric Kr\u00fcger","year":"2013","unstructured":"Kr\u00fcger, F., Maitre, O., Jim\u00e9nez, S., Baumes, L.A., Collet, P.: Generic local search (memetic) algorithm on a single GPGPU chip. In: Tsutsui, S., Collet, P. (eds.) Massively Parallel Evolutionary Computation on GPGPUs, pp. 63\u201381. Natural Computing Series, Springer, Berlin (2013)"},{"issue":"3","key":"53_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.sysarc.2013.09.007","volume":"60","author":"GH Luo","year":"2014","unstructured":"Luo, G.H., Huang, S.K., Chang, Y.S., Yuan, S.M.: A parallel bees algorithm implementation on GPU. J. Syst. Arch. 60(3), 271\u2013279 (2014)","journal-title":"J. Syst. Arch."},{"key":"53_CR15","first-page":"227","volume-title":"Natural Computing Series","author":"Ogier Maitre","year":"2013","unstructured":"Maitre, O.: Genetic programming on GPGPU cards using EASEA. In: Tsutsui, S., Collet,\u00a0P. (eds.) Massively Parallel Evolutionary Computation on GPGPUs, pp. 227\u2013248. Natural Computing Series, Springer, Berlin (2013)"},{"issue":"2","key":"53_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0305-0548(96)00047-0","volume":"24","author":"A Mason","year":"1997","unstructured":"Mason, A., R\u00f6nnqvist, M.: Solution methods for the balancing of jet turbines. Comput. Oper. Res. 24(2), 153\u2013167 (1997)","journal-title":"Comput. Oper. Res."},{"key":"53_CR17","first-page":"27","volume":"9","author":"M Mirzazadeh","year":"2011","unstructured":"Mirzazadeh, M., Shirdel, G.H., Masoumi, B.: A honey bee algorithm to solve quadratic assignment problem. J. Optim. Ind. Eng. 9, 27\u201336 (2011)","journal-title":"J. Optim. Ind. Eng."},{"issue":"2","key":"53_CR18","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MM.2010.41","volume":"30","author":"J Nickolls","year":"2010","unstructured":"Nickolls, J., Dally, W.J.: The GPU computing era. IEEE Micro 30(2), 56\u201369 (2010)","journal-title":"IEEE Micro"},{"key":"53_CR19","unstructured":"NVIDIA Corporation: CUDA toolkit documentation v6.5 (2015), http:\/\/docs.nvidia.com\/cuda\/index.html#axzz3T4PFSm60"},{"issue":"1","key":"53_CR20","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1111\/j.1467-8659.2007.01012.x","volume":"26","author":"JD Owens","year":"2007","unstructured":"Owens, J.D., Luebke, D., Govindaraju, N., Harris, M., Kr\u00fcger, J., Lefohn, A.E., Purcell, T.J.: A survey of general-purpose computation on graphics hardware. Comput. Graph. Forum 26(1), 80\u2013113 (2007)","journal-title":"Comput. Graph. Forum"},{"issue":"5","key":"53_CR21","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1007\/s00500-013-1104-9","volume":"18","author":"D. T. Pham","year":"2013","unstructured":"Pham, D.T., Castellani, M.: Benchmarking and comparison of nature-inspired population-based continuous optimisation algorithms. Soft Comput. 18, 1\u201333 (2013)","journal-title":"Soft Computing"},{"key":"53_CR22","first-page":"454","volume":"2006","author":"DT Pham","year":"2006","unstructured":"Pham, D.T., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., Zaidi, M.: The bees algorithm, a novel tool for complex optimisation problems. IPROMS 2006, 454\u2013459 (2006)","journal-title":"IPROMS"},{"key":"53_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"AT Phillips","year":"1994","unstructured":"Phillips, A.T., Rosen, J.B.: A quadratic assignment formulation of the molecular conformation problem. J. Glob. Optim. 4, 229\u2013241 (1994)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"53_CR24","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23(3), 555\u2013565 (1976)","journal-title":"J. ACM"},{"key":"53_CR25","doi-asserted-by":"crossref","unstructured":"Szwed, P., Chmiel, W.: Multi-swarm PSO algorithm for the quadratic assignment problem: a massive parallel implementation on the OpenCL platform. Comput. Res. Repos. 1504.05158 (2015)","DOI":"10.1007\/978-3-319-19369-4_21"},{"key":"53_CR26","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-319-19369-4_21","volume-title":"Artificial Intelligence and Soft Computing","author":"Piotr Szwed","year":"2015","unstructured":"Szwed, P., Chmiel, W., Kad\u0142uczka, P.: OpenCL implementation of PSO algorithm for the quadratic assignment problem. In: Rutkowski, L., Korytkowski, M., Scherer,\u00a0R., Tadeusiewicz,\u00a0R., Zadeh, L.A., Zurada, J.M. (eds.) Artificial Intelligence and Soft Computing, LNCS, vol. 9120, pp. 223\u2013234. Springer, Switzerland (2015)"},{"key":"53_CR27","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/978-3-642-16493-4_5","volume-title":"Advances in Computation and Intelligence","author":"Ryszard Tadeusiewicz","year":"2010","unstructured":"Tadeusiewicz, R., Lewicki, A.: The ant colony optimization algorithm for multiobjective optimization non-compensation model problem staff selection. In: Cai, Z., Hu, C., Kang, Z., Liu,\u00a0Y. (eds.) Advances in Computation and Intelligence, LNCS, vol. 6382, pp. 44\u201353. Springer, Berlin (2010)"},{"issue":"4-5","key":"53_CR28","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput.17(4\u20135), 443\u2013455 (1991)","journal-title":"Parallel Computing"},{"key":"53_CR29","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Tan, Y.: GPU-based parallel particle swarm optimization. In: IEEE CEC 2009, pp. 1493\u20131500. Trondheim, Norway (2009)","DOI":"10.1109\/CEC.2009.4983119"}],"container-title":["Advances in Intelligent Systems and Computing","Man\u2013Machine Interactions 4"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23437-3_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T16:48:42Z","timestamp":1674838122000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23437-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,9]]},"ISBN":["9783319234366","9783319234373"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23437-3_53","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,9]]},"assertion":[{"value":"9 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}