{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T12:08:31Z","timestamp":1743336511241,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"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_30","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"421-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Instance Space Analysis for\u00a0the\u00a0Generalized Assignment Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0856-7162","authenticated-orcid":false,"given":"Tobias","family":"Geibinger","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2100-7733","authenticated-orcid":false,"given":"Lucas","family":"Kletzander","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3992-8637","authenticated-orcid":false,"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"issue":"3","key":"30_CR1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10589-008-9183-8","volume":"45","author":"P Avella","year":"2010","unstructured":"Avella, P., Boccia, M., Vasilyev, I.: A computational study of exact knapsack separation for the generalized assignment problem. Comput. Optim. Appl. 45(3), 543\u2013555 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/S0377-2217(97)00054-4","volume":"108","author":"D Cattrysse","year":"1998","unstructured":"Cattrysse, D., Degraeve, Z., Tistaert, J.: Solving the generalised assignment problem using polyhedral results. Eur. J. Oper. Res. 108(3), 618\u2013628 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0305-0548(96)00032-9","volume":"24","author":"PC Chu","year":"1997","unstructured":"Chu, P.C., Beasley, J.E.: A genetic algorithm for the generalised assignment problem. Comput. Oper. Res. 24(1), 17\u201323 (1997)","journal-title":"Comput. Oper. Res."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"De Coster, A., Musliu, N., Schaerf, A., Schoisswohl, J., Smith-Miles, K.: Algorithm selection and instance space analysis for curriculum-based course timetabling. J. Sched. 1\u201324 (2021)","DOI":"10.1007\/s10951-021-00701-x"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Fernandes, L.H.d.S., Lorena, A.C., Smith-Miles, K.: Towards understanding clustering problems and algorithms: an instance space analysis. Algorithms 14(3), 95 (2021)","DOI":"10.3390\/a14030095"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Fisher, M.L.: The lagrangian relaxation method for solving integer programming problems. Manag. Sci. 50(12_supplement), 1861\u20131871 (2004)","DOI":"10.1287\/mnsc.1040.0263"},{"key":"30_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"5","key":"30_CR8","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"key":"30_CR9","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"},{"issue":"4598","key":"30_CR10","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"7","key":"30_CR11","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10472-020-09695-2","volume":"89","author":"L Kletzander","year":"2021","unstructured":"Kletzander, L., Musliu, N., Smith-Miles, K.: Instance space analysis for a personnel scheduling problem. Ann. Math. Artif. Intell. 89(7), 617\u2013637 (2021)","journal-title":"Ann. Math. Artif. Intell."},{"key":"30_CR12","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Hoboken (1990)"},{"key":"30_CR13","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Solving large-scale constraint-satisfaction and scheduling problems using a heuristic repair method. In: Proceedings of the 8th National Conference on Artificial Intelligence (AAAI 1990), pp. 17\u201324. AAAI Press\/The MIT Press (1990)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, M.A., Smith-Miles, K.: Generating custom classification datasets by targeting the instance space. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1582\u20131588 (2017)","DOI":"10.1145\/3067695.3082532"},{"issue":"3","key":"30_CR15","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1162\/evco_a_00262","volume":"28","author":"MA Mu\u00f1oz","year":"2020","unstructured":"Mu\u00f1oz, M.A., Smith-Miles, K.: Generating new space-filling test instances for continuous black-box optimization. Evol. Comput. 28(3), 379\u2013404 (2020)","journal-title":"Evol. Comput."},{"issue":"4","key":"30_CR16","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1162\/evco_a_00194","volume":"25","author":"MA Mu\u00f1oz","year":"2017","unstructured":"Mu\u00f1oz, M.A., Smith-Miles, K.A.: Performance analysis of continuous black-box optimization algorithms via footprints in instance space. Evol. Comput. 25(4), 529\u2013554 (2017)","journal-title":"Evol. Comput."},{"issue":"1","key":"30_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10994-017-5629-5","volume":"107","author":"MA Mu\u00f1oz","year":"2018","unstructured":"Mu\u00f1oz, M.A., Villanova, L., Baatar, D., Smith-Miles, K.: Instance spaces for machine learning classification. Mach. Learn. 107(1), 109\u2013147 (2018)","journal-title":"Mach. Learn."},{"key":"30_CR18","unstructured":"Mu\u00f1oz, M.A., Smith-Miles, K.: Instance space analysis: a toolkit for the assessment of algorithmic power (2020)"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"\u00d6ncan, T.: A survey of the generalized assignment problem and its applications. INFOR: Inf. Syst. Oper. Res. 45(3), 123\u2013141 (2007)","DOI":"10.3138\/infor.45.3.123"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01720977","volume":"17","author":"IH Osman","year":"1995","unstructured":"Osman, I.H.: Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches. OR Spektrum 17, 211\u2013255 (1995)","journal-title":"OR Spektrum"},{"issue":"3","key":"30_CR22","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s10589-011-9432-0","volume":"52","author":"M Posta","year":"2012","unstructured":"Posta, M., Ferland, J.A., Michelon, P.: An exact method with variable fixing for solving the generalized assignment problem. Comput. Optim. Appl. 52(3), 629\u2013644 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Rice, J.: The algorithm selection problem. In: Advances in Computers, vol. 15, pp. 65\u2013118. Elsevier (1976)","DOI":"10.1016\/S0065-2458(08)60520-3"},{"issue":"1","key":"30_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF01580430","volume":"8","author":"GT Ross","year":"1975","unstructured":"Ross, G.T., Soland, R.M.: A branch and bound algorithm for the generalized assignment problem. Math. Program. 8(1), 91\u2013103 (1975)","journal-title":"Math. Program."},{"issue":"6","key":"30_CR25","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831\u2013841 (1997)","journal-title":"Oper. Res."},{"key":"30_CR26","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"K Smith-Miles","year":"2014","unstructured":"Smith-Miles, K., Baatar, D., Wreford, B., Lewis, R.: Towards objective measures of algorithm performance across instance space. Comput. Oper. Res. 45, 12\u201324 (2014)","journal-title":"Comput. Oper. Res."},{"key":"30_CR27","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.cor.2015.04.022","volume":"63","author":"K Smith-Miles","year":"2015","unstructured":"Smith-Miles, K., Bowly, S.: Generating new test instances by evolving in instance space. Comput. Oper. Res. 63, 102\u2013113 (2015)","journal-title":"Comput. Oper. Res."},{"key":"30_CR28","unstructured":"Smith-Miles, K., Mu\u00f1oz, M.A.: Instance space analysis for algorithm testing: methodology and software tools (2021)"},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K., Tan, T.T.: Measuring algorithm footprints in instance space. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2012)","DOI":"10.1109\/CEC.2012.6252992"},{"key":"30_CR30","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.procs.2017.05.188","volume":"108","author":"DS Souza","year":"2017","unstructured":"Souza, D.S., Santos, H.G., Coelho, I.M.: A hybrid heuristic in GPU-CPU based on scatter search for the generalized assignment problem. Procedia Comput. Sci. 108, 1404\u20131413 (2017)","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"30_CR31","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/opre.21.1.284","volume":"21","author":"V Srinivasan","year":"1973","unstructured":"Srinivasan, V., Thompson, G.L.: An algorithm for assigning uses to sources in a special class of transportation problems. Oper. Res. 21(1), 284\u2013295 (1973)","journal-title":"Oper. Res."},{"key":"30_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105661","volume":"141","author":"S Strassl","year":"2022","unstructured":"Strassl, S., Musliu, N.: Instance space analysis and algorithm selection for the job shop scheduling problem. Comput. Oper. Res. 141, 105661 (2022)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"30_CR33","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1016\/j.ejor.2010.05.007","volume":"207","author":"AJ Woodcock","year":"2010","unstructured":"Woodcock, A.J., Wilson, J.M.: A hybrid tabu search\/branch & bound approach to solving the generalized assignment problem. Eur. J. Oper. Res. 207(2), 566\u2013578 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR34","doi-asserted-by":"crossref","unstructured":"Wu, W., Yagiura, M., Ibaraki, T.: Generalized assignment problem. In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, pp. 713\u2013736. Chapman and Hall\/CRC (2018)","DOI":"10.1201\/9781351236423-40"},{"key":"30_CR35","doi-asserted-by":"crossref","unstructured":"Yagiura, M., Ibaraki, T.: Recent metaheuristic algorithms for the generalized assignment problem. In: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS 2004), pp. 229\u2013237 (2004)","DOI":"10.1109\/ICKS.2004.1313429"},{"issue":"2","key":"30_CR36","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1080\/10556789808805722","volume":"10","author":"M Yagiura","year":"1998","unstructured":"Yagiura, M., Yamaguchi, T., Ibaraki, T.: A variable depth search algorithm with branching search for the generalized assignment problem. Optim. Methods Softw. 10(2), 419\u2013441 (1998)","journal-title":"Optim. Methods Softw."},{"key":"30_CR37","doi-asserted-by":"crossref","unstructured":"Yap, E., Munoz, M.A., Smith-Miles, K., Liefooghe, A.: Instance space analysis of combinatorial multi-objective optimization problems. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/CEC48606.2020.9185664"}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T21:34:46Z","timestamp":1728941686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_30","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)"}}]}}