A Multiobjective Algorithm for Redistricting
Redistricting is the redrawing of the boundaries of legislative districts for electoral purposes in such a way that the generated districts fulfill federal and state requirements such as contiguity, population equality and compactness. In this paper we solve the problem by means of a single objectiv...
| Autores: | , , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2013 |
| País: | México |
| Institución: | Universidad Nacional Autónoma de México |
| Repositorio: | Redalyc-UNAM |
| OAI Identifier: | oai:redalyc.org:47427855002 |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=47427855002 |
| Access Level: | acceso abierto |
| Palabra clave: | Ingeniería Redistricting mutiobjective simulated annealing |
| Sumario: | Redistricting is the redrawing of the boundaries of legislative districts for electoral purposes in such a way that the generated districts fulfill federal and state requirements such as contiguity, population equality and compactness. In this paper we solve the problem by means of a single objective and a multiobjective simulated annealing algorithm. These algorithms were applied in two real examples in Mexico. The results show that the performance of the multiobjective approach is better, leading to higher quality zones. |
|---|