Logo_Service & Tourism: Current Challenges_eng

Spatial Organization of Tourism and Hospitality

Vol. 20 No. 4 (2026)

TOPOLOGICAL OPTIMIZATION OF TOURISM LOGISTICS NETWORKS: A GEODETIC APPROACH

DOI:
https://doi.org/10.22412/2414-9063-2026-20-4-195-206
Submitted
October 16, 2026
Published
October 16, 2026

Abstract

The modernization of service architecture in tourism is determined by the introduction of effective transport logistics mechanisms. In this paper, a methodology for using graph-­theoretical methods to solve optimization problems of such networks is developed. The study is based on the concept of a geodetic set, that is, a set of main nodes of a graph (network) called generator nodes. The minimum possible number of generator nodes in a given graph is called the geodetic graph number. A new logistic interpretation of these concepts proposes that networks with a small geodetic number (compared to the total number of nodes) have the greatest structural efficiency since these networks allow for simplified logistics management as optimizing routes only between generator nodes automatically ensures that all other network nodes are covered by shortest paths between the generator nodes. As a result, resource flow management becomes more efficient not only between generator nodes, but also across the entire network as a whole. This interpretation of the geodesic number and the geodesic set in relation to logistics networks is original and has not been previously published in the scientific literature. The proposed approach relies on a methodological framework, a detailed discussion of which is provided in this paper. This study addresses the problem of finding geodetic sets for several important classes of graphs like regular polyhedral ones and bipyramidal graphs, as well as grid graphs. In this paper, the terms «graph» and «network» are used synonymously. The proposed approach opens up new opportunities for building effective logistics models in the tourism industry. The theoretical results are applied to the practical case of the tourist infrastructure in the city of Temryuk (Krasnodar Krai) and adjacent territories. It is established that the fulfillment of the triangle inequality for any triangular cycle with vertices at three arbitrarily chosen generator nodes is a necessary condition for the set of generator nodes to be a geodetic set.

References

  1. 1. Лавренченко С. А. Евклидова реализация произведения циклов без скрытых симметрий / С. А. Лавренченко, А. Ю. Щиканов // Сибирские электронные математические известия. – 2015. – Т. 12. – С. 777–783. – DOI: 10.17377/semi.2015.12.063.
  2. 2. Лавренченко С. А. Антагонистические лог-пары в социально-­гуманитарных науках / С. А. Лавренченко, Л. В. Горшкова, Ш. С. Лао // Сервис plus. – 2017. – Т. 11. – № 2. – С. 87–101. – DOI: 10.22412/1993-7768-11-2-11.
  3. 3. Серватинский В. В. Взаимодействие органов местного самоуправления и бизнеса в сфере развития туризма и рекреационной деятельности (на примере Красноярского края) // Приоритетные направления социально-­экономического развития Байкальского региона и Востока России в контексте глобальных и региональных вызовов: Материалы Международной научно-­практической конференции (20–22 июня 2013 г.). – Улан-­Удэ: Издательство Бурятского государственного университета, 2013. – С. 219–228.
  4. 4. Abdelkarim H. A. The geodetic number for the unit graphs associated with rings of order p and p^2 // Symmetry. – 2023. – Vol. 15, № 9. – Article 1799.
  5. 5. Abudayah M. Geodetic number of powers of cycles / M. Abudayah, O. Alomari, H. Al Ezeh // Symmetry. – 2018. – Vol. 10, № 11. – Article 592.
  6. 6. Harary F. Convexity in graphs / F. Harary, J. Nieminen // Journal of Differential Geometry. – 1981. – Vol. 16, № 2. – P. 185–190.
  7. 7. Harary F. The geodetic number of a graph / F. Harary, E. Loukakis, C. Tsouros // Mathematical and Computer Modelling. – 1993. – Vol. 17, № 11. – P. 89–95.
  8. 8. Lawrencenko S. Polyhedral suspensions of arbitrary genus // Graphs and Combinatorics. – 2010. – Vol. 26, № 4. – P. 537–548.
  9. 9. Lawrencenko S. Geometric realization of toroidal quadrangulations without hidden symmetries // Geombinatorics. – 2014. – Vol. 24, № 1. – P. 11–20.
  10. 10. Lawrencenko S. Pairs of polyhedra sharing the same 1‑skeleton in 3D and 4D spaces, without a single common face / S. Lawrencenko, A. Lao // Journal of Discrete Mathematical Sciences and Cryptography. – 2022. – Vol. 25, № 1. – P. 253–263.
  11. 1. Lavrenchenko, S. A., & Shchikanov, A. Yu. (2015). Evklidova realizatsiya proizvedeniya tsiklov bez skrytykh simmetriy [Euclidean realization of the product of cycles without hidden symmetries]. Sibirskie elektronnye matematicheskie izvestiya [Siberian Electronic Mathematical Reports], 12, 777–783. DOI: 10.17377/semi.2015.12.063. (In Russ.).
  12. 2. Lavrenchenko, S. A., Gorshkova, L. V., & Lao, Sh. S. (2017). Antagonisticheskie log-pary v sotsial’no-gumanitarnykh naukakh [Antagonistic log-pairs in social sciences and humanities]. Service plus, 11(2), 87–101. DOI: 10.22412/1993-7768-11-2-11. (In Russ.).
  13. 3. Servatinskiy, V. V. (2013). Vzaimodeystvie organov mestnogo samoupravleniya i biznesa v sfere razvitiya turizma i rekreatsionnoy deyatel’nosti (na primere Krasnoyarskogo kraya) [Interaction between local government and business in the field of tourism development and recreational activities (on the example of the Krasnoyarsk Territory)]. Prioritetnye napravleniya sotsial’no-ekonomicheskogo razvitiya Baykal’skogo regiona i Vostoka Rossii v kontekste global’nykh i regional’nykh vyzovov [Priority Directions of Socio-­Economic Development of the Baikal Region and the East of Russia in the Context of Global and Regional Challenges]: Proceedings of the International Scientific and Practical Conference. Ulan-­Ude: Buryat State University Publishing House, 219–228. (In Russ.).
  14. 4. Abdelkarim, H. A. (2023). The geodetic number for the unit graphs associated with rings of order p and p^2. Symmetry, 15(9), 1799.
  15. 5. Abudayah M., Alomari O., Al Ezeh H. (2018). Geodetic number of powers of cycles. Symmetry, 10(11), 592. DOI: 10.3390/sym10110592.
  16. 6. Harary, F., & Nieminen, J. (1981). Convexity in graphs. Journal of Differential Geometry, 16(2), 185–190.
  17. 7. Harary, F., Loukakis, E., & Tsouros, C. (1993). The geodetic number of a graph. Mathematical and Computer Modelling, 17(11), 89–95.
  18. 8. Lawrencenko, S. (2010). Polyhedral suspensions of arbitrary genus. Graphs and Combinatorics, 26(4), 537–548.
  19. 9. Lawrencenko, S. (2014). Geometric realization of toroidal quadrangulations without hidden symmetries. Geombinatorics, 24(1), 11–20.
  20. 10. Lawrencenko, S., & Lao, A. (2022). Pairs of polyhedra sharing the same 1‑skeleton in 3D and 4D spaces, without a single common face. Journal of Discrete Mathematical Sciences and Cryptography, 25(1), 253–263.

Downloads

Download data is not yet available.