NEW GENETIC ALGORITHM WITH GREEDY HEURISTIC FOR CLUSTERING PROBLEMS WITH UNKNOWN NUMBER OF GROUPS

Lev A. Kazakovtsev, Victor I. Orlov, Vladimir L. Kazakovtsev

DOI Number
-
First page
907
Last page
917

Abstract


In this research, we propose new modification of the genetic algorithm with
greedy heuristic witch allows to solve series of clustering problems with unknown number of groups (clusters). The applicability and efficiency of new method is experimentally proved. Achieved results are compared with other algorithms which solve each of problems separately. Experiments show that new algorithm is faster than other methods for various problems.


Keywords

Clustering, genetic algorithms, greedy heuristic, optimization.

Keywords


Clustering; genetic algorithms; greedy heuristic; optimization

Full Text:

PDF

References


G.N. Diubin and A.A. Korbut: Greedy algorithms for the knapsack problem: behavior in the mean. Sibirskii jurnal industrialnoi matematiki 2, issue 2 (1999),68-93.

L.A. Kazakovtsev: Evolutionary algorithm for k-medoid problem. Sistemi upravlenia I informatsionnie tehnologii. 1 (2015), 95-99.

W. Sheng and X. Liu: A Genetic K-Medoids Clustering Algorithm. Journal of Heuristics. 12, issue 6 (2004), 447-466.

O. Alp, E. Erkut and Z. Drezner: An Efficient Genetic Algorithm for the p-Median Problem. Annals of Operations Research. 122, issue 1-4 (2003), 21-42.

A.N. Antamoshkin and L.A. Kazakovtsev: Random Search Algorithm for the p-Median Problem. Informatica. 37 (2013), 267-278.

L. Cooper: Location-allocation problem. Oper. Res. 11 (1963), 331-343.

D. Arthur, B. Manthey and H. Roglin: k-Means Has Polynomial Smoothed Complexity. Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS '09), Washington:IEEE Computer Society (2009), 405-414, DOI: 10.1109/FOCS.2009.14.

L.A. Rastrigin: This random, random, random world. Molodaia gvardia, Moscow, 1974.

A.N. Antamoshkin: Optimizing of functional with Boolean variables. Publishing house of Tomsk university, Tomsk, 1987

G.K. Voronovskii, K.V. Mahotilo, S.N. Petrashev and S.A. Sergeev:

Genetic algorithms, articial neural networks and virtual reality problems. Osnova, Kharkov, 1997

C.M. Hosage and M.F. Goodchild: Discrete Space Location-Allocation Solutions from Genetic Algorithms. Annals of Operations Research. 6 (1986), 35-46.

Z. Drezner, H. Hamacher and other: Facility Location: Applications and Theory. Springer, (2002).

L.A. Kazakovtsev, V.I. Orlov, A.A. Stupina and V.L. Kazakovtsev: Modified Genetic Algorithm with Greedy Heuristic for Continuous and Discrete pMedian Problems. Facta Universitatis Series Mathematics and Informatics. 30, issue 1 (2015), 89-106.

V.L Kazakovtsev and L.A. Kazakovtsev: About methods of solving of big combinatorial problems. Collection of research papers of II international scientific practical conference of students "Osennii shkolnii marafon". (2014), 72-76.

L.A. Kazakovtsev and A.N. Antamoshkin: Method of greedy heuristics for location problems. Vestnik SibGAU. 16, issue 2 (2015), 317-325.

N.V. Kopliarova, V.I. Orlov, N.A. Sergeeva and V.V. Fedosov: About

nonparametric models in electronic chips diagnostic problems. Zavodskaia laboratoria. Diagnostika materialov. 80, issue 7 (2014), 73-77.


Refbacks

  • There are currently no refbacks.




© University of Niš | Created on November, 2013
ISSN 0352-9665 (Print)
ISSN 2406-047X (Online)