Lagrangean relaxation for the geographical partitioning problem
Guardado en:
| Autores: | , , , , |
|---|---|
| 格式: | artículo original |
| 狀態: | Versión publicada |
| Fecha de Publicación: | 2012 |
| 實物特徵: | Among methodologies used in territory clustering, stand location-allocation and set partitioning models, to group small geographic areas, usually called “basic units” into a given number of larger groups called “territories”. The territory clustering problem is modeled as a p-median problem. A Lagrangean relaxation is used to obtain lower bounds to the optimal solution of the problem and a procedure is used to obtain upper bounds. In order to evaluate the performance of the proposed procedure, instances of two Mexico cities are used. The results obtained with the proposed method are compared to partitioning methods from the literature. According to the obtained results for the considered instances using different number of groups, optimal or near optimal solution are obtained with a reasonable amount of computer effort. |
| País: | Portal de Revistas UCR |
| 機構: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| 語言: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/1332 |
| 在線閱讀: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/1332 |
| Palabra clave: | partitioning Lagrangean relaxation heuristics particionamiento relajación Lagrangena heurísticas |