{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:19:51Z","timestamp":1742962791925,"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_23","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"322-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fixed Set Search Applied to\u00a0the\u00a0Territory Design Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6569-2250","authenticated-orcid":false,"given":"Tobias","family":"Cors","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7942-7426","authenticated-orcid":false,"given":"Tobias","family":"Vl\u0107ek","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8167-1516","authenticated-orcid":false,"given":"Raka","family":"Jovanovic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","volume":"68","author":"C Blum","year":"2016","unstructured":"Blum, C., Pinacho, P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Lozano, J.A.: Construct, merge, solve & adapt A new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75\u201388 (2016). https:\/\/doi.org\/10.1016\/j.cor.2015.10.014","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer. Math."},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/bf01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109\u2013133 (1995). https:\/\/doi.org\/10.1007\/bf01096763","journal-title":"J. Global Optim."},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00663.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP - part I: algorithms. Int. Trans. Oper. Res. 16(1), 1\u201324 (2009). https:\/\/doi.org\/10.1111\/j.1475-3995.2009.00663.x","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","volume":"16","author":"P Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP - part II: applications. Int. Trans. Oper. Res. 16(2), 131\u2013172 (2009). https:\/\/doi.org\/10.1111\/j.1475-3995.2009.00664.x","journal-title":"Int. Trans. Oper. Res."},{"key":"23_CR6","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-30671-6_5","volume-title":"Hybrid Metaheuristics","author":"P Festa","year":"2013","unstructured":"Festa, P., Resende, M.G.C.: Hybridizations of GRASP with path-relinking. In: Talbi, E.G. (ed.) Hybrid Metaheuristics. Studies in Computational Intelligence, vol. 434, pp. 135\u2013155. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-30671-6_5"},{"key":"23_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY (1979)"},{"key":"23_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s12469-022-00292-6","author":"L Ge","year":"2022","unstructured":"Ge, L., Kliewer, N., Nourmohammadzadeh, A., Vo\u00df, S., Xie, L.: Revisiting the richness of integrated vehicle and crew scheduling. Public Transp. (2022). https:\/\/doi.org\/10.1007\/s12469-022-00292-6","journal-title":"Public Transp."},{"unstructured":"Geofabrik GmbH and OpenStreetMap Contributors: OpenStreetMap Data Hamburg (2020). https:\/\/download.geofabrik.de\/europe\/germany\/hamburg.html","key":"23_CR9"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"JP Hart","year":"1987","unstructured":"Hart, J.P., Shogan, A.W.: Semi-greedy heuristics: an empirical study. Oper. Res. Lett. 6(3), 107\u2013114 (1987). https:\/\/doi.org\/10.1016\/0167-6377(87)90021-6","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1002\/net.21674","volume":"67","author":"A Hill","year":"2016","unstructured":"Hill, A., Vo\u00df, S.: An equi-model matheuristic for the multi-depot ring star problem. Networks 67(3), 222\u2013237 (2016). https:\/\/doi.org\/10.1002\/net.21674","journal-title":"Networks"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10732-022-09499-z","volume":"28","author":"R Jovanovic","year":"2022","unstructured":"Jovanovic, R., Sanfilippo, A.P., Vo\u00df, S.: Fixed set search applied to the multi-objective minimum weighted vertex cover problem. J. Heuristics 28, 481\u2013508 (2022). https:\/\/doi.org\/10.1007\/s10732-022-09499-z","journal-title":"J. Heuristics"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-05983-5_5","volume":"11299","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: Fixed set search applied to the traveling salesman problem. Lect. Notes Comput. Sci. 11299, 63\u201377 (2019). https:\/\/doi.org\/10.1007\/978-3-030-05983-5_5","journal-title":"Lect. Notes Comput. Sci."},{"issue":"6","key":"23_CR14","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12559","volume":"37","author":"R Jovanovic","year":"2020","unstructured":"Jovanovic, R., Voss, S.: The fixed set search applied to the power dominating set problem. Expert. Syst. 37(6), e12559 (2020). https:\/\/doi.org\/10.1111\/exsy.12559","journal-title":"Expert. Syst."},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-030-34029-2\\_31","volume":"11544","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Vo\u00df, S.: Fixed set search applied to the minimum weighted vertex cover problem. Lect. Notes Comput. Sci. 11544, 490\u2013504 (2019). https:\/\/doi.org\/10.1007\/978-3-030-34029-2_31","journal-title":"Lect. Notes Comput. Sci."},{"issue":"3","key":"23_CR16","doi-asserted-by":"publisher","first-page":"775","DOI":"10.2298\/aadm190227052j","volume":"14","author":"R Jovanovic","year":"2020","unstructured":"Jovanovic, R., Vo\u00df, S.: A matheuristic approach for solving the 2-connected dominating set problem. Appl. Anal. Discrete Math. 14(3), 775\u2013799 (2020). https:\/\/doi.org\/10.2298\/aadm190227052j","journal-title":"Appl. Anal. Discrete Math."},{"key":"23_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107521","volume":"110","author":"R Jovanovic","year":"2021","unstructured":"Jovanovic, R., Vo\u00df, S.: Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Appl. Soft Comput. 110, 107521 (2021). https:\/\/doi.org\/10.1016\/j.asoc.2021.107521","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02578982","volume":"13","author":"J Kalcsics","year":"2005","unstructured":"Kalcsics, J., Nickel, S., Schr\u00f6der, M.: Towards a unified territorial design approach \u2013 applications, algorithms and GIS integration. TOP 13(1), 1\u201356 (2005). https:\/\/doi.org\/10.1007\/BF02578982","journal-title":"TOP"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/978-3-030-32177-2_25","volume-title":"Location Sci.","author":"J Kalcsics","year":"2019","unstructured":"Kalcsics, J., R\u00edos-Mercado, R.Z.: Districting problems. In: Laporte, G., Nickel, S., Saldanha da Gama, F. (eds.) Location Sci., pp. 705\u2013743. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32177-2_25"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"539","DOI":"10.2307\/2100911","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. II: the p-medians. SIAM J. Appl. Math. 37(3), 539\u2013560 (1979). https:\/\/doi.org\/10.2307\/2100911","journal-title":"SIAM J. Appl. Math."},{"key":"23_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1306-7","volume-title":"Matheuristics: hybridizing metaheuristics and mathematical programming","year":"2009","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.): Matheuristics: hybridizing metaheuristics and mathematical programming. Springer, Cham (2009). https:\/\/doi.org\/10.1007\/978-1-4419-1306-7"},{"issue":"4","key":"23_CR22","doi-asserted-by":"publisher","first-page":"577","DOI":"10.2307\/1141814","volume":"63","author":"PS Mitchell","year":"1972","unstructured":"Mitchell, P.S.: Optimal selection of police patrol beats. J. Crim. Law Criminol. Police Sci. 63(4), 577 (1972). https:\/\/doi.org\/10.2307\/1141814","journal-title":"J. Crim. Law Criminol. Police Sci."},{"issue":"1","key":"23_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s43069-020-0002-0","volume":"1","author":"HD Mittelmann","year":"2020","unstructured":"Mittelmann, H.D.: Benchmarking optimization software - a (Hi)story. SN Oper. Res. Forum 1(1), 1\u20136 (2020). https:\/\/doi.org\/10.1007\/s43069-020-0002-0","journal-title":"SN Oper. Res. Forum"},{"issue":"3","key":"23_CR24","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/j.ejor.2015.12.005","volume":"251","author":"H \u00d6nal","year":"2016","unstructured":"\u00d6nal, H., Wang, Y., Dissanayake, S.T., Westervelt, J.D.: Optimal design of compact and functionally contiguous conservation management areas. Eur. J. Oper. Res. 251(3), 957\u2013968 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2015.12.005","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR25","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-1-4419-1665-5_10","volume-title":"Handbook of Metaheuristics","author":"MG Resende","year":"2010","unstructured":"Resende, M.G., Ribeiro, C.C.: Greedy randomized adaptive search procedures: advances, hybridizations, and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 283\u2013319. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_10"},{"key":"23_CR26","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-34312-5_1","volume-title":"Optimal Districting and Territory Design","author":"RZ R\u00edos-Mercado","year":"2020","unstructured":"R\u00edos-Mercado, R.Z.: Research trends in optimization of districting systems. In: R\u00edos-Mercado, R.Z. (ed.) Optimal Districting and Territory Design. ISORMS, vol. 284, pp. 3\u20138. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-34312-5_1"},{"issue":"3","key":"23_CR27","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.cor.2007.10.024","volume":"36","author":"RZ R\u00edos-Mercado","year":"2009","unstructured":"R\u00edos-Mercado, R.Z., Fern\u00e1ndez, E.: A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Comput. Oper. Res. 36(3), 755\u2013776 (2009). https:\/\/doi.org\/10.1016\/j.cor.2007.10.024","journal-title":"Comput. Oper. Res."},{"key":"23_CR28","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics","author":"ED Taillard","year":"2002","unstructured":"Taillard, E.D., Vo\u00df, S.: Popmusic\u2014partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics. Operations Research\/Computer Science Interfaces Series, vol. 15, pp. 613\u2013629. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_27"},{"issue":"1","key":"23_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10479-015-2034-y","volume":"240","author":"E-G Talbi","year":"2015","unstructured":"Talbi, E.-G.: Combining metaheuristics with mathematical programming, constraint programming and machine learning. Ann. Oper. Res. 240(1), 171\u2013215 (2015). https:\/\/doi.org\/10.1007\/s10479-015-2034-y","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"23_CR30","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1080\/0305215X.2015.1062094","volume":"48","author":"S Vo\u00df","year":"2016","unstructured":"Vo\u00df, S., Lalla-Ruiz, E.: A set partitioning reformulation for the multiple-choice multidimensional knapsack problem. Eng. Optim. 48(5), 831\u2013850 (2016). https:\/\/doi.org\/10.1080\/0305215X.2015.1062094","journal-title":"Eng. Optim."},{"key":"23_CR31","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1287\/mnsc.29.11.1237","volume":"29","author":"AA Zoltners","year":"1983","unstructured":"Zoltners, A.A., Sinha, P.: Sales territory alignment: a review and model. Manage. Sci. 29, 1237\u20131256 (1983). https:\/\/doi.org\/10.1287\/mnsc.29.11.1237","journal-title":"Manage. Sci."}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:04:11Z","timestamp":1688198651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_23","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)"}}]}}