Fast genetic algorithm with greedy heuristic for p-median and k-means problems

The genetic algorithm with greedy heuristic, initially developed for solving location problems on networks, can be adapted for solving continuous problems such as k-means. However, the efficiency of such algorithm in case of continuous problems does not allow to use it for solving the large-scale problems. In this paper, authors propose a modification to this algorithm which allows such algorithm to work faster.