Abstract
Most of the problems on graphs are hard problems. Therefore, it is obvious that an exhaustive approach to solving problems will rarely succeed. Approaches considered by other authors are related to evolutionary modeling, genetic algorithms and other stochastic algorithms, and they have some success. However, some shortcomings are seen in these approaches. The authors propose an approach that is heuristic, but not stochastic. The paper presents a generalized mathematical model of the problem that enables considering the problem of placement in n-dimensional space as a problem of searching for permutations of n elements. This eliminates such shortcomings of algorithms for placing graphs, such as the possibility of control over the process of operation of the algorithm and the strong dependence of the search capabilities on the time complexity of the algorithm. The presented heuristic algorithm Hebene was built based on the corresponding mathematical description. Computational experiments were undertaken for all pairwise nonisomorphic connected graphs up to order 9 inclusive. The algorithm found the optimal solution in more than 50% of cases, the algorithm also yielded acceptable solutions in other situations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)
Emelyanov, V.V., Kureichik, V.M., Kureichik, V.V.: Theory and Practice of Evolutionary Modeling. Fizmatlit Publ., Moscow (1982).(in Russian)
Balyuk, V.V.: Genetic algorithms for solving the problem of placing VLSI elements. Izvestiya SFedU. Eng. Sci. (8), 65–71 (2006). https://www.elibrary.ru/item.asp?id=12792652. (in Russian)
Kostina, M.A., Melnikova, E.A.: Artificial intelligence algorithms in the problem of graph visualization. Sci. Vector Togliatti State Univ. (3), 32–35 (2014). https://www.elibrary.ru/item.asp?id=22888640. (in Russian)
Melnikov, B.F., Eyrih, S.N.: On the approach to combining truncated branch-and-bound method and simulated annealing. Proc. Voronezh State Univ. Ser. Syst. Anal. Inf. Technol. (1), 35–38 (2010). https://www.elibrary.ru/item.asp?id=15199645. (in Russian)
Dudnikov, V.A.: Genetic algorithm for solving the optimization problem of locations graph vertices in the line. Heurist. Alg. Distrib. Comput. 2(2), 60–68 (2015). https://www.elibrary.ru/item.asp?id=29383559. (in Russian)
Hromkovich, J.: Deterministic approaches to algorithmics for hard computing problems. Part I: the main definitions. Heurist. Alg. Distrib. Comput. 1(2), 30–42 (2014). https://www.elibrary.ru/item.asp?id=22030663. (in Russian)
Lisyak, M.V.: Hybrid algorithm for multicriteria placement of VLSI elements. Izvestiya SFedU. Eng. Sci. (7), 77–84 (2012). https://www.elibrary.ru/item.asp?id=17864078. (in Russian)
Melnikov, B.F., Sayfullina, E.F.: Applying multiheuristic approach o randomly generating graphs with a given degree sequence. Univ. Proc. Volga Region Phys. Math. Sci. (3), 70–83 (2013). https://www.elibrary.ru/item.asp?id=21315166. (in Russian)
Acknowledgements
The work was carried out within the framework of the RFBR grant project No. 17-46-630560 “Conceptual innovation model of the socio-ecological and economic system of the Samara region”.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Melnikov, B., Dudnikov, V., Pivneva, S. (2021). Heuristic Algorithm and Results of Computational Experiments of Solution of Graph Placement Problem. In: Sukhomlin, V., Zubareva, E. (eds) Modern Information Technology and IT Education. SITITO 2017. Communications in Computer and Information Science, vol 1204. Springer, Cham. https://doi.org/10.1007/978-3-030-78273-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-78273-3_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-78272-6
Online ISBN: 978-3-030-78273-3
eBook Packages: Computer ScienceComputer Science (R0)