{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T18:46:16Z","timestamp":1760985976246,"version":"build-2065373602"},"reference-count":128,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T00:00:00Z","timestamp":1604534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012190","name":"Ministry of Science and Higher Education of the Russian Federation","doi-asserted-by":"publisher","award":["FEFE-2020-0013"],"award-info":[{"award-number":["FEFE-2020-0013"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>The k-means problem is one of the most popular models in cluster analysis that minimizes the sum of the squared distances from clustered objects to the sought cluster centers (centroids). The simplicity of its algorithmic implementation encourages researchers to apply it in a variety of engineering and scientific branches. Nevertheless, the problem is proven to be NP-hard which makes exact algorithms inapplicable for large scale problems, and the simplest and most popular algorithms result in very poor values of the squared distances sum. If a problem must be solved within a limited time with the maximum accuracy, which would be difficult to improve using known methods without increasing computational costs, the variable neighborhood search (VNS) algorithms, which search in randomized neighborhoods formed by the application of greedy agglomerative procedures, are competitive. In this article, we investigate the influence of the most important parameter of such neighborhoods on the computational efficiency and propose a new VNS-based algorithm (solver), implemented on the graphics processing unit (GPU), which adjusts this parameter. Benchmarking on data sets composed of up to millions of objects demonstrates the advantage of the new algorithm in comparison with known local search algorithms, within a fixed time, allowing for online computation.<\/jats:p>","DOI":"10.3390\/computation8040090","type":"journal-article","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T09:04:34Z","timestamp":1604567074000},"page":"90","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Self-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means Clustering"],"prefix":"10.3390","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0667-4001","authenticated-orcid":false,"given":"Lev","family":"Kazakovtsev","sequence":"first","affiliation":[{"name":"Reshetnev Siberian State University of Science and Technology, Institute of Informatics and Telecommunications, Krasnoyarskiy Rabochiy av. 31, 660037 Krasnoyarsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1143-048X","authenticated-orcid":false,"given":"Ivan","family":"Rozhnov","sequence":"additional","affiliation":[{"name":"Reshetnev Siberian State University of Science and Technology, Institute of Informatics and Telecommunications, Krasnoyarskiy Rabochiy av. 31, 660037 Krasnoyarsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksey","family":"Popov","sequence":"additional","affiliation":[{"name":"Reshetnev Siberian State University of Science and Technology, Institute of Informatics and Telecommunications, Krasnoyarskiy Rabochiy av. 31, 660037 Krasnoyarsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8500-2050","authenticated-orcid":false,"given":"Elena","family":"Tovbis","sequence":"additional","affiliation":[{"name":"Reshetnev Siberian State University of Science and Technology, Institute of Informatics and Telecommunications, Krasnoyarskiy Rabochiy av. 31, 660037 Krasnoyarsk, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,11,5]]},"reference":[{"key":"ref_1","unstructured":"Berkhin, P. (2002). Survey of Clustering Data Mining Techniques, Accrue Software."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.2307\/2344237","article-title":"A Review of Classification","volume":"134","author":"Cormack","year":"1971","journal-title":"J. R. Stat. Soc. Ser. A"},{"key":"ref_3","unstructured":"Tsai, C.Y., and Chiu, C.C. (2006, January 20\u201322). A VNS-based hierarchical clustering method. Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (CIMMACS\u201906), Venice, Italy."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least Squares Quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","unstructured":"MacQueen, J.B. (July, January 21). Some Methods of Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkley Symposium on Mathematical Statistics and Probability, Berkeley, CA, USA."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","article-title":"Clustering large graphs via the singular value decomposition","volume":"56","author":"Drineas","year":"2004","journal-title":"Mach. Learn."},{"key":"ref_7","first-page":"351","article-title":"Semi-supervised k-means ddos detection method using hybrid feature selection algorithm","volume":"7","author":"Gu","year":"2019","journal-title":"IEEE Access"},{"key":"ref_8","first-page":"3650926","article-title":"A Robust k-Means Clustering Algorithm Based on Observation Point Mechanism","volume":"2020","author":"Guo","year":"2020","journal-title":"Complexity"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Arabie, P., Hubert, L.J., and Soete, G. (1996). Clustering validation: Results and implications for applied analyses. Clustering and Classification, World Scientific.","DOI":"10.1142\/1930"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1037\/a0023346","article-title":"Choosing the Number of Clusters in K-Means Clustering","volume":"16","author":"Steinley","year":"2011","journal-title":"Psychol. Methods"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/TIT.1982.1056488","article-title":"The complexity of the generalized Lloyd\u2014Max problem (Corresp","volume":"28","author":"Garey","year":"1982","journal-title":") IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","article-title":"NP-hardness of Euclidean sum-of-squares clustering","volume":"75","author":"Aloise","year":"2009","journal-title":"Mach. Learn."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","article-title":"Heuristic methods for location-allocation problems","volume":"6","author":"Cooper","year":"1964","journal-title":"SIAM Rev."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.ejor.2007.02.043","article-title":"A heuristic algorithm for constrained multi-source Weber problem. The variational inequality approach","volume":"187","author":"Jiang","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Arthur, D., Manthey, B., and Roglin, H. (2009, January 25\u201327). k-Means Has Polynomial Smoothed Complexity. Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201909), Atlanta, GA, USA.","DOI":"10.1109\/FOCS.2009.14"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/TIT.1986.1057168","article-title":"Global convergence and empirical consistency of the generalized Lloyd algorithm","volume":"32","author":"Sabin","year":"1986","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1137\/070691334","article-title":"Nondegeneracy and Weak Global Convergence of the Lloyd Algorithm in Rd","volume":"46","author":"Emelianenko","year":"2009","journal-title":"SIAM J. Numer. Anal."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1243\/09544062JMES508","article-title":"Clustering techniques and their applications in engineering. Proceedings of the Institution of Mechanical Engineers, Part C","volume":"221","author":"Pham","year":"2007","journal-title":"J. Mech. Eng. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/64.248353","article-title":"Applying AI clustering to engineering tasks","volume":"8","author":"Fisher","year":"1993","journal-title":"IEEE Expert"},{"key":"ref_20","unstructured":"Gheorghe, G., Cartina, G., and Rotaru, F. (2010, January 21\u201323). Using K-Means Clustering Method in Determination of the Energy Losses Levels from Electric Distribution Systems. Proceedings of the International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering, Timisoara, Romania."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/TGRS.2004.842108","article-title":"Unsupervised classification of polarimetric synthetic aperture radar images using fuzzy clustering and EM clustering","volume":"43","author":"Kersten","year":"2005","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1080\/095372899233064","article-title":"A neural network clustering model for miscellaneous components production planning","volume":"10","author":"Cesarotti","year":"1999","journal-title":"Prod. Plan. Control"},{"key":"ref_23","unstructured":"Kundu, B., White, K.P., and Mastrangelo, C. (2002, January 4\u20137). Defect clustering and classification for semiconductor devices. Proceedings of the 45th Midwest Symposium on Circuits and Systems, Tulsa, Oklahoma."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0952-1976(02)00037-4","article-title":"Classification of turbulent flow patterns with fuzzy clustering","volume":"15","author":"Vernet","year":"2002","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Afify, A.A., Dimov, S., Naim, M.M., and Valeva, V. (2006, January 10\u201312). Detecting cyclical disturbances in supply networks using data mining techniques. Proceedings of the 2nd European Conference on Management of Technology, Birmingham, UK.","DOI":"10.1243\/09544054JEM879"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data clustering: A review","volume":"31","author":"Jain","year":"1999","journal-title":"ACM Comput. Surv."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Naranjo, J.E., Saha, R., Tariq, M.T., Hadi, M., and Xiao, Y. (2019). Pattern Recognition Using Clustering Analysis to Support Transportation System Management, Operations, and Modeling. J. Adv. Transp.","DOI":"10.1155\/2019\/1628417"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Kadir, R.A., Shima, Y., Sulaiman, R., and Ali, F. (2018, January 9\u201312). Clustering of public transport operation using K-means. Proceedings of the 2018 IEEE 3rd International Conference on Big Data Analysis (ICBDA), Shanghai, China.","DOI":"10.1109\/ICBDA.2018.8367721"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"40","DOI":"10.5120\/16673-6677","article-title":"Application of Factor Analysis to k-means Clustering Algorithm on Transportation Data","volume":"95","author":"Sesham","year":"2014","journal-title":"IJCA"},{"key":"ref_30","first-page":"511","article-title":"Modified K-Means Clustering for Travel Time Prediction Based on Historical Traffic Data","volume":"6276","author":"Lee","year":"2010","journal-title":"LNCS"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1016\/j.scient.2011.07.004","article-title":"Traffic condition recognition using the k-means clustering method","volume":"18","author":"Fotouhi","year":"2011","journal-title":"Sci. Iran."},{"key":"ref_32","unstructured":"Farahani, R.Z., and Hekmatfar, M. (2009). Facility Location Concepts, Models, Algorithms and Case Studies, Springer."},{"key":"ref_33","unstructured":"Drezner, Z., and Hamacher, H. (2004). Facility Location: Applications and Theory, Springer."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/mnsc.31.1.84","article-title":"The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach","volume":"31","author":"Klastorin","year":"1985","journal-title":"Manag. Sci."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s11336-007-9021-4","article-title":"Optimal Partitioning of a Data Set Based on the p-Median Model","volume":"73","author":"Brusco","year":"2008","journal-title":"Psychometrica"},{"key":"ref_36","unstructured":"Dodge, Y. (1987). Clustering by means of Medoids. Statistical Data Analysis Based on the L1\u2013Norm and Related Methods, Birkh\u00e4user Basel."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Schubert, E., and Rousseeuw, P. (2019). Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithms. arXiv.","DOI":"10.1007\/978-3-030-32047-8_16"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","article-title":"A simple and fast algorithm for K-medoids clustering","volume":"36","author":"Park","year":"2009","journal-title":"Expert Syst. Appl."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Oper. Res."},{"key":"ref_40","first-page":"57","article-title":"The Computational Complexity of the m-Center Problems on the Plane","volume":"64E","author":"Masuyama","year":"1981","journal-title":"Trans. Inst. Electron. Commun. Eng. Japan"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An Algorithmic Approach to Network Location Problems. II: The P medians","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01584989","article-title":"Exact and approximate solutions to the multisource Weber problem","volume":"3","author":"Kuenne","year":"1972","journal-title":"Math. Program."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1111\/j.1538-4632.1978.tb00006.x","article-title":"The Stepwise LocationAllocation Problem: Exact Solutions in Continuous and Discrete Spaces","volume":"10","author":"Ostresh","year":"1978","journal-title":"Geogr. Anal."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/0377-2217(92)90072-H","article-title":"An optimal method for solving the (generalized) multi-Weber problem","volume":"58","author":"Rosing","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in combinatorial optimization: Overview and conceptual comparison","volume":"35","author":"Blum","year":"2001","journal-title":"ACM Comput. Surv."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s11067-008-9084-5","article-title":"New Genetic Algorithms Based Approaches to Continuous p-Median Problem","volume":"11","author":"Neema","year":"2011","journal-title":"Netw. Spat. Econ."},{"key":"ref_47","unstructured":"Hoos, H.H., and Stutzle, T. (2005). Stochastic Local Search Foundations and Applications, Springer."},{"key":"ref_48","unstructured":"Bang-Jensen, J., Chiarandini, M., Goegebeur, Y., and Jorgensen, B. (2007, January 6\u20138). Mixed Models for the Analysis of Local Search Components. Proceedings of the Engineering Stochastic Local Search Algorithms International Workshop, Brussels, Belgium."},{"key":"ref_49","unstructured":"Cohen-Addad, V., and Mathieu, C. (2015, January 22\u201325). Effectiveness of local search for geometric optimization. Proceedings of the 31st International Symposium on Computational Geometry, SoCG-2015, Eindhoven, The Netherlands."},{"key":"ref_50","first-page":"11","article-title":"Local search with alternating neighborhoods","volume":"2","author":"Kochetov","year":"2003","journal-title":"Discret. Anal. Oper. Res."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.comgeo.2004.03.003","article-title":"A local search approximation algorithm for k-means clustering","volume":"28","author":"Kanungo","year":"2004","journal-title":"Comput. Geom. Theory Appl."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1287\/opre.13.2.291","article-title":"On Monte Carlo methods in congestion problems. I: Searching for an optimum in discrete situations","volume":"13","author":"Page","year":"1965","journal-title":"Oper. Res."},{"key":"ref_53","unstructured":"Hromkovic, J. (2011). Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, Springer."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Ng, T. (2014, January 5\u20138). Expanding Neighborhood Tabu Search for facility location problems in water infrastructure planning. Proceedings of the 2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC), San Diego, CA, USA.","DOI":"10.1109\/SMC.2014.6974531"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","article-title":"The p-median problem: A survey of metaheuristic approaches","volume":"179","author":"Mladenovic","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20128","article-title":"Solution methods for the p-median problem: An annotated bibliography","volume":"48","author":"Reese","year":"2006","journal-title":"Networks"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.ejor.2013.06.022","article-title":"A New Local Search for Continuous Location Problems","volume":"232","author":"Brimberg","year":"2014","journal-title":"Eur. J. Oper. Res."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.cor.2014.05.010","article-title":"New heuristic algorithms for solving the planar p-median problem","volume":"62","author":"Drezner","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10898-014-0183-1","article-title":"Solving the planar p-median problem by variable neighborhood and concentric searches","volume":"63","author":"Drezner","year":"2015","journal-title":"J. Glob. Optim."},{"key":"ref_60","unstructured":"Arthur, D., and Vassilvitskii, S. (2007, January 7\u20139). k-Means++: The Advantages of Careful Seeding. Proceedings of the SODA\u201907, SIAM, New Orleans, LA, USA."},{"key":"ref_61","unstructured":"Bradley, P.S., and Fayyad, U.M. (1998, January 24\u201327). Refining Initial Points for K-Means Clustering. Proceedings of the Fifteenth International Conference on Machine Learning (ICML \u201898), Madison, WI, USA."},{"key":"ref_62","first-page":"1317","article-title":"Centroids Initialization for K-Means Clustering using Improved Pillar Algorithm","volume":"3","author":"Bhusare","year":"2014","journal-title":"Int. J. Adv. Res. Comput. Eng. Technol."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"374","DOI":"10.21629\/JSEE.2017.02.18","article-title":"Tag clustering algorithm lmmsk: Improved k-means algorithm based on latent semantic analysis","volume":"28","author":"Yang","year":"2017","journal-title":"J. Syst. Electron."},{"key":"ref_64","unstructured":"Mishra, N., Oblinger, D., and Pitt, L. (2001, January 7\u20139). Sublinear time approximate clustering. Proceedings of the 12th SODA, Washington, DC, USA."},{"key":"ref_65","unstructured":"Eisenbrand, F., Grandoni, F., Rothvosz, T., and Schafer, G. (2008, January 20\u201322). Approximating connected facility location problems via random facility sampling and core detouring. Proceedings of the SODA\u20192008, San Francisco, CA, USA."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/s00453-013-9833-9","article-title":"Simple D2-Sampling Based PTAS for k-Means and Other Clustering Problems","volume":"70","author":"Jaiswal","year":"2014","journal-title":"Algorithmica"},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1016\/j.cor.2011.09.016","article-title":"An Aggregation Heuristic for Large Scale p-median Problem","volume":"39","author":"Avella","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"Kaufman, L., and Rousseeuw, P.J. (1990). Finding Groups in Data: An Introduction to Cluster Analysis, Wiley.","DOI":"10.1002\/9780470316801"},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10479-008-0344-z","article-title":"Aggregation error for location models: Survey and analysis","volume":"167","author":"Francis","year":"2009","journal-title":"Ann. Oper. Res."},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Pelleg, D., and Moore, A. (2000). Accelerating Exact k-Means with Geometric Reasoning [Technical Report CMU-CS-00-105], Carnegie Melon University.","DOI":"10.1145\/312129.312248"},{"key":"ref_71","first-page":"93","article-title":"Even Faster Exact k-Means Clustering","volume":"12080","author":"Borgelt","year":"2020","journal-title":"LNCS"},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1016\/j.patcog.2009.02.014","article-title":"A Fast k-Means Clustering Algorithm Using Cluster Center Displacement","volume":"42","author":"Lai","year":"2009","journal-title":"Pattern Recognit."},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable Neighborhood Search","volume":"24","author":"Mladenovic","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"ref_74","doi-asserted-by":"crossref","unstructured":"Bruke, E.K., and Kendall, G. (2005). Variable Neighborhood Search. Search Methodology. Search Metodologies, Springer.","DOI":"10.1007\/0-387-28356-0"},{"key":"ref_75","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Pardalos, P., and Resende, M. (2018). Variable Neighborhood Search. Handbook of Heuristics, Springer.","DOI":"10.1007\/978-3-319-07124-4"},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10288-009-0108-x","article-title":"Attraction Probabilities in Variable Neighborhood Search","volume":"8","author":"Brimberg","year":"2010","journal-title":"4OR-Q. J. Oper. Res"},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","article-title":"Variable Neighborhood Search: Methods and Applications","volume":"6","author":"Hansen","year":"2008","journal-title":"4OR-Q. J. Oper. Res."},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10618-009-0135-4","article-title":"Solving Large p-Median Clustering Problems by Primal Dual Variable Neighborhood Search","volume":"19","author":"Hansen","year":"2009","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_79","first-page":"957","article-title":"VNS-Based Algorithms for the Centroid-Based Clustering Problem","volume":"34","author":"Rozhnov","year":"2019","journal-title":"Facta Univ. Ser. Math. Inform."},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","article-title":"J-Means: A new local search heuristic for minimum sum-of-squares clustering","volume":"34","author":"Hansen","year":"2001","journal-title":"Pattern Recognit."},{"key":"ref_81","unstructured":"Martins, P. (2020, October 24). Goal Clustering: VNS Based Heuristics. Available online: https:\/\/arxiv.org\/abs\/1705.07666v4."},{"key":"ref_82","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.ejor.2013.04.027","article-title":"Variable neighborhood search for minimum sum-of-squares clustering on networks","volume":"230","author":"Carrizosa","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_83","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s00357-018-9259-9","article-title":"A Comparative Study of Divisive and Agglomerative Hierarchical Clustering Algorithms","volume":"35","author":"Roux","year":"2018","journal-title":"J. Classif."},{"key":"ref_84","doi-asserted-by":"crossref","unstructured":"Sharma, A., L\u00f3pez, Y., and Tsunoda, T. (2017). Divisive hierarchical maximum likelihood clustering. BMC Bioinform., 18.","DOI":"10.1186\/s12859-017-1965-5"},{"key":"ref_85","first-page":"6","article-title":"Divisive Hierarchical Clustering with K-means and Agglomerative Hierarchical Clustering","volume":"5","author":"Vivekananda","year":"2017","journal-title":"IJCST"},{"key":"ref_86","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/s11227-014-1174-1","article-title":"A parallel clustering method combined information bottleneck theory and centroid-based clustering","volume":"69","author":"Sun","year":"2014","journal-title":"J. Supercomput."},{"key":"ref_87","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","article-title":"A heuristic program for locating warehouses","volume":"9","author":"Kuehn","year":"1963","journal-title":"Manag. Sci."},{"key":"ref_88","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1026130003508","article-title":"An Efficient Genetic Algorithm for the p-Median Problem","volume":"122","author":"Alp","year":"2003","journal-title":"Ann. Oper. Res."},{"key":"ref_89","unstructured":"Cheng, J., Chen, X., Yang, H., and Leng, M. (2012, January 3\u20135). An enhanced k-means algorithm using agglomerative hierarchical clustering strategy. Proceedings of the International Conference on Automatic Control and Artificial Intelligence (ACAI 2012), Xiamen, China."},{"key":"ref_90","first-page":"229","article-title":"Genetic Algorithm with Fast Greedy Heuristic for Clustering and Location Problems","volume":"3","author":"Kazakovtsev","year":"2014","journal-title":"Informatica"},{"key":"ref_91","unstructured":"Pelleg, D., and Moore, A. (2002, January 8\u201312). X-means: Extending K-means with Efficient Estimation of the Number of Clusters. Proceedings of the International Conference on Machine Learning ICML, Sydney, Australia."},{"key":"ref_92","doi-asserted-by":"crossref","unstructured":"Ahmed, M., Seraj, R., and Islam, S.M.S. (2020). The k-means Algorithm: A Comprehensive Survey and Performance Evaluation. Electronics, 9.","DOI":"10.3390\/electronics9081295"},{"key":"ref_93","doi-asserted-by":"crossref","unstructured":"Frackiewicz, M., Mandrella, A., and Palus, H. (2019). Fast Color Quantization by K-Means Clustering Combined with Image Sampling. Symmetry, 11.","DOI":"10.3390\/sym11080963"},{"key":"ref_94","doi-asserted-by":"crossref","unstructured":"Zhang, G., Li, Y., and Deng, X. (2020). K-Means Clustering-Based Electrical Equipment Identification for Smart Building Application. Information, 11.","DOI":"10.3390\/info11010027"},{"key":"ref_95","unstructured":"Chen, F., Yang, Y., Xu, L., Zhang, T., and Zhang, Y. (2020, October 18). Big-Data Clustering: K-Means or K-Indicators?. Available online: https:\/\/arxiv.org\/pdf\/1906.00938.pdf."},{"key":"ref_96","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1109\/TCYB.2016.2526683","article-title":"Distributed k-means algorithm and fuzzy c -means algorithm for sensor networks based on multiagent consensus theory","volume":"47","author":"Qin","year":"2016","journal-title":"IEEE Trans. Cybern."},{"key":"ref_97","unstructured":"Shindler, M., Wong, A., and Meyerson, A. (2011, January 13\u201316). Fast and accurate k-means for large datasets. Proceedings of the 24th International Conference on Neural Information Processing Systems (NIPS\u201911), Sydney, Australia."},{"key":"ref_98","doi-asserted-by":"crossref","unstructured":"Hedar, A.R., Ibrahim, A.M.M., Abdel-Hakim, A.E., and Sewisy, A.A. (2018). K-Means Cloning: Adaptive Spherical K-Means Clustering. Algorithms, 11.","DOI":"10.3390\/a11100151"},{"key":"ref_99","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1109\/TPWRD.2015.2479941","article-title":"Hierarchical k-means method for clustering large-scale advanced metering infrastructure data","volume":"32","author":"Xu","year":"2015","journal-title":"IEEE Trans. Power Deliv."},{"key":"ref_100","first-page":"639","article-title":"Fast adaptive k-means subspace clustering for high-dimensional data","volume":"7","author":"Wang","year":"2019","journal-title":"IEEE Access"},{"key":"ref_101","doi-asserted-by":"crossref","unstructured":"Zechner, M., and Granitzer, M. (2009, January 20\u201325). Accelerating K-Means on the Graphics Processor via CUDA. Proceedings of the International Conference on Intensive Applications and Services, Valencia, Spain.","DOI":"10.1109\/INTENSIVE.2009.19"},{"key":"ref_102","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/MC.2007.59","article-title":"How GPUs work","volume":"40","author":"Luebke","year":"2007","journal-title":"Computer"},{"key":"ref_103","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1016\/S0031-3203(99)00137-5","article-title":"Genetic Algorithm-Based Clustering Technique","volume":"33","author":"Maulik","year":"2000","journal-title":"Pattern Recognit."},{"key":"ref_104","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/3477.764879","article-title":"Genetic K-Means algorithm","volume":"29","author":"Krishna","year":"1999","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"ref_105","first-page":"1239","article-title":"ACOCA: Ant Colony Optimization Based Clustering Algorithm for Big Data Preprocessing","volume":"4","author":"Singh","year":"2019","journal-title":"Int. J. Math. Eng. Manag. Sci."},{"key":"ref_106","unstructured":"Merwe, D.W., and Engelbrecht, A.P. (2003, January 8\u201312). Data Clustering Using Particle Swarm Optimization. Proceedings of the 2003 Congress on Evolutionary Computation, Canberra, Australia."},{"key":"ref_107","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s11590-015-0974-4","article-title":"J-means and I-means for minimum sum-of-squares clustering on networks","volume":"11","author":"Nikolaev","year":"2017","journal-title":"Optim. Lett."},{"key":"ref_108","doi-asserted-by":"crossref","first-page":"4743","DOI":"10.1007\/s10489-018-1238-7","article-title":"K-means properties on six clustering benchmark datasets","volume":"48","author":"Sieranoja","year":"2018","journal-title":"Appl. Intell."},{"key":"ref_109","unstructured":"(2020, September 15). Clustering Basic Benchmark. Available online: http:\/\/cs.joensuu.fi\/sipu\/datasets\/."},{"key":"ref_110","first-page":"350","article-title":"Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem","volume":"1275","author":"Kazakovtsev","year":"2020","journal-title":"CCIS"},{"key":"ref_111","first-page":"1","article-title":"A variable neighborhood algorithm for solving the continuous location-allocation problem","volume":"10","author":"Brimberg","year":"1996","journal-title":"Stud. Locat. Anal."},{"key":"ref_112","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.endm.2014.11.034","article-title":"An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network","volume":"47","author":"Miskovic","year":"2015","journal-title":"Electron. Notes Discret. Math."},{"key":"ref_113","unstructured":"Crainic, T.G., Gendreau, M., Hansen, P., Hoeb, N., and Mladenovic, N. (2001, January 16\u201321). Parallel variable neighbourhood search for the p-median. Proceedings of the 4th Metaheuristics International conference MIC\u20192001, Porto, Portugal."},{"key":"ref_114","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","article-title":"Variable neighborhood search for the p-median","volume":"5","author":"Hansen","year":"1997","journal-title":"Locat. Sci."},{"key":"ref_115","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/net.20470","article-title":"A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem","volume":"58","author":"Wen","year":"2011","journal-title":"Networks"},{"key":"ref_116","unstructured":"Baldassi, C. (2020, September 18). Recombinator-k-Means: Enhancing k-Means++ by Seeding from Pools of Previous Runs. Available online: https:\/\/arxiv.org\/abs\/1905.00531v1."},{"key":"ref_117","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Panos, P., and Resende, M. (2016). Variable Neighborhood Descent. Handbook of Heuristics, Springer.","DOI":"10.1007\/978-3-319-07153-4"},{"key":"ref_118","unstructured":"Dua, D., and Graff, C. (2020, September 30). UCI Machine Learning Repository 2019. Available online: http:\/\/archive.ics.uci.edu\/ml."},{"key":"ref_119","doi-asserted-by":"crossref","unstructured":"Molla, M.M., Nag, P., Thohura, S., and Khan, A. (2020). A Graphics Process Unit-Based Multiple-Relaxation-Time Lattice Boltzmann Simulation of Non-Newtonian Fluid Flows in a Backward Facing Step. Computation, 8.","DOI":"10.3390\/computation8030083"},{"key":"ref_120","doi-asserted-by":"crossref","first-page":"022052","DOI":"10.1088\/1757-899X\/537\/2\/022052","article-title":"Parallel implementation of the greedy heuristic clustering algorithms","volume":"537","author":"Kazakovtsev","year":"2019","journal-title":"IOP Conf. Ser. Mater. Sci. Eng."},{"key":"ref_121","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., and Livny, M. (1996, January 4\u20136). BIRCH: An Efficient Data Clustering Method for Very Large Databases. Proceedings of the 1996 ACM SIGMOD International Conference on Management of data (SIGMOD\u201996), Montreal, QC, Canada.","DOI":"10.1145\/233269.233324"},{"key":"ref_122","doi-asserted-by":"crossref","unstructured":"Smucker, M.D., Allan, J., and Carterette, B.A. (2007, January 6\u201310). Comparison of Statistical Significance Tests for Information Retrieval. Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management (CIKM \u201807), Lisbon, Portugal.","DOI":"10.1145\/1321440.1321528"},{"key":"ref_123","unstructured":"Park, H.M. (2009). Comparing Group Means: The t-Test and One-way ANOVA Using STATA, SAS, and SPSS, Indiana University."},{"key":"ref_124","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1214\/aoms\/1177730491","article-title":"On a Test of Whether one of Two Random Variables is Stochastically Larger than the other","volume":"18","author":"Mann","year":"1947","journal-title":"Ann. Math. Stat."},{"key":"ref_125","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/09-SS051","article-title":"Wilcoxon-Mann-Whitney or t-Test? On Assumptions for Hypothesis Tests and Multiple Interpretations of Decision Rules","volume":"4","author":"Fay","year":"2010","journal-title":"Stat. Surv."},{"key":"ref_126","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","article-title":"Hyper-heuristics: A survey of the state of the art","volume":"64","author":"Burke","year":"2013","journal-title":"J. Oper. Res. Soc."},{"key":"ref_127","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1515\/jaiscr-2016-0013","article-title":"Self-configuring hybrid evolutionary algorithm for fuzzy imbalanced classification with adaptive instance selection","volume":"6","author":"Stanovov","year":"2016","journal-title":"J. Artif. Intell. Soft Comput. Res."},{"key":"ref_128","first-page":"310","article-title":"Hybrid Self-configuring Evolutionary Algorithm for Automated Design of Fuzzy Classifier","volume":"8794","author":"Semenkina","year":"2014","journal-title":"LNCS"}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/8\/4\/90\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:29:39Z","timestamp":1760178579000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/8\/4\/90"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,5]]},"references-count":128,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,12]]}},"alternative-id":["computation8040090"],"URL":"https:\/\/doi.org\/10.3390\/computation8040090","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2020,11,5]]}}}