The p-Regions Problem

Vista sencilla de ítem
dc.citation.journalTitleGEOGRAPHICAL ANALYSIS
dc.contributor.authorDuque, Juan C.spa
dc.contributor.authorChurch, Richard L.spa
dc.contributor.authorMiddleton, Richard S.spa
dc.contributor.departmentUniversidad EAFIT. Departamento de Economía y Finanzasspa
dc.contributor.researchgroupResearch in Spatial Economics (RISE)eng
dc.date.accessioned2021-04-12T14:26:14Z
dc.date.available2021-04-12T14:26:14Z
dc.date.issued2011-01-01
dc.description.abstractThe p-regions problem involves the aggregation or clustering of n small areas into p spatially contiguous regions while optimizing some criteria. The main objective of this article is to explore possible avenues for formulating this problem as a mixed integer-programming (MIP) problem. The critical issue in formulating this problem is to ensure that each region is a spatially contiguous cluster of small areas. We introduce three MIP models for solving the p regions problem. Each model minimizes the sum of dissimilarities between all pairs of areas within each region while guaranteeing contiguity. Three strategies designed to ensure contiguity are presented: (1) an adaptation of the Miller, Tucker, and Zemlin tour-breaking constraints developed for the traveling salesman problem; (2) the use of ordered-area assignment variables based upon an extension of an approach by Cova and Church for the geographical site design problem; and (3) the use of flow constraints based upon an extension of work by Shirabe. We test the efficacy of each formulation as well as specify a strategy to reduce overall problem size. © 2011 The Ohio State University.eng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=1596
dc.identifier.doi10.1016/j.econlet.2010.08.004
dc.identifier.issn00167363
dc.identifier.issn15384632
dc.identifier.otherWOS;000284250100002
dc.identifier.otherSCOPUS;2-s2.0-77956875873
dc.identifier.urihttp://hdl.handle.net/10784/28026
dc.language.isoengeng
dc.publisherWILEY-BLACKWELL
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-78650793094&doi=10.1111%2fj.1538-4632.2010.00810.x&partnerID=40&md5=2ae7db1c96724e29b1dea410ff18b3d2
dc.rightshttps://v2.sherpa.ac.uk/id/publication/issn/0016-7363
dc.sourceGEOGRAPHICAL ANALYSIS
dc.subject.keywordcluster analysiseng
dc.subject.keyworddata managementeng
dc.subject.keyworddata seteng
dc.subject.keywordeconometricseng
dc.subject.keywordlinear programingeng
dc.subject.keywordnumerical modeleng
dc.subject.keywordoptimizationeng
dc.titleThe p-Regions Problemeng
dc.typearticleeng
dc.typeinfo:eu-repo/semantics/articleeng
dc.typeinfo:eu-repo/semantics/publishedVersioneng
dc.typepublishedVersioneng
dc.type.localArtículospa

Archivos

Bloque original
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
Geographical Analysis - 2011 - Duque - The p‐Regions Problem p‐.pdf
Tamaño:
397.41 KB
Formato:
Adobe Portable Document Format
Descripción:
Descargar

Colecciones

Artículos