Article

Article title MODEL FOR SOLVING ROUTING PROBLEM IN THE INTELLECTUAL GEOINFORMATION SYSTEM
Authors S.L. Beliacov Y.A. Kolomiytsev, I.N. Rozenberg, M.N. Savelyeva
Section SECTION II. MATHEMATICAL MODELS AND METHODS
Month, Year 05, 2011 @en
Index UDC 519.688:[519.17+681.518]
DOI
Abstract Article is devoted the analysis of features of the decision of a problem of routing with use of intellectual mechanisms of geoinformation systems. As base of intellectualization use of estima- tions of information resources by communities of social networks the Internet is considered. The new methodology of construction of a cartographical basis by means of experience accumulation Is offered. The algorithm of search of the shortest way, adapted for application on dynamic columns is resulted. The offered algorithm provides reception of effect for a problem of routeing taking into account changes of time parametres and activity of arcs, providing a solution urgency in each instant.

Download PDF

Keywords GIS; spatial data; intelligent routing; Dijkstra's algorithm; dynamic graph.
References 1. Капралов Е.Г., Кошкарев А.В., Тикунов В.С. и др. Геоинформатика: Учебное пособие для студентов вузов / Под. ред. В.С. Тикунова. – М.: Издательский центр «Академия», 2005. – 480 с.
2. Компания «Интегрированные программы», расчет оптимального маршрута [Электронный ресурс] : картографический сервис. – Режим доступа: http//www.integprog.ru./route/.
3. ГОСТ Р 50828 – 95. Геоинформационное картографирование. Пространственные данные, цифровые и электронные карты. Общие требования [Текст]. – Введен 01.07.1996.
4. Майника Э. Алгоритмы оптимизации на сетях и графах. – М.: Мир, 1981. – 324 с.
5. Minieka E.T., Maximum, Lexicographic and Dynamic Network Flows, Operations Research. – 1973. – № 21. – P. 517-527.

Comments are closed.