DocumentCode
1788600
Title
Fast genetic algorithm with greedy heuristic for p-median and k-means problems
Author
Kazakovtsev, Lev A. ; Stupina, Aljona A.
Author_Institution
Inst. of Comput. Sci. & Telecommun., Siberian State Aerosp. Univ., Krasnoyarsk, Russia
fYear
2014
fDate
6-8 Oct. 2014
Firstpage
602
Lastpage
606
Abstract
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.
Keywords
facility location; genetic algorithms; continuous problems; genetic algorithm; greedy heuristic; k-means problems; location problems; p-median problems; Approximation algorithms; Clustering algorithms; Control systems; Genetic algorithms; Sociology; Statistics; Telecommunications; cluster analysis; genetic algorithm; k-means; location problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2014 6th International Congress on
Conference_Location
St. Petersburg
Type
conf
DOI
10.1109/ICUMT.2014.7002169
Filename
7002169
Link To Document