Extensions to K-Medoids with Balance Restrictions over the Cardinality of the Partitions

  • Bernábe-Loranca, Beatriz
  • Gonzalez-Velazquez, Rogelio
  • Olivares-Benitez, Ernesto
  • Ruiz-Vanoye, Jorge A.
  • Flores, José A. Martínez
Abstract:
The zones design occurs when small areas or basic geographic units (BGU) must be grouped into acceptable zones under the requirements imposed by the case study. These requirements can be the generation of intra-connected and/or compact zones or with the same amount of habitants, clients, communication means, public services, etc. In this second point to design a territory, the selection and adaptation of a clustering method capable of generating compact groups while keeping balance in the number of objects that form each group is required. The classic partitioning stands out (also known as classification by partition among the clustering or classification methods [1]). Its properties are very useful to create compact groups. An interesting property of the classification by partitions resides in its capability to group different kinds of data. When working with geographical data, such as the BGU, the partitioning around medoids algorithms have given satisfactory results when the instances are small and only the objective of di stances minimization is optimized. In the presence of additional restrictions, the K-medoids algorithms, present weaknesses in regard to the optimality and feasibility of the solutions. In this work we expose 2 variants of partitioning around medoids for geographical data with balance restrictions over the number of objects within each group keeping the optimality and feasibility of the solution. The first algorithm considers the ideas of k-meoids and extends it with a recursive constructive function to find balanced solutions. The second algorithm searches for solutions taking into account a balance between compactness and the cardinality of the groups (multiobjective). Different tests are presented for different numbers of groups and they are compared with some results obtained with Lagrange Relaxation. This kind of grouping is needed to solve aggregation for Territorial Design problems
Research areas:
Year:
2014
Type of Publication:
Article
Keywords:
Cardinality; grouping; k-medoids
Journal:
Journal of Applied Research and Technology
Volume:
12
Number:
3
Pages:
396-408
ISSN:
1665-6423
Hits: 588