Modeling of the process of territorial communities formation using swarm intelligence algorithms
DOI:
https://doi.org/10.15587/2312-8372.2017.112198Keywords:
ant colony algorithm, migrating bird algorithm, multicriteria optimization, territorial community, human settlementAbstract
The process of TC formation is considered, using algorithms of swarm intelligence. The main aim of TC formation is reducing the budget and saving the public funds. The approved methodology and the process of formation of capable communities are studied when in the human settlements that form the society is the administrative building, the health care institution, the general education school of the third degree, the kindergarten, the institutions of social protection, housing and communal services, taking into account the financial security and daily migration of residents in the zone of accessibility of the administrative center. The minimum distance from the center of the community to other settlements is taken for the purpose of forming territorial communities. A mathematical model of such problem is developed, using specific limitations that arise from the formulation of the problem itself. To build effective algorithms for formation of territorial communities, the concept of independence of communities, as well as the contiguity of individual councils is introduced. Stochastic algorithms of ant colony and migrating birds have been adapted to solve the established multicriteria optimization problem. The proposed approach is investigated.
References
- On the Voluntary Association of Territorial Communities. Law of Ukraine from February 5, 2015 No. 157-VIII. Available at: http://zakon5.rada.gov.ua/laws/show/157-19
- Approval of the Methodology for the formation of capable territorial. Resolution of the Cabinet of Ministers of Ukraine from April 8, 2015 No. 214. Available at: http://zakon2.rada.gov.ua/laws/show/214-2015-п
- Pandian, P., Jayalakshmi, M. (2013). Determining efficient solutions to multiple objective linear programming problems. Applied Mathematical Sciences, 7, 1275–1282. doi:10.12988/ams.2013.13118
- Galchenko, V. Ya., Yakimov, A. N. (2015). Populiatsionnye metaevristichskie algoritmy optimizatsii roem chastits. Cherkassy: FLP Tretiakov A. N., 160.
- Karpenko, A. P. (2014). Sovremennye algoritmy poiskovoi optimizatsii. Algoritmy, vdohnovlennye prirodoi. Moscow: MSTU n. a N. E. Baumana, 446.
- Del Valle, Y., Venayagamoorthy, G. K., Mohagheghi, S., Hernandez, J.-C., Harley, R. G. (2008). Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems. IEEE Transactions on Evolutionary Computation, 12 (2), 171–195. doi:10.1109/tevc.2007.896686
- Parsopoulos, K. E., Vrahatis, M. N. (2008). Multi-Objective Particles Swarm Optimization Approaches. Multi-Objective Optimization in Computational Intelligence. IGI Global, 20–42. doi:10.4018/978-1-59904-498-9.ch002
- Coello, C. A. C. (2011). An Introduction to Multi-Objective Particle Swarm Optimizers. Soft Computing in Industrial Applications. Springer Berlin Heidelberg, 3–12. doi:10.1007/978-3-642-20505-7_1
- Dorigo, M., Stützle, T. (2003). The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances. Handbook of Metaheuristics. Kluwer Academic Publishers, 250–285. doi:10.1007/0-306-48056-5_9
- Gan, R., Guo, Q., Chang, H., Yi, Y. (2010). Improved ant colony optimization algorithm for the traveling salesman problems. Journal of Systems Engineering and Electronics, 21 (2), 329–333. doi:10.3969/j.issn.1004-4132.2010.02.025
- Adubi, S. A., Misra, S. (2014). A comparative study on the ant colony optimization algorithms. 2014 11th International Conference on Electronics, Computer and Computation (ICECCO). IEEE. doi:10.1109/icecco.2014.6997567
- SinghJadon, R., Dutta, U. (2013). Modified Ant Colony Optimization Algorithm with Uniform Mutation using Self-Adaptive Approach. International Journal of Computer Applications, 74 (13), 5–8. doi:10.5120/12943-9931
- Yang, X.-S. (2012). Efficiency Analysis of Swarm Intelligence and Randomization Techniques. Journal of Computational and Theoretical Nanoscience, 9 (2), 189–198. doi:10.1166/jctn.2012.2012
- Pang, S., Ma, T., Liu, T. (2015). An Improved Ant Colony Optimization with Optimal Search Library for Solving the Traveling Salesman Problem. Journal of Computational and Theoretical Nanoscience, 12 (7), 1440–1444. doi:10.1166/jctn.2015.3910
- Wang, X., Zhao, Y., Wang, D., Zhu, H., Zhang, Q. (2013). Improved multi-objective ant colony optimization algorithm and its application in complex reasoning. Chinese Journal of Mechanical Engineering, 26 (5), 1031–1040. doi:10.3901/cjme.2013.05.1031
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2017 Dmytro Uhryn, Vasyl Lytvyn, Nazarii Nadiein, Oleg Кlichuk
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.