{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:57:36Z","timestamp":1766138256172,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"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_46","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"544-553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Tabu Search Matheuristic for\u00a0the\u00a0Generalized Quadratic Assignment Problem"],"prefix":"10.1007","author":[{"given":"Peter","family":"Greistorfer","sequence":"first","affiliation":[]},{"given":"Rostislav","family":"Stan\u011bk","sequence":"additional","affiliation":[]},{"given":"Vittorio","family":"Maniezzo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","unstructured":"Cordeau, J.-F., Gaudioso, M., Laporte, G., Moccia, L.: A memetic heuristic for the generalized quadratic assignment problem. INFORMS J. Comput. 18(4), 433\u2013443 (2006). https:\/\/doi.org\/10.1287\/ijoc.1040.0128","DOI":"10.1287\/ijoc.1040.0128"},{"key":"46_CR2","unstructured":"Greistorfer, P., Stan\u011bk, R., Maniezzo, V.: The magnifying glass heuristic for the generalized quadratic assignment problem. In: Proceedings of the XIII Metaheuristics International Conference, MIC 2019, pp. 22\u201324. Universidad de los Andes Sede Caribe (2019)"},{"key":"46_CR3","doi-asserted-by":"publisher","unstructured":"Greistorfer, P., Vo\u00df, S.: Controlled pool maintenance for metaheuristics. In: Sharda, R., Vo\u00df, S., Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution. Operations Research\/Computer Science Interfaces Series, vol. 30, pp. 387\u2013424. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/0-387-23667-8_18","DOI":"10.1007\/0-387-23667-8_18"},{"issue":"3","key":"46_CR4","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0377-2217(78)90095-4","volume":"2","author":"L Kaufman","year":"1978","unstructured":"Kaufman, L., Broeckx, F.C.: An algorithm for the quadratic assignment problem using Bender\u2019s decomposition. Eur. J. Oper. Res. 2(3), 204\u2013211 (1978)","journal-title":"Eur. J. Oper. Res."},{"key":"46_CR5","unstructured":"Lee, C.-G., Ma, Z.: The generalized quadratic assignment problem. Research report, Department of Mechanical and Industrial Engineering, University of Toronto (2003)"},{"key":"46_CR6","series-title":"EURO Advanced Tutorials on Operational Research","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-70277-9","volume-title":"Matheuristics: Algorithms and Implementations","author":"V Maniezzo","year":"2021","unstructured":"Maniezzo, V., Boschetti, M.A., St\u00fctzle, T.: Matheuristics: Algorithms and Implementations. EURO Advanced Tutorials on Operational Research, Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-70277-9"},{"key":"46_CR7","unstructured":"Maniezzo, V., Greistorfer, P., Stan\u011bk, R.: Exponential neighborhood search for the generalized quadratic assignment problem. EURO\/ALIO International Conference on Applied Combinatorial Optimization, 25\u201327 June 2018, Bologna, Italy (2018)"},{"key":"46_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1306-7","volume-title":"Matheuristics: Hybridizing Metaheuristics and Mathematical Programming","author":"V Maniezzo","year":"2009","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, 1st edn. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-1-4419-1306-7","edition":"1"},{"issue":"4","key":"46_CR9","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cor.2019.01.016","volume":"108","author":"R Stan\u011bk","year":"2019","unstructured":"Stan\u011bk, R., Greistorfer, P., Ladner, K., Pferschy, U.: Geometric and LP-based heuristics for angular travelling salesman problems in the plane. Comput. Oper. Res. 108, 97\u2013111 (2019)","journal-title":"Comput. Oper. Res."}],"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_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:05:57Z","timestamp":1688198757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_46","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)"}}]}}