{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:39Z","timestamp":1759847919947,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774480"},{"type":"electronic","value":"9783319774497"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77449-7_11","type":"book-chapter","created":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T10:27:00Z","timestamp":1519986420000},"page":"158-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Multistart Alternating Tabu Search for Commercial Districting"],"prefix":"10.1007","author":[{"given":"Alex","family":"Gliesch","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Ritt","sequence":"additional","affiliation":[]},{"given":"Mayron C. O.","family":"Moreira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,3]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10479-012-1267-2","volume":"204","author":"F Ricca","year":"2013","unstructured":"Ricca, F., Scozzari, A., Simeone, B.: Political districting: from classical models to recent approaches. Ann. Oper. Res. 204(1), 271\u2013299 (2013)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1016\/j.ejor.2006.08.065","volume":"189","author":"F Ricca","year":"2008","unstructured":"Ricca, F., Simeone, B.: Local search algorithms for political districting. Eur. J. Oper. Res. 189(3), 1409\u20131426 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1287\/inte.1110.0544","volume":"41","author":"B Bozkaya","year":"2011","unstructured":"Bozkaya, B., Erkut, E., Haight, D., Laporte, G.: Designing new electoral districts for the city of Edmonton. Interfaces 41(6), 534\u2013547 (2011)","journal-title":"Interfaces"},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s00500-004-0413-4","volume":"9","author":"F Ba\u00e7\u00e3o","year":"2005","unstructured":"Ba\u00e7\u00e3o, F., Lobo, V., Painho, M.: Applying genetic algorithms to zone design. Soft. Comput. 9(5), 341\u2013348 (2005)","journal-title":"Soft. Comput."},{"issue":"3","key":"11_CR5","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)","journal-title":"Comput. Oper. Res."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cor.2014.11.008","volume":"56","author":"H Lei","year":"2015","unstructured":"Lei, H., Laporte, G., Liu, Y., Zhang, T.: Dynamic design of sales territories. Comput. Oper. Res. 56, 84\u201392 (2015)","journal-title":"Comput. Oper. Res."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.eswa.2015.09.019","volume":"44","author":"RZ R\u00edos-Mercado","year":"2016","unstructured":"R\u00edos-Mercado, R.Z., Escalante, H.J.: GRASP with path relinking for commercial districting. Exp. Syst. Appl. 44, 102\u2013113 (2016). (September 2015)","journal-title":"Exp. Syst. Appl."},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1016\/j.ejor.2015.05.023","volume":"246","author":"M Camacho-Collados","year":"2015","unstructured":"Camacho-Collados, M., Liberatore, F., Angulo, J.M.: A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector. Eur. J. Oper. Res. 246(2), 674\u2013684 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.omega.2014.10.005","volume":"52","author":"MTA Steiner","year":"2015","unstructured":"Steiner, M.T.A., Datta, D., Steiner Neto, P.J., Scarpin, C.T., Rui Figueira, J.: Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil. Omega 52, 53\u201364 (2015)","journal-title":"Omega"},{"issue":"11","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1057\/palgrave.jors.2601625","volume":"54","author":"M Blais","year":"2003","unstructured":"Blais, M., Lapierre, S.D., Laporte, G.: Solving a home-care districting problem in an urban setting. J. Oper. Res. Soc. 54(11), 1141\u20131147 (2003)","journal-title":"J. Oper. Res. Soc."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Gliesch, A., Ritt, M., Moreira, M.C.O.: A genetic algorithm for fair land allocation. In: Genetic and Evolutionary Computation Conference, pp. 793\u2013800. ACM Press (2017)","DOI":"10.1145\/3071178.3071313"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-319-13111-5_23","volume-title":"Location Science","author":"J Kalcsics","year":"2015","unstructured":"Kalcsics, J.: Districting problems. In: Laporte, G., Nickel, S., da Gama, F.S. (eds.) Location Science, pp. 595\u2013622. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-13111-5_23"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s11067-010-9151-6","volume":"11","author":"MA Salazar-Aguilar","year":"2011","unstructured":"Salazar-Aguilar, M.A., R\u00edos-Mercado, R.Z., Cabrera-R\u00edos, M.: New models for commercial territory design. Netw. Spat. Econ. 11(3), 487\u2013507 (2011)","journal-title":"Netw. Spat. Econ."},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10732-011-9160-8","volume":"19","author":"MA Salazar-Aguilar","year":"2013","unstructured":"Salazar-Aguilar, M.A., R\u00edos-Mercado, R.Z., Gonz\u00e1lez-Velarde, J.L.: GRASP strategies for a bi-objective commercial territory design problem. J. Heuristics 19(2), 179\u2013200 (2013)","journal-title":"J. Heuristics"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"October","key":"11_CR16","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1287\/ijoc.2014.0600","volume":"26","author":"A Butsch","year":"2014","unstructured":"Butsch, A., Kalcsics, J., Laporte, G.: Districting for arc routing. INFORMS J. Comput. 26(October), 809\u2013824 (2014)","journal-title":"INFORMS J. Comput."},{"key":"11_CR17","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, 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"11_CR18","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1016\/0305-0548(94)90041-8","volume":"21","author":"E Erkut","year":"1994","unstructured":"Erkut, E., \u00dclk\u00fcsal, Y., Yeni\u00e7erio\u011flu, O.: A comparison of p-dispersion heuristics. Comput. Oper. Res. 21(10), 1103\u20131113 (1994)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"11_CR19","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","volume":"2","author":"RE Tarjan","year":"1974","unstructured":"Tarjan, R.E.: A note on finding the bridges of a graph. Inf. Process. Lett. 2(6), 160\u2013161 (1974)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1007\/s00224-016-9709-x","volume":"61","author":"J \u0141a\u0327cki","year":"2016","unstructured":"\u0141a\u0327cki, J., Sankowski, P.: Optimal decremental connectivity in planar graphs. Theory Comput. Syst. 61(4), 1037\u20131053 (2016)","journal-title":"Theory Comput. Syst."},{"issue":"5","key":"11_CR21","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1287\/opre.1120.1083","volume":"60","author":"DM King","year":"2012","unstructured":"King, D.M., Jacobson, S.H., Sewell, E.C., Cho, W.K.T.: Geo-graphs: an efficient model for enforcing contiguity and hole constraints in planar graph partitioning. Oper. Res. 60(5), 1213\u20131228 (2012)","journal-title":"Oper. Res."},{"key":"11_CR22","unstructured":"Shamos, M.I.: Computational Geometry. Ph.D. thesis (1978)"},{"key":"11_CR23","unstructured":"Har-Peled, S.: On the Expected Complexity of Random Convex Hulls, pp. 1\u201320, November 2011. http:\/\/arxiv.org\/abs\/1111.5340"},{"issue":"5","key":"11_CR24","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0020-0190(79)90072-3","volume":"9","author":"AM Andrew","year":"1979","unstructured":"Andrew, A.M.: Another efficient algorithm for convex hulls in two dimensions. Inf. Process. Lett. 9(5), 216\u2013219 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"11_CR25","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"MH Overmars","year":"1981","unstructured":"Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23(2), 166\u2013204 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","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., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Chou, C., Kimbrough, S.O., Sullivan-Fedock, J., Woodard, C.J., Murphy, F.H.: Using interactive evolutionary computation (IEC) with validated surrogate fitness functions for redistricting. In: Genetic and Evolutionary Computation Conference, pp. 1071\u20131078 (2012)","DOI":"10.1145\/2330163.2330312"},{"issue":"4","key":"11_CR28","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.omega.2012.09.005","volume":"41","author":"E Fern\u00e1ndez","year":"2013","unstructured":"Fern\u00e1ndez, E., Kalcsics, J., Nickel, S.: The maximum dispersion problem. Omega 41(4), 721\u2013730 (2013)","journal-title":"Omega"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77449-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:33:45Z","timestamp":1710354825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77449-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774480","9783319774497"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77449-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"3 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Parma","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2018\/cfp_evocop.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}