A Greedy Heuristic Algorithm for Location-based Group Formation

Presently, location-based Group formation has become more important in many areas. Fundamentally, it is a way to assign all members to suitable groups in order to gain the maximum benefits and accomplish their objectives. However, the process of group formation based on member's location may cause a problem as it can be time-consuming if the number of members is large and more factors are considered in forming the groups. In order to cope with this problem, we proposed two variants of heuristic algorithm based on greedy algorithm in order to generate the optimized groups of nearby individual members, who are located in different locations. In this paper, we present our experimental results and illustrate that it produces optimal results for small problem sizes. Additionally, the experimental results demonstrated that the greedy algorithms produce the solutions with the intent of finding a global optimum.