{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:27:47Z","timestamp":1743089267076,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_25","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"350-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Configuration of\u00a0Metaheuristics for\u00a0Solving the\u00a0Quadratic Three-Dimensional Assignment Problem Using Irace"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5654-2058","authenticated-orcid":false,"given":"Im\u00e8ne","family":"Ait Abderrahim","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5820-0473","authenticated-orcid":false,"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Abderrahim, I.A., Loukil, L.: Hybrid PSO-TS approach for solving the quadratic three-dimensional assignment problem. In: 2017 First International Conference on Embedded and Distributed Systems (EDiS), pp. 1\u20135 (2017)","DOI":"10.1109\/EDIS.2017.8284041"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"98","DOI":"10.4018\/IJSIR.2021010106","volume":"12","author":"IA Abderrahim","year":"2021","unstructured":"Abderrahim, I.A., Loukil, L.: Hybrid approach for solving the Q3AP. Int. J. Swarm Intell. Res. (IJSIR) 12, 98\u2013114 (2021)","journal-title":"Int. J. Swarm Intell. Res. (IJSIR)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04244-7_14","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142\u2013157. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_14"},{"key":"25_CR4","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proceedings of GECCO 2002, pp. 11\u201318. Morgan Kaufmann Publishers (2002)"},{"issue":"4","key":"25_CR5","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB-a quadratic assignment problem library. J. Glob. Optim. 10(4), 391\u2013403 (1997)","journal-title":"J. Glob. Optim."},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-78133-4_15","volume-title":"Artificial Evolution","author":"L P\u00e9rez C\u00e1ceres","year":"2018","unstructured":"P\u00e9rez C\u00e1ceres, L., Pagnozzi, F., Franzin, A., St\u00fctzle, T.: Automatic configuration of GCC using irace. In: Lutton, E., Legrand, P., Parrend, P., Monmarch\u00e9, N., Schoenauer, M. (eds.) EA 2017. LNCS, vol. 10764, pp. 202\u2013216. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78133-4_15"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Congying, L., Huanping, Z., Xinfeng, Y.: Particle swarm optimization algorithm for quadratic assignment problem. In: Proceedings of 2011 International Conference on Computer Science and Network Technology, vol. 3, pp. 1728\u20131731 (2011)","DOI":"10.1109\/ICCSNT.2011.6182302"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"DT Connolly","year":"1990","unstructured":"Connolly, D.T.: An improved annealing scheme for the QAP. Eur. J. Oper. Res. 46(1), 93\u2013100 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR9","unstructured":"Galea, F., Hahn, P.M., LeCun., B.: A parallel implementation of the quadratic three-dimensional assignment problem using the bob++ framework. In: 21st Conference of the European Chapter on Combinatorial Optimization (ECCO XXI) (2008)"},{"issue":"3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search - part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"25_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100720","volume":"57","author":"J Gmys","year":"2020","unstructured":"Gmys, J., Carneiro, T., Melab, N., Talbi, E.G., Tuyttens, D.: A comparative study of high-productivity high-performance programming languages for parallel metaheuristics. Swarm Evol. Comput. 57, 100720 (2020)","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.ejor.2006.11.014","volume":"184","author":"PM Hahn","year":"2008","unstructured":"Hahn, P.M., et al.: The quadratic three-dimensional assignment problem: exact and approximate solution methods. Eur. J. Oper. Res. 184(2), 416\u2013428 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1287\/mnsc.13.1.42","volume":"13","author":"FS Hillier","year":"1966","unstructured":"Hillier, F.S., Connors, M.M.: Quadratic assignment problem algorithms and the location of indivisible facilities. Manag. Sci. 13(1), 42\u201357 (1966)","journal-title":"Manag. Sci."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-21434-9_3","volume-title":"Autonomous Search","author":"HH Hoos","year":"2011","unstructured":"Hoos, H.H.: Automated algorithm configuration and parameter tuning. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 37\u201371. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21434-9_3"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. JAIR 36, 267\u2013306 (2009)","journal-title":"JAIR"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN\u201995 - International Conference on Neural Networks, vol. 4, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-15381-5_42","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2010","author":"P Lipinski","year":"2010","unstructured":"Lipinski, P.: A hybrid evolutionary algorithm to quadratic three-dimensional assignment problem with local search for many-core graphics processors. In: Fyfe, C., Tino, P., Charles, D., Garcia-Osorio, C., Yin, H. (eds.) IDEAL 2010. LNCS, vol. 6283, pp. 344\u2013351. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15381-5_42"},{"key":"25_CR19","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., P\u00e9rez C\u00e1ceres, L., St\u00fctzle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"issue":"02","key":"25_CR20","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1142\/S0129054112400242","volume":"23","author":"L Loukil","year":"2012","unstructured":"Loukil, L., Mehdi, M., Melab, N., Talbi, E.G., Bouvry, P.: Parallel hybrid genetic algorithms for solving Q3AP on computational grid. Int. J. Found. Comput. Sci. 23(02), 483\u2013500 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated Local Search, pp. 320\u2013353. Springer, Boston (2003)","DOI":"10.1007\/0-306-48056-5_11"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Luong, T.V., Loukil, L., Melab, N., Talbi, E.G.: A GPU-based iterated tabu search for solving the quadratic 3-dimensional assignment problem. In: ACS\/IEEE International Conference on Computer Systems and Applications - AICCSA 2010, pp. 1\u20138 (2010)","DOI":"10.1109\/AICCSA.2010.5587019"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Mehdi, M., Charr, J.C., Melab, N., Talbi, E.G., Bouvry, P.: A cooperative tree-based hybrid GA-B &B approach for solving challenging permutation-based problems. In: Proceedings of GECCO 2011, pp. 513\u2013520. Association for Computing Machinery, New York (2011)","DOI":"10.1145\/2001576.2001647"},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10586-013-0313-4","volume":"17","author":"M Mezmaz","year":"2014","unstructured":"Mezmaz, M., Mehdi, M., Bouvry, P., Melab, N., Talbi, E.G., Tuyttens, D.: Solving the three dimensional quadratic assignment problem on a computational grid. Cluster Comput. 17, 205\u2013217 (2014)","journal-title":"Cluster Comput."},{"issue":"2","key":"25_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12532-015-0077-3","volume":"7","author":"HD Mittelmann","year":"2015","unstructured":"Mittelmann, H.D., Salvagnin, D.: On solving a hard quadratic 3-dimensional assignment problem. Math. Program. Comput. 7(2), 219\u2013234 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0077-3","journal-title":"Math. Program. Comput."},{"issue":"2","key":"25_CR26","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1287\/opre.16.2.422","volume":"16","author":"WP Pierskalla","year":"1968","unstructured":"Pierskalla, W.P.: The multidimensional assignment problem. Oper. Res. 16(2), 422\u2013431 (1968)","journal-title":"Oper. Res."},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., L\u00f3pez-Ib\u00e1\u00f1ez, M.: Automatic (offline) configuration of algorithms. In: GECCO (Companion), pp. 681\u2013702. ACM Press, New York (2015)","DOI":"10.1145\/2739482.2756581"},{"key":"25_CR28","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-319-91086-4_17","volume-title":"Handbook of Metaheuristics","author":"T St\u00fctzle","year":"2019","unstructured":"St\u00fctzle, T., L\u00f3pez-Ib\u00e1\u00f1ez, M.: Automated design of metaheuristic algorithms. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 541\u2013579. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_17"},{"issue":"3","key":"25_CR29","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T St\u00fctzle","year":"2006","unstructured":"St\u00fctzle, T.: Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res. 174(3), 1519\u20131539 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR30","unstructured":"Taillard, E.D.: Fant: Fast ant system. Technical report, Istituto Dalle Molle Di Studi Sull Intelligenza Artificiale (1998)"},{"issue":"2","key":"25_CR31","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/LCOMM.2016.2618796","volume":"21","author":"W Wu","year":"2017","unstructured":"Wu, W., Mittelmann, H., Ding, Z.: Modulation design for mimo-comp harq. IEEE Commun. Lett. 21(2), 290\u2013293 (2017)","journal-title":"IEEE Commun. Lett."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T21:34:22Z","timestamp":1728941662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","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":"72","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":"48","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":"17","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":"67% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}