Districting problems
Districting is the problem of grou** small geographic areas, called basic units, into larger
geographic clusters, called districts, such that the latter are balanced, contiguous, and …
geographic clusters, called districts, such that the latter are balanced, contiguous, and …
A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and p-median-based dispersion minimization
A districting problem consisting of the minimization of a dispersion function subject to
multiple-activity balancing and contiguity constraints is addressed. This problem arises from …
multiple-activity balancing and contiguity constraints is addressed. This problem arises from …
Heuristic algorithms for districting problems
AZ Gliesch - 2023 - lume.ufrgs.br
In this thesis we study districting, a general class of optimization problem which asks for the
grou** of small geographical units into disjoint clusters, called districts. Districting …
grou** of small geographical units into disjoint clusters, called districts. Districting …
[PDF][PDF] A Location-Allocation-Improvement Heuristic for Districting with Multiple-Activity Balancing Constraints and p-Median-Based Dispersion Minimization1
A districting problem consisting of the minimization of a dispersion function subject to
multipleactivity balancing and contiguity constraints is addressed. This problem arises from …
multipleactivity balancing and contiguity constraints is addressed. This problem arises from …
Bi-objective Grou** and Tabu Search
MB Bernábe Loranca, M Marleni Reyes… - … Conference on Hybrid …, 2022 - Springer
When dealing with small sizes in zone design, the problem can have a polynomial cost
solution by exact methods. Otherwise, the combinatorial nature of this problem is …
solution by exact methods. Otherwise, the combinatorial nature of this problem is …
and Alberto Carrillo Canán³ 1 Facultad de Ciencias de la Computación, Benemérita Universidad Autónoma de Puebla México, Puebla, México beatriz. bernabe …
MBB Loranca¹, MM Reyes… - Hybrid Intelligent Systems …, 2023 - books.google.com
When dealing with small sizes in zone design, the problem can have a polynomial cost
solution by exact methods. Otherwise, the combinatorial nature of this problem is …
solution by exact methods. Otherwise, the combinatorial nature of this problem is …
Optimizando con búsqueda tabú en particionamiento sobre datos espaciales con múltiples objetivos
El particionamiento sobre datos geográficos es de gran utilidad para resolver problemas
relacionados con diseno territorial. Para instancias de tamano pequeno, este problema …
relacionados con diseno territorial. Para instancias de tamano pequeno, este problema …
Optimization with tabu search in spatial data clustering with multiple objectives
MB Bernábe Loranca, MA Rodríguez Flores… - Revista de Matemática …, 2023 - scielo.sa.cr
El particionamiento sobre datos geográficos es de gran utilidad para resolver problemas
relacionados con diseño territorial. Para instancias de tamaño pequeño, este problema …
relacionados con diseño territorial. Para instancias de tamaño pequeño, este problema …
Tabu search in multi-objetive clustering
MB Bernábe, MA Rodríguez, JA Vanoye, R González… - 2017 - IET
The clustering of geographic units, zones or areas has been used to solve problems related
to Territorial Design. Clustering adapts to the definition of territorial design for a specific …
to Territorial Design. Clustering adapts to the definition of territorial design for a specific …
Heurística para la generación de zonas de distribución postal
FF Cavieres Vásquez - 2021 - repositorio.uchile.cl
En este trabajo, se logró conceptualizar un modelo matemático para resolver el problema
del distritaje de códigos postales y la generación de zonas de distribución postal para la …
del distritaje de códigos postales y la generación de zonas de distribución postal para la …