Modeling of territorial community formation as a graph partitioning problem
DOI:
https://doi.org/10.15587/1729-4061.2016.60848Keywords:
graph partitioning, genetic algorithm, NP-complete problem, territorial community, settlementAbstract
The territorial community formation process as a graph partitioning problem is considered. The main goal of territorial community formation is to reduce the budget and save public funds. The formation process of communities where settlements, which make up the community, have an administrative building, healthcare institution, high school, kindergarten is investigated. Additional restrictions are imposed on these indicators for uniform distribution of the region's population and community incomes. The minimum distance from the community center to other settlements is taken as a function of the goal of territorial community formation. The mathematical model of this problem, which is a modified graph partitioning problem is developed. The modification lies in using specific constraints arising from the problem statement. The notion of independence of communities and adjacency of individual councils is introduced to build efficient territorial community formation algorithms. This allowed us to formalize the problem from a mathematical point of view. In turn, this made it possible to develop an algorithm for solving this problem, which is to use genetic algorithms to solve the existing problem. The developed model and algorithm of territorial community formation are tested. According to the expert group on the TC formation, the resulting solution showed satisfactory results.
References
- Zakon Ukrai'ny Pro dobrovil'ne ob’jednannja terytorial'nyh gromad. Available at: http://zakon5.rada.gov.ua/laws/show/157-19
- Yevstignyeev, V. A. (1985). Application of graph theory in programming. Moscow: Nauka, 352.
- Swami, M., Thulasiraman, K. (1984). Graphs, Networks and Algorithms. Moscow: Nauka, 256.
- Lytvyn, V., Shakhovska, N., Pasichnyk, V., Dosyn, D. (2012). Searching the Relevant Precedents in Dataspaces Based on Adaptive Ontology. Computational Problems of Electrical Engineering, 2 (1), 75–81.
- Dosyn, D., Lytvyn, V. (2012). Planning of Intelligent Diagnostics Systems Based Domain Ontology. The VIIIth International Conference Perspective Technologies and Methods in MEMS Design, Polyana, Ukraine, 103.
- Lytvyn, V., Dosyn, D., Medykovskyj, M., Shakhovska, N. (2011). Intelligent agent on the basis of adaptive ontologies construction. Signal Modelling Control. Available at: http://it.p.lodz.pl/
- Montes-y-Gómez, M., Gelbukh, A., López-López, A. (2000). Comparison of Conceptual Graphs. Lecture Notes in Artificial Intelligence, 1793, 548–556. doi: 10.1007/10720076_50
- Lytvyn, V. (2013) Design of intelligent decision support systems using ontological approach. An international quarterly journal on economics in technology, new technologies and modelling processes, 2 (1), 31–38.
- Feldmann, A., Foschini, L. (2012). Balanced Partitions of Trees and Applications. Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 100–111.
- Alzate, C., Suykens, J. A. K. (2010). Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32 (2), 335–347. doi: 10.1109/tpami.2008.292
- Kurve, N., Griffin, J., Kesidis, A. (2011). A graph partitioning game for distributed simulation of networks. Proceedings of the 2011 International Workshop on Modeling, Analysis, and Control of Complex Networks, 9–16.
- Chevalier, C., Pellegrini, F. (2008). PT-Scotch: A tool for efficient parallel graph ordering. Parallel Computing, 34 (6-8), 318–331. doi: 10.1016/j.parco.2007.12.001
- Meyerhenke, H. (2013). Shape Optimizing Load Balancing for MPI-Parallel Adaptive Numerical Simulations. 10th DIMACS Implementation Challenge on Graph Partitioning and Graph Clustering, 67–82.
- Meyerhenke, H., Monien, B., Sauerwald, T. (2009). A new diffusion-based multilevel algorithm for computing graph partitions. Journal of Parallel and Distributed Computing, 69 (9), 750–761. doi: 10.1016/j.jpdc.2009.04.005
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2016 Василь Володимирович Литвин, Дмитро Ілліч Угрин, Андріан Мирославович Фітьо
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.
