{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:28:03Z","timestamp":1760146083241,"version":"build-2065373602"},"reference-count":41,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T00:00:00Z","timestamp":1727913600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Education and Science of Ukraine","award":["0122U001224","0223U001916","2023\/05\/Y\/ST6\/00263"],"award-info":[{"award-number":["0122U001224","0223U001916","2023\/05\/Y\/ST6\/00263"]}]},{"name":"IMPRESS-U","award":["0122U001224","0223U001916","2023\/05\/Y\/ST6\/00263"],"award-info":[{"award-number":["0122U001224","0223U001916","2023\/05\/Y\/ST6\/00263"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>A large number of real-world problems from various fields of human activity can be reduced to optimal partitioning-allocation problems with the purpose of minimizing the partitioning quality criterion. A typical representative of such problem is an infinite-dimensional transportation problem and more generalized problems\u2014infinite-dimensional problems of production centers placement along with the partitioning of the area of continuously distributed consumers with the purpose of minimizing transportation and production costs. The relevant problems are characterized by some kind of uncertainty level of a not-probabilistic nature. A method is proposed to solve an optimal fuzzy partitioning-allocation problem with the subsets centers placement for sets of n-dimensional Euclidean space. The method is based on the synthesis of the methods of fuzzy theory and optimal partitioning-allocation theory, which is a new science field in infinite-dimensional mathematical programming with Boolean variables. A theorem was proved that determines the form of the optimal solution of the corresponding optimal fuzzy partitioning-allocation problem with the subsets centers placement for sets of n-dimensional Euclidean space. An algorithm for solving fuzzy partitioning-allocation problems is proposed, which is based on the proved theorem and on a variant of Shor\u2019s r-algorithm\u2014a non-differential optimization method. The application of the proposed method is demonstrated on model tasks, where the coefficient of mistrust is integrated to interpret the obtained result\u2014the minimum value of the membership function, which allows each point of the set partition to be assigned to a specific fuzzy subset.<\/jats:p>","DOI":"10.3390\/computation12100199","type":"journal-article","created":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T06:45:52Z","timestamp":1727937952000},"page":"199","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the Problem of Fuzzy Partition-Distribution with Determination of the Location of Subset Centers"],"prefix":"10.3390","volume":"12","author":[{"given":"Anatoly","family":"Bulat","sequence":"first","affiliation":[{"name":"M.S. Polyakov Institute of Geotechnical Mechanics of the National Academy of Science of Ukraine, 49005 Dnipro, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Kiseleva","sequence":"additional","affiliation":[{"name":"Faculty of Applied Mathematics, Oles Honchar Dnipro National University, 49010 Dnipro, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1707-843X","authenticated-orcid":false,"given":"Sergiy","family":"Yakovlev","sequence":"additional","affiliation":[{"name":"Mathematical Modelling and Artificial Intelligence Department, National Aerospace University \u201cKharkiv Aviation Institute\u201d, 61072 Kharkiv, Ukraine"},{"name":"Institute of Mathematics, Lodz University of Technology, 90-924 Lodz, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1878-6120","authenticated-orcid":false,"given":"Olga","family":"Prytomanova","sequence":"additional","affiliation":[{"name":"Institute of Information Technologies in Economy, Vadym Hetman Kyiv National Economic University, 03057 Kyiv, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3064-4169","authenticated-orcid":false,"given":"Danylo","family":"Lebediev","sequence":"additional","affiliation":[{"name":"Faculty of Applied Mathematics, Oles Honchar Dnipro National University, 49010 Dnipro, Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,10,3]]},"reference":[{"key":"ref_1","first-page":"1","article-title":"The Emergence and Formation of the Theory of Optimal Set Partitioning for Sets of the n-Dimensional Euclidean Space. Theory and Application","volume":"50","author":"Kiseleva","year":"2018","journal-title":"J. Autom. Inf. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1287\/opre.20.5.1010","article-title":"A partitioning problem with applications in regional design","volume":"20","author":"Corley","year":"1972","journal-title":"Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1112\/jlms\/s2-6.4.605","article-title":"The optimal arrangement of producers","volume":"6","author":"Bollabas","year":"1973","journal-title":"J. Lond. Math. Soc."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.cor.2009.04.001","article-title":"A Continuous Analysis Framework for the Solution of Location-Allocation Problems with Dense Demand","volume":"37","author":"Murat","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_5","first-page":"227","article-title":"On the Translocation of Masses","volume":"37","author":"Kantorovich","year":"1942","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"ref_6","unstructured":"Thakur, R. (2021). Gaspard Monge: The Father of Descriptive Geometry, Prabhat Prakashan. Available online: https:\/\/books.google.com.ua\/books?id=meBDDwAAQBAJ."},{"key":"ref_7","first-page":"225","article-title":"On a Problem of Monge","volume":"3","author":"Kantorovich","year":"1948","journal-title":"Uspekhi Mat. Nauk"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.anihpb.2005.12.001","article-title":"On the equality between Monge\u2019s infimum and Kantorovich\u2019s minimum in optimal mass transportation","volume":"43","author":"Pratelli","year":"2007","journal-title":"Ann. L\u2019institut Henri Poincare (B) Probab. Stat."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1017\/CBO9781107297296.010","article-title":"On the duality theory for the Monge-Kantorovich transport problem","volume":"Volume 413","author":"Beiglbock","year":"2014","journal-title":"Optimal Transportation"},{"key":"ref_10","unstructured":"Farahani, R.Z., and Hekmatfar, M. (2009). Facility Location: Concepts, Models, Algorithms and Case Studies, Springer."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/0305-0548(94)90083-3","article-title":"The Column Subtraction Algorithm: An Exact Method for Solving Weighted Set Covering, Parking and Set Partitioning Problems","volume":"21","author":"Harche","year":"1994","journal-title":"Comput. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1016\/j.disopt.2008.06.001","article-title":"A dual ascent procedure for the set partitioning problem","volume":"5","author":"Boschetti","year":"2008","journal-title":"Discret. Optim."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Laporte, G., Nickel, S., and da Gama, F.S. (2019). Location Science, Springer. [2nd ed.].","DOI":"10.1007\/978-3-030-32177-2"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","article-title":"Set partitioning: A survey","volume":"18","author":"Balas","year":"1976","journal-title":"SIAM Rev."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/opre.17.5.848","article-title":"The set partioting problem: Set covering with Equality Constaints","volume":"17","author":"Garfinkel","year":"1969","journal-title":"Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1080\/02331938808843392","article-title":"A continuous Set Covering Problemas a Quasidifferentiable Optimization Problem","volume":"19","author":"Jandl","year":"1988","journal-title":"Optimization"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10589-008-9191-8","article-title":"Covering a compact polygonal set by identical circles","volume":"46","author":"Stoyan","year":"2010","journal-title":"Comput. Optim. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Pankratov, A., Romanova, T., Litvinchev, I., and Marmolejo-Saucedo, J.A. (2020). An optimized covering spheroids by spheres. Appl. Sci., 10.","DOI":"10.3390\/app10051846"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Yakovlev, S., Kiseleva, O., Chumachenko, D., and Podzeha, D. (2023). Maximum Service Coverage in Business Site Selection Using Computer Geometry Software. Electronics, 12.","DOI":"10.3390\/electronics12102329"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1007\/s10559-018-0073-5","article-title":"Configuration Space of Geometric Objects","volume":"54","author":"Stoyan","year":"2018","journal-title":"Cybern. Syst. Anal."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/s10559-019-00167-y","article-title":"Formalizing spatial configuration optimization problems with the use of a special function class","volume":"55","author":"Yakovlev","year":"2019","journal-title":"Cybern. Syst. Anal."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2741","DOI":"10.1111\/tgis.12997","article-title":"Solving location-allocation problems with professional optimization software","volume":"26","author":"Wolf","year":"2022","journal-title":"Trans. GIS"},{"key":"ref_23","first-page":"490","article-title":"Duality relationships a partitioning problem. SIAM","volume":"23","author":"Corley","year":"1972","journal-title":"J. Appl. Math."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0041-5553(89)90146-8","article-title":"Solution of the problem of optimal partitioning including allocation of the centers of gravity of the Subsets","volume":"29","author":"Kiseleva","year":"1989","journal-title":"Comput. Math. Math. Phys."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Butenko, S., Pardalos, P.M., and Shylo, V. (2017). Shor\u2019s r-Algorithms: Theory and Practice. Optimization Methods and Applications: In Honor of the 80th Birthday of Ivan V. Sergienko, Springer.","DOI":"10.1007\/978-3-319-68640-0"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","article-title":"An exact algorithm for the vehicle routing problem based on a set partitioning formulation with additional cuts","volume":"115","author":"Baldacci","year":"2008","journal-title":"Math. Program."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0548(00)00072-1","article-title":"A new method for solving capacitated location problem based on a set partitioning approach","volume":"29","author":"Baldacci","year":"2002","journal-title":"Comput. Oper. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10898-015-0347-7","article-title":"Optimal transport and a bilevel location-allocation problem","volume":"67","author":"Mallozzi","year":"2015","journal-title":"J. Glob. Optim."},{"key":"ref_29","unstructured":"Drezner, Z., and Hamacher, H. (2004). Facility Location: Application and Theory, Springer Science & Business Media."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"109","DOI":"10.30970\/ms.53.1.109-112","article-title":"Construction of a generalized Voronoi diagram with optimal placement of generator points based on the theory of optimal set partitioning","volume":"53","author":"Kiseleva","year":"2020","journal-title":"Mat. Stud."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1515\/comp-2020-0142","article-title":"Solving a Two-stage Continuous-discrete Problem of Optimal Partitioning-Allocation with the Subsets Centers Placement","volume":"10","author":"Kiseleva","year":"2020","journal-title":"Open Comput. Sci."},{"key":"ref_32","first-page":"1","article-title":"Algorithm for Solving a Continuous Problem of Optimal Partitioning with Neurolinguistic Identification of Functions in Target Functional","volume":"50","author":"Kiseleva","year":"2018","journal-title":"J. Autom. Inf. Sci."},{"key":"ref_33","first-page":"355","article-title":"Generalized Models of Logistics Problems and Approaches to Their Solution Based on the Synthesis of the Theory of Optimal Partitioning and Neuro-Fuzzy Technologies","volume":"Volume 1107","author":"Zgurovsky","year":"2023","journal-title":"System Analysis and Artificial Intelligence"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Shor, N.Z. (1985). Minimization Methods for Non-Differentiable Functions, Springer.","DOI":"10.1007\/978-3-642-82118-9"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/S0377-2217(02)00731-2","article-title":"Solving fuzzy transportation problems based on extension principle","volume":"153","author":"Liu","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0255(75)90036-5","article-title":"The concept of a linguistic variable and its application to approximate reasoning","volume":"8","author":"Zadeh","year":"1975","journal-title":"Inf. Sci."},{"key":"ref_37","unstructured":"Zimmerman, H.-J. (2001). Fuzzy Sets Theory\u2014And Its Applications, Kluwer Academic Publishers. [4th ed.]."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Blondin, M., Pardalos, P., and S\u00e1ez, J. (2019). Computational Intelligence and Optimization, Springer. Optimization and Its Applications 150.","DOI":"10.1007\/978-3-030-25446-9"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Lai, Y.J., and Hawng, C.L. (1992). Fuzzy Mathematical Programming, Springer. Lecture notes in Economics and Mathematical systems.","DOI":"10.1007\/978-3-642-48753-8"},{"key":"ref_40","first-page":"227","article-title":"A non-classical class of variational problems","volume":"1","author":"Cruz","year":"2010","journal-title":"Int. J. Math. Model. Numer. Optim."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Shor, N.Z. (1998). Non Differentiable Optimization and Polynomial Problems, Kluwer Academic Publishers. Available online: https:\/\/books.google.com.ua\/books?id=fD0WdDu9UK8C&lpg=PP1&hl=uk&pg=PP11#v.","DOI":"10.1007\/978-1-4757-6015-6"}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/12\/10\/199\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:09:56Z","timestamp":1760112596000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/12\/10\/199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,3]]},"references-count":41,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["computation12100199"],"URL":"https:\/\/doi.org\/10.3390\/computation12100199","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2024,10,3]]}}}