{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:57Z","timestamp":1742913297613,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031274398"},{"type":"electronic","value":"9783031274404"}],"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-27440-4_39","type":"book-chapter","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T20:39:41Z","timestamp":1685479181000},"page":"404-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Territorial Design and Vehicle Routing Problem Applied to the Population Census as a Case Study"],"prefix":"10.1007","author":[{"given":"Rogelio","family":"Gonz\u00e1lez-Vel\u00e1zquez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Beatriz","family":"Bern\u00e1be-Loranca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erika","family":"Granillo-Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"De Ita Luna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"issue":"2","key":"39_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221\u2013227 (1981). https:\/\/doi.org\/10.1002\/net.3230110211","journal-title":"Networks"},{"key":"39_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)"},{"unstructured":"Lingo Homepage. http:\/\/www.lingo.com\/. last accessed 2022\/06\/24","key":"39_CR3"},{"issue":"1","key":"39_CR4","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 \u2014 applications, algorithms and GIS integration. TOP 13(1), 1\u201356 (2005). https:\/\/doi.org\/10.1007\/BF02578982","journal-title":"TOP"},{"issue":"11","key":"39_CR5","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(11), 1237\u20131256 (1983). https:\/\/doi.org\/10.1287\/mnsc.29.11.1237","journal-title":"Manage. Sci."},{"issue":"5","key":"39_CR6","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, F., Painho, V.: Applying genetic algorithms to zone design. Soft Comput. Fusion Found. Methodol. Appl. 9(5), 341\u2013348 (2005). https:\/\/doi.org\/10.1007\/s00500-004-0413-4","journal-title":"Soft Comput. Fusion Found. Methodol. Appl."},{"issue":"8","key":"39_CR7","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1287\/mnsc.44.8.1100","volume":"44","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra, A., Johnson, E.L., Nemhauser, G.L.: An optimization based heuristic for political districting. Manage. Sci. 44(8), 1100\u20131114 (1998). https:\/\/doi.org\/10.1287\/mnsc.44.8.1100","journal-title":"Manage. Sci."},{"issue":"3","key":"39_CR8","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1068\/a270425","volume":"27","author":"S Openshaw","year":"1995","unstructured":"Openshaw, S., Rao, L.: Algorithms for reengineering 1991 census geography. Environ. Plann. A Econ. Space 27(3), 425\u2013446 (1995). https:\/\/doi.org\/10.1068\/a270425","journal-title":"Environ. Plann. A Econ. Space"},{"issue":"1","key":"39_CR9","first-page":"81","volume":"23","author":"M Altman","year":"1997","unstructured":"Altman, M.: The computational complexity of automated redistricting: is automation the answer? Rutgers Comput. Technol. Law J. 23(1), 81\u2013142 (1997)","journal-title":"Rutgers Comput. Technol. Law J."},{"unstructured":"Correa, E.S., Steiner, M.T.A., Freitas, A.A., Carnieri, C.: A genetic algorithm for the P-median problem. In: Spector, L.E., Goodman, E., et al. (eds) Proceeding 2001 Genetic and Evolutionary Computation Conference (GECCO-2001), pp. 182\u2013196. San Francisco, USA (2001)","key":"39_CR10"},{"unstructured":"Bern\u00e1be, B., Osorio, L., Espinosa, R., Ramirez, R., Aceves, R.: A comparative study of simulated annealing and variable neighborhood search for the geographic clustering problem. In: Computaci\u00f3n y Sistemas (eds) The 2009 International Conference on Data Mining 2009 (DMIN 2009), pp. 595\u2013599. Puebla, M\u00e9xico (2009)","key":"39_CR11"},{"issue":"3","key":"39_CR12","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","volume":"1","author":"IH Osman","year":"1994","unstructured":"Osman, I.H., Christofides, N.: Capacitated clustering problems by hybrid simulated annealing and tabu search. Intern. Trans. Oper. Res. 1(3), 317\u2013336 (1994)","journal-title":"Intern. Trans. Oper. Res."},{"unstructured":"Mart\u00ed, R.: Procedimientos metaheur\u00edsticos en optimizaci\u00f3n combinatoria. Tech. rep., Departamento de Estad\u00edstica e Investigaci\u00f3n Operativa, Facultad de Matematicas, Universidad de Valencia (2002)","key":"39_CR13"},{"unstructured":"Bern\u00e1be, B.: Integraci\u00f3n de un Sistema de Informaci\u00f3n Geogr\u00e1fica para Algoritmos de Particionamiento. Unpublished (2013)","key":"39_CR14"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"123691","DOI":"10.1016\/j.jclepro.2020.123691","volume":"279","author":"R Moghdani","year":"2021","unstructured":"Moghdani, R., Salimifard, K., Demir, E., Benyettou, A.: The green vehicle routing problem: a systematic literature review. J. Clean. Prod. 279, 123691 (2021). https:\/\/doi.org\/10.1016\/j.jclepro.2020.123691","journal-title":"J. Clean. Prod."},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.trb.2019.06.006","volume":"126","author":"S Pelletier","year":"2019","unstructured":"Pelletier, S., Jabali, O., Laporte, G.: The electric vehicle routing problem with energy consumption uncertainty. Transp. Res. Part B Methodol. 126, 225\u2013255 (2019). https:\/\/doi.org\/10.1016\/j.trb.2019.06.006","journal-title":"Transp. Res. Part B Methodol."},{"issue":"3","key":"39_CR17","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1007\/s12351-020-00600-7","volume":"22","author":"GD Konstantakopoulos","year":"2022","unstructured":"Konstantakopoulos, G.D., Gayialis, S.P., Kechagias, E.P.: Vehicle routing problem and related algorithms for logistics distribution: a literature review and classification. Oper. Res. 22(3), 2033\u20132062 (2022). https:\/\/doi.org\/10.1007\/s12351-020-00600-7","journal-title":"Oper. Res."},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"106242","DOI":"10.1016\/j.cie.2019.106242","volume":"140","author":"R Elshaer","year":"2020","unstructured":"Elshaer, R., Awad, H.: A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Comput. Ind. Eng. 140, 106242 (2020). https:\/\/doi.org\/10.1016\/j.cie.2019.106242","journal-title":"Comput. Ind. Eng."},{"key":"39_CR19","doi-asserted-by":"publisher","first-page":"134743","DOI":"10.1109\/ACCESS.2020.3010176","volume":"8","author":"J Pasha","year":"2020","unstructured":"Pasha, J., Dulebenets, M.A., Kavoosi, M., Abioye, O.F., Wang, H., Guo, W.: An optimization model and solution algorithms for the vehicle routing problem with a factory-in-a-box. IEEE Access 8, 134743\u2013134763 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3010176","journal-title":"IEEE Access"},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers, M., Laporte, G.: Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints. Oper. Res. Lett. 10, 27\u201336 (1991)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"39_CR21","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The traveling salesman problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(2), 231\u2013247 (1992). https:\/\/doi.org\/10.1016\/0377-2217(92)90138-Y","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Systems Design and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27440-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T20:46:48Z","timestamp":1685479608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27440-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031274398","9783031274404"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27440-4_39","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Systems Design and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isda2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mirlabs.net\/isda22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}