{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:03:10Z","timestamp":1743094990524,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811563171"},{"type":"electronic","value":"9789811563188"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-6318-8_24","type":"book-chapter","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T23:12:33Z","timestamp":1592953953000},"page":"285-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving Quadratic Assignment Problem Using Crow Search Algorithm in Accelerated Systems"],"prefix":"10.1007","author":[{"given":"Manoj","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinaki","family":"Mitra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176, 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR2","unstructured":"Commander, C.W.: A survey of the quadratic assignment problem, with applications (2005)"},{"issue":"03","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1650013","DOI":"10.1142\/S0129626416500134","volume":"26","author":"O Abdelkafi","year":"2016","unstructured":"Abdelkafi, O., Idoumghar, L., Lepagnot, J.: A survey on the metaheuristics applied to QAP for the graphics processing units. Parallel Process. Lett. 26(03), 1650013 (2016)","journal-title":"Parallel Process. Lett."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"13","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB- a quadratic assignment problem library. J. Global Optim. 13, 391\u2013403 (1997). \nhttps:\/\/doi.org\/10.1023\/A:1008293323270","journal-title":"J. Global Optim."},{"key":"24_CR5","unstructured":"Wong, M.L., Wong, T.T., Fok, K.-L.: Parallel evolutionary algorithms on graphics processing unit. In: 2005 IEEE Congress Evolutionary Computation (2015)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/11539902_134","volume-title":"Advances in Natural Computation","author":"Q Yu","year":"2005","unstructured":"Yu, Q., Chen, C., Pan, Z.: Parallel genetic algorithms on programmable graphics hardware. In: Wang, L., Chen, K., Ong, Y.S. (eds.) ICNC 2005. LNCS, vol. 3612, pp. 1051\u20131059. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11539902_134"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Zhu, W.: A study of parallel evolution strategy: pattern search on a GPU computing platform. In: Proceedings of the First ACM\/SIGEVO (2009)","DOI":"10.1145\/1543834.1543939"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Tsutsui, S., Fujimoto, N.: Solving quadratic assignment problems by genetic algorithms with GPU computation: a case study. ACM (2009)","DOI":"10.1145\/1570256.1570355"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Van Luong, T., Melab, N., Talbi, E.: Parallel hybrid evolutionary algorithms on GPU. In: 2010 IEEE Congress Evolutionary Computation (CEC)","DOI":"10.1109\/CEC.2010.5586403"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.compstruc.2016.03.001","volume":"169","author":"A Askarzadeh","year":"2016","unstructured":"Askarzadeh, A.: A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. J. Comput. Struct. 169, 112 (2016)","journal-title":"J. Comput. Struct."},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Vajda, A.: Multi-core and many-core processor architectures. In: Programming Many-Core Chips. Springer, Boston (2011). \nhttps:\/\/doi.org\/10.1007\/978-1-4419-9739-5_2","DOI":"10.1007\/978-1-4419-9739-5_2"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley (2009)","DOI":"10.1002\/9780470496916"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1, 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/3-540-49264-X_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1995","author":"D Pointcheval","year":"1995","unstructured":"Pointcheval, D.: A new identification scheme based on the perceptrons problem. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 319\u2013328. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/3-540-49264-X_26"},{"issue":"2","key":"24_CR15","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/4235.728208","volume":"2","author":"E Lutton","year":"1998","unstructured":"Lutton, E., Vehel, J.L.: Holder functions and deception of genetic algorithms. IEEE Trans. Evol. Comput. 2(2), 56\u201371 (1998)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Communications in Computer and Information Science","Machine Learning, Image Processing, Network Security and Data Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-6318-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T23:16:36Z","timestamp":1592954196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-6318-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811563171","9789811563188"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-6318-8_24","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIND","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Image Processing, Network Security and Data Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Silchar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mind2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/mind2020.nits.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"219","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"79","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}