{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:05:55Z","timestamp":1743084355215,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"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_9","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"118-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unsupervised Machine Learning for\u00a0the\u00a0Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Th\u00e9 Van","family":"Luong","sequence":"first","affiliation":[]},{"given":"\u00c9ric D.","family":"Taillard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"9_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: International Conference on Very Large Databases (VLDB), pp. 487\u2013499 (1994)"},{"key":"9_CR3","volume-title":"Introduction to Machine Learning","author":"E Alpaydin","year":"2020","unstructured":"Alpaydin, E.: Introduction to Machine Learning. MIT Press, Cambridge (2020)"},{"key":"9_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-00483-4","volume-title":"Tuning Metaheuristics: A Machine Learning Perspective","author":"M Birattari","year":"2009","unstructured":"Birattari, M., Kacprzyk, J.: Tuning Metaheuristics: A Machine Learning Perspective, vol. 197. Springer, Heidelberg (2009)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01585868","volume":"82","author":"RE Burkard","year":"1998","unstructured":"Burkard, R.E., \u00c7ela, E., Rote, G., Woeginger, G.J.: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases. Math. Program. 82, 125\u2013158 (1998)","journal-title":"Math. Program."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB-a quadratic assignment problem library. J. Glob. Optim. 10(4), 391\u2013403 (1997). https:\/\/coral.ise.lehigh.edu\/data-sets\/qaplib\/","DOI":"10.1023\/A:1008293323270"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1515\/math-2017-0029","volume":"15","author":"L Calvet","year":"2017","unstructured":"Calvet, L., de Armas, J., Masip, D., Juan, A.A.: Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs. Open Math. 15(1), 261\u2013280 (2017)","journal-title":"Open Math."},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Drezner, Z.: Finding a cluster of points and the grey pattern quadratic assignment problem. OR Spectr. 28(3), 417\u2013436 (2006). https:\/\/doi.org\/10.1007\/s00291-005-0010-7","DOI":"10.1007\/s00291-005-0010-7"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Drezner, Z., Hahn, P.M., Taillard, \u00c9.D.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann. OR 139(1), 65\u201394 (2005). https:\/\/doi.org\/10.1007\/s10479-005-3444-z","DOI":"10.1007\/s10479-005-3444-z"},{"key":"9_CR10","unstructured":"Erhan, D., Courville, A., Bengio, Y., Vincent, P.: Why does unsupervised pre-training help deep learning? In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, pp. 201\u2013208 (2010)"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD 2000, pp. 1\u201312. Association for Computing Machinery, New York (2000). https:\/\/doi.org\/10.1145\/342009.335372","DOI":"10.1145\/342009.335372"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53\u201376 (1957). https:\/\/www.jstor.org\/stable\/1907742","DOI":"10.2307\/1907742"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"L\u2019heureux, A., Grolinger, K., Elyamany, H.F., Capretz, M.A.: Machine learning with big data: challenges and approaches. IEEE Access 5, 7776\u20137797 (2017)","DOI":"10.1109\/ACCESS.2017.2696365"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF00253805","volume":"1","author":"Y Li","year":"1992","unstructured":"Li, Y., Pardalos, P.M.: Generating quadratic assignment test problems with known optimal permutations. Comput. Optim. Appl. 1(2), 163\u2013184 (1992)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"9_CR15","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(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR16","unstructured":"Luong, T.V., Melab, N., Taillard, \u00c9.D., Talbi, E.G.: Parallelization strategies for hybrid metaheuristics using a single GPU and multi-core resources. In: 12th International Conference on Parallel Problem Solving From Nature (PPSN) Proceedings (2012). http:\/\/mistic.heig-vd.ch\/taillard\/articles.dir\/LuongMTT2012.pdf. Only preprint technical report available"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Nugent, C.E., Vollmann, T.E., Ruml, J.: An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. 16(1), 150\u2013173 (1968). https:\/\/doi.org\/10.1287\/opre.16.1.150","DOI":"10.1287\/opre.16.1.150"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/568271.223813","volume":"24","author":"JS Park","year":"1995","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: An effective hash-based algorithm for mining association rules. ACM SIGMOD Rec. 24(2), 175\u2013186 (1995)","journal-title":"ACM SIGMOD Rec."},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10852-005-9030-1","volume":"5","author":"M Ribeiro","year":"2006","unstructured":"Ribeiro, M., Plastino, A., Martins, S.: Hybridization of grasp metaheuristic with data mining techniques. J. Math. Model. Algorithms 5, 23\u201341 (2006)","journal-title":"J. Math. Model. Algorithms"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J Skorin-Kapov","year":"1990","unstructured":"Skorin-Kapov, J.: Tabu search applied to the quadratic assignment problem. ORSA J. Comput. 2(1), 33\u201345 (1990)","journal-title":"ORSA J. Comput."},{"issue":"4\u20135","key":"9_CR21","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9D Taillard","year":"1991","unstructured":"Taillard, \u00c9.D.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4\u20135), 443\u2013455 (1991)","journal-title":"Parallel Comput."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Taillard, \u00c9.D.: Comparison of iterative searches for the quadratic assignment problem. Location Sci. 3(2), 87\u2013105 (1995). https:\/\/www.sciencedirect.com\/science\/article\/pii\/0966834995000086","DOI":"10.1016\/0966-8349(95)00008-6"},{"key":"9_CR23","unstructured":"Taillard, \u00c9.D.: Fant: Fast ant system. Technical report. IDSIA-46-98, Istituto Dalle Molle Di Studi sull\u2019Intelligenza Artificiale (1998)"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Taillard, \u00c9.D.: A linearithmic heuristic for the travelling salesman problem. EURO J. Oper. Res. 297(2), 442\u2013450 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.05.034. Available online June 2021","DOI":"10.1016\/j.ejor.2021.05.034"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Taillard, \u00c9.D., Heslgaun, K.: POPMUSIC for the travelling salesman problem. EURO J. Oper. Res. 272(2), 420\u2013429 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.06.039","DOI":"10.1016\/j.ejor.2018.06.039"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Wang, R., Yan, J., Yang, X.: Neural graph matching network: learning Lawler\u2019s quadratic assignment problem with extension to hypergraph and multiple-graph matching (2020)","DOI":"10.1109\/TPAMI.2021.3078053"},{"issue":"4","key":"9_CR27","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/MCI.2014.2350953","volume":"9","author":"ZH Zhou","year":"2014","unstructured":"Zhou, Z.H., Chawla, N.V., Jin, Y., Williams, G.J.: Big data opportunities and challenges: Discussions from data analytics perspectives [discussion forum]. IEEE Comput. Intell. Mag. 9(4), 62\u201374 (2014)","journal-title":"IEEE Comput. Intell. Mag."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:03:17Z","timestamp":1688198597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_9","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)"}}]}}