On the Performance of the Subtour Elimination Constraints Approach for the p-Regions Problem: A Computational Study

Vista sencilla de ítem
dc.citation.journalTitleGEOGRAPHICAL ANALYSIS
dc.contributor.authorDuque JCspa
dc.contributor.authorMario C. Vélez-Gallegospa
dc.contributor.authorEcheverri, Laura Catalinaspa
dc.contributor.departmentUniversidad EAFIT. Departamento de Economía y Finanzasspa
dc.contributor.researchgroupResearch in Spatial Economics (RISE)eng
dc.date.accessioned2021-04-12T14:26:19Z
dc.date.available2021-04-12T14:26:19Z
dc.date.issued2018-01-01
dc.description.abstractThe p-regions is a mixed integer programming (MIP) model for the exhaustive clustering of a set of n geographic areas into p spatially contiguous regions while minimizing measures of intraregional heterogeneity. This is an NP-hard problem that requires a constant research of strategies to increase the size of instances that can be solved using exact optimization techniques. In this article, we explore the benefits of an iterative process that begins by solving the relaxed version of the p-regions that removes the constraints that guarantee the spatial contiguity of the regions. Then, additional constraints are incorporated iteratively to solve spatial discontinuities in the regions. In particular we explore the relationship between the level of spatial autocorrelation of the aggregation variable and the benefits obtained from this iterative process. The results show that high levels of spatial autocorrelation reduce computational times because the spatial patterns tend to create spatially contiguous regions. However, we found that the greatest benefits are obtained in two situations: (1) when n/p=3; and (2) when the parameter p is close to the number of clusters in the spatial pattern of the aggregation variable. © 2017 The Ohio State Universityeng
dc.identifierhttps://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=7492
dc.identifier.doi10.3390/rs9090895
dc.identifier.issn00167363
dc.identifier.issn15384632
dc.identifier.otherWOS;000414138700025
dc.identifier.otherSCOPUS;2-s2.0-85029393426
dc.identifier.urihttp://hdl.handle.net/10784/28062
dc.language.isoengeng
dc.publisherWILEY-BLACKWELL
dc.relation.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85040833963&doi=10.1111%2fgean.12132&partnerID=40&md5=3cfa4199ae69f2aa8a70533f6aeb8ed0
dc.rightshttps://v2.sherpa.ac.uk/id/publication/issn/0016-7363
dc.sourceGEOGRAPHICAL ANALYSIS
dc.subject.keywordcomputer simulationeng
dc.subject.keywordheterogeneityeng
dc.subject.keywordnumerical modeleng
dc.subject.keywordoptimizationeng
dc.subject.keywordparameterizationeng
dc.subject.keywordperformance assessmenteng
dc.subject.keywordspatial analysiseng
dc.titleOn the Performance of the Subtour Elimination Constraints Approach for the p-Regions Problem: A Computational Studyeng
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 - 2017 - Duque - On the Performance of the Subtour Elimination Constraints Approach for the p‐Regions.pdf
Tamaño:
335.33 KB
Formato:
Adobe Portable Document Format
Descripción:
Descargar

Colecciones

Artículos