{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T11:21:50Z","timestamp":1780485710535,"version":"3.54.1"},"reference-count":109,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T00:00:00Z","timestamp":1619049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Science and Higher Education of the Russian Federation","award":["FEFE-2020-0013"],"award-info":[{"award-number":["FEFE-2020-0013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The continuous p-median problem (CPMP) is one of the most popular and widely used models in location theory that minimizes the sum of distances from known demand points to the sought points called centers or medians. This NP-hard location problem is also useful for clustering (automatic grouping). In this case, sought points are considered as cluster centers. Unlike similar k-means model, p-median clustering is less sensitive to noisy data and appearance of the outliers (separately located demand points that do not belong to any cluster). Local search algorithms including Variable Neighborhood Search as well as evolutionary algorithms demonstrate rather precise results. Various algorithms based on the use of greedy agglomerative procedures are capable of obtaining very accurate results that are difficult to improve on with other methods. The computational complexity of such procedures limits their use for large problems, although computations on massively parallel systems significantly expand their capabilities. In addition, the efficiency of agglomerative procedures is highly dependent on the setting of their parameters. For the majority of practically important p-median problems, one can choose a very efficient algorithm based on the agglomerative procedures. However, the parameters of such algorithms, which ensure their high efficiency, are difficult to predict. We introduce the concept of the AGGLr neighborhood based on the application of the agglomerative procedure, and investigate the search efficiency in such a neighborhood depending on its parameter r. Using the similarities between local search algorithms and (1 + 1)-evolutionary algorithms, as well as the ability of the latter to adapt their search parameters, we propose a new algorithm based on a greedy agglomerative procedure with the automatically tuned parameter r. Our new algorithm does not require preliminary tuning of the parameter r of the agglomerative procedure, adjusting this parameter online, thus representing a more versatile computational tool. The advantages of the new algorithm are shown experimentally on problems with a data volume of up to 2,000,000 demand points.<\/jats:p>","DOI":"10.3390\/a14050130","type":"journal-article","created":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T13:59:14Z","timestamp":1619099954000},"page":"130","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Self-Configuring (1 + 1)-Evolutionary Algorithm for the Continuous p-Median Problem with Agglomerative Mutation"],"prefix":"10.3390","volume":"14","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, 660037 Krasnoyarsk, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"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, 660037 Krasnoyarsk, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guzel","family":"Shkaberina","sequence":"additional","affiliation":[{"name":"Reshetnev Siberian State, University of Science and Technology, Institute of Informatics and Telecommunications, 660037 Krasnoyarsk, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,4,22]]},"reference":[{"key":"ref_1","unstructured":"Drezner, Z., and Hamacher, H. (2004). Facility Location: Applications and Theory, Springer."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"310","DOI":"10.3103\/S0147688212060020","article-title":"Distances, metrics and data clustering","volume":"39","author":"Khachumov","year":"2012","journal-title":"Sci. Tech. Inf. Proc."},{"key":"ref_3","unstructured":"\u00c7olakoglu, H.B. (2021, March 12). A Generalization of the Minkowski Distance and a New Definition of the Ellipse. Available online: https:\/\/arxiv.org\/abs\/1903.09657v1."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ins.2011.07.048","article-title":"Distance metrics for high dimensional nearest neighborhood recovery: Compression and normalization","volume":"184","author":"France","year":"2012","journal-title":"Inform. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s10479-008-0352-z","article-title":"On the point for which the sum of the distances to n given points is minimum","volume":"167","author":"Weiszfeld","year":"2009","journal-title":"Ann. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BF01584648","article-title":"A note on Fermat\u2019s problem","volume":"4","author":"Kuhn","year":"1973","journal-title":"Math. Program."},{"key":"ref_7","first-page":"335","article-title":"Sur le point sur lequel la somme des distances de n points donnes est minimum","volume":"43","author":"Weiszfeld","year":"1937","journal-title":"Tohoku Math. J."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1515\/crll.1884.97.49","article-title":"Ueber den Punkt kleinster Entfernungssumme von gegebenen Punkten","volume":"97","author":"Sturm","year":"1884","journal-title":"J. Rein. Angew. Math."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-014-0586-7","article-title":"Weiszfeld\u2019s Method: Old and New Results","volume":"164","author":"Beck","year":"2015","journal-title":"J. Optim. Theory Appl."},{"key":"ref_10","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_11","unstructured":"Farahani, R.Z., and Hekmatfar, M. (2009). Facility Location Concepts, Models, Algorithms and Case Studies, Springer."},{"key":"ref_12","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_13","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. Jpn."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems. The p-medians","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0898-1221(81)90082-1","article-title":"The weber problem revisited","volume":"7","author":"Cooper","year":"1981","journal-title":"Comput. Math. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1287\/opre.26.4.597","article-title":"Ostresh. On the convergence of a class of iterative methods for solving the weber location problem","volume":"26","author":"Lawrence","year":"1978","journal-title":"Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/s11750-008-0056-1","article-title":"On the convergence of the Weiszfeld algorithm for continuous single facility location allocation problems","volume":"16","author":"Plastria","year":"2008","journal-title":"TOP"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1423","DOI":"10.1073\/pnas.97.4.1423","article-title":"The multivariate L1-median and associated data depth","volume":"97","author":"Vardi","year":"2000","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Badoiu, M. (2002, January 19\u201321). Approximate clustering via core-sets. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montr\u00e9al, QC, Canada.","DOI":"10.1145\/509907.509947"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1111\/j.1467-9787.1962.tb00902.x","article-title":"An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics","volume":"4","author":"Kuhn","year":"1962","journal-title":"J. Reg. Sci."},{"key":"ref_21","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_22","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_23","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","article-title":"Optimum distribution of switching centers in a communication network and some related graph theoretic problems","volume":"13","author":"Hakimi","year":"1965","journal-title":"Oper. Res."},{"key":"ref_24","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_25","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1111\/j.1538-4632.1978.tb00006.x","article-title":"The stepwise location-allocation problem: Exact solutions in continuous and discrete spaces","volume":"10","author":"Ostresh","year":"1978","journal-title":"Geogr. Anal."},{"key":"ref_26","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_27","first-page":"203","article-title":"A novel approach for solving a constrained location allocation problem","volume":"4","author":"Rabbani","year":"2013","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"ref_28","first-page":"37","article-title":"The p-median and p-center problems on bipartite graphs","volume":"9","author":"Fathali","year":"2014","journal-title":"Iran. J. Math. Sci. Inf."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-005-0700-6","article-title":"Computational study of large-scale p-median problems","volume":"109","author":"Avella","year":"2007","journal-title":"Math. Program."},{"key":"ref_30","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_31","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C. (2008). Metaheuristic hybridization with greedy randomized adaptive search procedures. Inf. TutORials Oper. Res., 295\u2013319.","DOI":"10.1287\/educ.1080.0045"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Gendreau, M., and Potvin, J.-Y. (2010). Scatter search and path relinking: Fundamentals, advances, and applications. Handbook of Metaheuristics, Springer.","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"ref_33","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_34","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_35","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_36","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1111\/itor.12646","article-title":"Less is more approach: Basic variable neighborhood search for the obnoxious p -median problem","volume":"27","author":"Mladenovic","year":"2019","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Bern\u00e1be-Loranca, M., Gonz\u00e1lez-Vel\u00e1zquez, R., Granillo-Martinez, E., Romero-Montoya, M., and Barrera-C\u00e1mara, R. (2021). P-median problem: A real case application. Intelligent Systems Design and Applications. ISDA 2019. Advances in Intelligent Systems and Computing, Springer.","DOI":"10.1007\/978-3-030-49342-4_18"},{"key":"ref_38","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_39","unstructured":"Hromkovic, J. (2011). Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, Springer."},{"key":"ref_40","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_41","first-page":"11","article-title":"Local search with alternating neighborhoods","volume":"10","author":"Kochetov","year":"2003","journal-title":"Discret. Anal. Oper. Res."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighborhood search: Principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"Eur. J. Oper. Res"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Ribeiro, C.C., and Hansen, P. (2002). Development of Variable Neighborhood Search. Essays and Surveys in Metaheuristics, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-1507-4"},{"key":"ref_44","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_45","unstructured":"Kochetov, Y.A. (2010). Local Search Methods for Discrete Location Problems. [Ph.D. Thesis, Sobolev Institute of Mathematics SB RAS]. (In Russian)."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Bruke, E.K., and Kendall, G. (2005). Variable Neighborhood Search. Search Methodology, Springer.","DOI":"10.1007\/0-387-28356-0"},{"key":"ref_47","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_48","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","article-title":"Variable neighborhood decomposition search","volume":"7","author":"Hansen","year":"2001","journal-title":"J. Heuristics"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","article-title":"Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem","volume":"48","author":"Brimberg","year":"2000","journal-title":"Oper. Res."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2298\/YJOR0501053K","article-title":"Large neighborhood local search for the p-median problem","volume":"15","author":"Kochetov","year":"2005","journal-title":"Yugosl. J. Oper. Res."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1015013919497","article-title":"The parallel variable neighborhood search for the p-median problem","volume":"8","author":"Lopez","year":"2002","journal-title":"J. Heuristics"},{"key":"ref_52","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_53","doi-asserted-by":"crossref","unstructured":"Still, S., Bialek, W., and Bottou, L. (2004). Geometric clustering using the information bottleneck method, Advances. Neural Information Processing Systems. 16, MIT Press.","DOI":"10.1162\/0899766042321751"},{"key":"ref_54","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_55","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/0305-0548(95)00063-1","article-title":"Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems","volume":"23","author":"Houck","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"ref_56","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_57","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 Cybernetics. Part B"},{"key":"ref_58","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_59","doi-asserted-by":"crossref","unstructured":"Tuba, E., Strumberger, I., Tuba, I., Bacanin, N., and Tuba, M. (2018, January 17\u201319). Water cycle algorithm for solving continuous p-median problem. Proceedings of the SACI 2018 IEEE 12th International Symposium on Applied Computational Intelligence and Informatics, Timiuoara, Romania.","DOI":"10.1109\/SACI.2018.8441019"},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"012044","DOI":"10.1088\/1742-6596\/1050\/1\/012044","article-title":"Simulated annealing for competitive p\u2013median facility location problem","volume":"1050","author":"Levanova","year":"2018","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2019.08.069","article-title":"An online-learning-based evolutionary many-objective algorithm","volume":"509","author":"Zhao","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s12293-019-00292-3","article-title":"An adaptive island evolutionary algorithm for the berth scheduling problem","volume":"12","author":"Dulebenets","year":"2020","journal-title":"Memetic Comp."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/j.ins.2018.06.063","article-title":"AnD: A many-objective evolutionary algorithm with angle-based selection and shift-based density estimation","volume":"509","author":"Liu","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.cie.2019.05.002","article-title":"Solving the open vehicle routing problem with capacity and distance constraints with a biased random key genetic algorithm","volume":"133","author":"Ruiz","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"6536","DOI":"10.1016\/j.apm.2016.01.059","article-title":"Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles","volume":"40","author":"Bae","year":"2016","journal-title":"Appl. Math. Model."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"134743","DOI":"10.1109\/ACCESS.2020.3010176","article-title":"An optimization model and solution algorithms for the vehicle routing problem with a \u201cfactory-in-a-box\u201d","volume":"8","author":"Pasha","year":"2020","journal-title":"IEEE Access"},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"11775","DOI":"10.1007\/s00500-018-03729-y","article-title":"A proposal for distinguishing between bacterial and viral meningitis using genetic programming and decision trees","volume":"23","author":"Pilla","year":"2019","journal-title":"Soft Comput."},{"key":"ref_68","doi-asserted-by":"crossref","unstructured":"Das, A., Nayak, J., Naik, B., Pati, S., and Pelusi, D. (2020). How Effective is the Salp Swarm Algorithm in Data Classification. Computational Intelligence in Pattern Recognition. Advances in Intelligent Systems and Computing, Springer.","DOI":"10.1007\/978-981-13-9042-5"},{"key":"ref_69","unstructured":"Falkenauer, E. (1998). Genetic Algorithms and Grouping Problems, Wiley."},{"key":"ref_70","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_71","first-page":"229","article-title":"Genetic algorithm with fast greedy heuristic for clustering and location problems","volume":"38","author":"Kazakovtsev","year":"2014","journal-title":"Informatica"},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02027381","article-title":"Discrete space location-allocation solutions from genetic algorithms","volume":"6","author":"Hosage","year":"1986","journal-title":"Ann. Oper. Res."},{"key":"ref_73","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_74","doi-asserted-by":"crossref","unstructured":"Kazakovtsev, L., Rozhnov, I., Popov, A., and Tovbis, E.M. (2020). Self-adjusting variable neighborhood search algorithm for near-optimal k-means clustering. Computation, 8.","DOI":"10.3390\/computation8040090"},{"key":"ref_75","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_76","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, California, CA, USA."},{"key":"ref_77","doi-asserted-by":"crossref","unstructured":"Kazakovtsev, L.A., and Rozhnov, I.P. (2020, January 20\u201321). Comparative study of local search in SWAP and agglomerative neighbourhoods for the continuous p-median problem. Proceedings of the IOP Conference Series: Materials Science and Engineering, Volume 1047, III International Conference MIST: Aerospace 2020: Advanced Technologies in Aerospace, Mechanical and Automation Engineering (Aerospace 2020), Krasnoyarsk, Russia.","DOI":"10.1088\/1757-899X\/1047\/1\/012079"},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","article-title":"On the analysis of the (1+1) evolutionary algorithm","volume":"276","author":"Droste","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"ref_79","unstructured":"De Jong, K., Poli, R., and Rowe, J. (2003). A study on performance of the (1+1)-Evolutionary Algorithm. Foundations of Genetic Algorithms, Morgan Kaufmann."},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.tcs.2008.03.008","article-title":"Comparing evolutionary algorithms to the (1+1)\u2013EA","volume":"403","author":"Eremeev","year":"2008","journal-title":"Theor. Comput. Sci."},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1162\/EVCO_a_00029","article-title":"Analysis of (1+1) evolutionary algorithm and randomized local search with memory","volume":"19","author":"Sung","year":"2011","journal-title":"Evol. Comput."},{"key":"ref_82","doi-asserted-by":"crossref","unstructured":"Doerr, B., Johannsen, D., and Schmidt, M. (2011, January 5\u20139). Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. Proceedings of the 11th Workshop on Foundations of Genetic Algorithms (FOGA\u201911), Schwarzenberg, Austria.","DOI":"10.1145\/1967654.1967665"},{"key":"ref_83","doi-asserted-by":"crossref","unstructured":"Peng, X. (2015). Performance analysis of (1+1)EA on the maximum independent set problem. Lecture Notes in Computer Science, Springer.","DOI":"10.1007\/978-3-319-27051-7_38"},{"key":"ref_84","doi-asserted-by":"crossref","unstructured":"Xia, X., and Zhou, Y. (2015). Approximation performance of the (1+1) evolutionary algorithm for the minimum degree spanning tree problem. Communications in Computer and Information Science, Springer.","DOI":"10.1007\/978-3-662-49014-3_45"},{"key":"ref_85","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.tcs.2020.07.001","article-title":"Running time analysis of the (1+1)-EA for robust linear optimization","volume":"843","author":"Bian","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"ref_86","unstructured":"Bosman, P.A.N. (2017). Fast genetic algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Spriger."},{"key":"ref_87","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_88","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_89","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"Dempster","year":"1977","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_90","unstructured":"O\u2019Callaghan, L., Mishra, N., Meyerson, A., Guha, S., and Motwani, R. (March, January 26). Streaming-data algorithms for high-quality clustering. Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA."},{"key":"ref_91","first-page":"art.2.4","article-title":"Streamkm: A clustering algorithm for data streams","volume":"17","author":"Ackermann","year":"2010","journal-title":"J. Exp. Algorithms"},{"key":"ref_92","doi-asserted-by":"crossref","first-page":"51","DOI":"10.2298\/YJOR171107030K","article-title":"Algorithms with Greedy Heuristic Procedures for Mixture Probability Distribution Separation","volume":"29","author":"Kazakovtsev","year":"2018","journal-title":"Yugosl. J. Oper. Res."},{"key":"ref_93","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_94","unstructured":"(2020, September 25). Clustering Basic Benchmark. Available online: http:\/\/cs.joensuu.fi\/sipu\/datasets\/."},{"key":"ref_95","unstructured":"Dua, D., and Graff, C. (2020, September 30). UCI Machine Learning Repository 2019. Available online: http:\/\/archive.ics.uci.edu\/ml."},{"key":"ref_96","doi-asserted-by":"crossref","first-page":"8839763","DOI":"10.1155\/2020\/8839763","article-title":"K-Means genetic algorithms with greedy genetic operators","volume":"2020","author":"Kazakovtsev","year":"2020","journal-title":"Math. Probl. Eng."},{"key":"ref_97","doi-asserted-by":"crossref","first-page":"55","DOI":"10.31449\/inf.v44i1.2737","article-title":"Application of algorithms with variable greedy heuristics for k-medoids problems","volume":"44","author":"Kazakovtsev","year":"2020","journal-title":"Informatica"},{"key":"ref_98","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_99","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.cie.2012.10.008","article-title":"GPU-based parallel vertex substitution algorithm for the p-median problem","volume":"64","author":"Lim","year":"2013","journal-title":"Comput. Ind. Eng."},{"key":"ref_100","doi-asserted-by":"crossref","first-page":"4221","DOI":"10.1007\/s11227-017-2006-x","article-title":"A GPU-based genetic algorithm for the p-median problem","volume":"73","author":"AlBdaiwi","year":"2017","journal-title":"J. Supercomput."},{"key":"ref_101","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.proeng.2017.06.054","article-title":"Parallel genetic algorithm for capacitated p-median problem","volume":"192","author":"Herda","year":"2017","journal-title":"Procedia Eng."},{"key":"ref_102","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_103","unstructured":"Charikar, M., Guha, S., Tardos, E., and Shmoys, D.B. (1999, January 1\u20134). A constant-factor approximation algorithm for the k-median problem. Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, USA."},{"key":"ref_104","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1145\/375827.375845","article-title":"Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation","volume":"48","author":"Jain","year":"2001","journal-title":"J. ACM"},{"key":"ref_105","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_106","doi-asserted-by":"crossref","unstructured":"Smucker, M.D., Allan, J., and Carterette, B.A. (2007, January 6\u221210). Comparison of Statistical Significance Tests for Information Retrieval. Proceedings of the Sixteenth ACM Conference on Conference on Information and Knowledge Management (CIKM\u201907), Lisbon, Portugal.","DOI":"10.1145\/1321440.1321528"},{"key":"ref_107","unstructured":"Park, H.M. (2009). Comparing Group Means: The t-Test and One-Way ANOVA Using STATA, SAS, and SPSS, Indiana University."},{"key":"ref_108","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_109","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."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/5\/130\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:51:15Z","timestamp":1760161875000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/5\/130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,22]]},"references-count":109,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2021,5]]}},"alternative-id":["a14050130"],"URL":"https:\/\/doi.org\/10.3390\/a14050130","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,22]]}}}