title: Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ° Ð²ÐµÐ±-ÑÐµÑÐ²Ð¸ÑÐ° ÑÐµÐºÐ¾Ð¼ÐµÐ½Ð´Ð°ÑÐ¸Ð¹ Ð¿ÐµÑÐµÑ Ð¾Ð´Ð½ÑÑ ÑÑÑÐ¸ÑÑÐ¸ÑÐµÑÐºÐ¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð²
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: Development of a web service for recommendations of walking tourist routes
Creators: name: ÐÐ²Ð°Ð½Ð¾Ð², Ð Ð¾Ð¼Ð°Ð½
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2023
Subjects: OSM
Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ ÐÐµÐ¹ÐºÑÑÑÑ
Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ ÐÐµÐ»Ð»Ð¼Ð°Ð½Ð°-Ð¤Ð¾ÑÐ´Ð°
Ð·Ð°Ð´Ð°ÑÐ¸ ÐºÐ¾Ð¼Ð±Ð¸Ð½Ð°ÑÐ¾ÑÐ½Ð¾Ð¹ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸
Ð³ÑÐ°Ñ
Ð²ÐµÑÑÐ¸Ð½Ð° Ð³ÑÐ°ÑÐ°
ÑÐµÐ±ÑÐ¾ Ð³ÑÐ°ÑÐ°
Ð²ÐµÐ±-ÑÑÐµÐ¹Ð¼Ð²Ð¾ÑÐº FastAPI
Ð¡Ð£ÐÐ PostgreSQL
Dijkstra algorithm
Bellman-Ford algorithm
combinatorial optimization problems
graph
graph node
graph edge
FastAPI web framework
PostgreSQL

description: Ð¢ÐµÐ¼Ð° Ð²ÑÐ¿ÑÑÐºÐ½Ð¾Ð¹ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÑ: Â«Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ° Ð²ÐµÐ±-ÑÐµÑÐ²Ð¸ÑÐ° ÑÐµÐºÐ¾Ð¼ÐµÐ½Ð´Ð°ÑÐ¸Ð¹ Ð¿ÐµÑÐµÑÐ¾Ð´Ð½ÑÑ ÑÑÑÐ¸ÑÑÐ¸ÑÐµÑÐºÐ¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð²Â». ÐÐ±ÑÐµÐºÑÐ¾Ð¼ ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ¸ ÑÐ²Ð»ÑÐµÑÑÑ Ð²ÐµÐ±-ÑÐµÑÐ²Ð¸Ñ ÑÐµÐºÐ¾Ð¼ÐµÐ½Ð´Ð°ÑÐ¸Ð¸ Ð¿ÐµÑÐµÑÐ¾Ð´Ð½ÑÑ ÑÑÑÐ¸ÑÑÐ¸ÑÐµÑÐºÐ¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð². Ð¦ÐµÐ»Ñ ÑÐ°Ð±Ð¾ÑÑ â ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°ÑÑ Ð¿ÑÐ¾ÑÐ¾ÑÐ¸Ð¿ Ð²ÐµÐ±-ÑÐµÑÐ²Ð¸ÑÐ° ÑÐµÐºÐ¾Ð¼ÐµÐ½Ð´Ð°ÑÐ¸Ð¸ Ð¿ÐµÑÐµÑÐ¾Ð´Ð½ÑÑ ÑÑÑÐ¸ÑÑÐ¸ÑÐµÑÐºÐ¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð². Ð Ð´Ð°Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÐµ Ð±ÑÐ» ÑÐ´ÐµÐ»Ð°Ð½ Ð¾Ð±Ð·Ð¾Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð´Ð»Ñ Ð¿Ð¾ÑÑÑÐ¾ÐµÐ½Ð¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð² Ð½Ð° Ð³ÑÐ°ÑÐ°Ñ, Ð±ÑÐ»Ð¸ Ð¾Ð¿Ð¸ÑÐ°Ð½Ñ Ð¸ ÑÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ ÐÐµÐ¹ÐºÑÑÑÑ Ð¸ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ ÐÐµÐ»Ð»Ð¼Ð°Ð½Ð°-Ð¤Ð¾ÑÐ´Ð° Ð´Ð»Ñ Ð½Ð°ÑÐ¾Ð¶Ð´ÐµÐ½Ð¸Ñ Ð¾Ð¿ÑÐ¸Ð¼Ð°Ð»ÑÐ½Ð¾Ð³Ð¾ Ð¿ÑÑÐ¸, ÑÐ²ÑÐ¸ÑÑÐ¸ÐºÐ¸ Ð´Ð»Ñ Ð·Ð°Ð´Ð°Ñ ÐºÐ¾Ð¼Ð±Ð¸Ð½Ð°ÑÐ¾ÑÐ½Ð¾Ð¹ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸, Ð±ÑÐ»Ð¾ Ð¿ÑÐ¾Ð²ÐµÐ´ÐµÐ½Ð¾ ÑÑÐ°ÑÐ¸ÑÑÐ¸ÑÐµÑÐºÐ¾Ðµ ÑÑÐ°Ð²Ð½ÐµÐ½Ð¸Ðµ ÑÐ²ÑÐ¸ÑÑÐ¸Ðº, ÑÐ°ÐºÐ¶Ðµ Ð±ÑÐ»Ð° ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð° Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð½Ð°Ñ ÑÐµÐ°Ð»Ð¸Ð·Ð°ÑÐ¸Ñ Ð²ÐµÐ±-ÑÐµÑÐ²Ð¸ÑÐ° Ð´Ð»Ñ Ð¿Ð¾ÑÑÑÐ¾ÐµÐ½Ð¸Ñ ÑÑÑÐ¸ÑÑÐ¸ÑÐµÑÐºÐ¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð² Ñ Ð¸ÑÐ¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°Ð½Ð¸ÐµÐ¼ ÑÑÐ¸Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð¸ ÑÐ²ÑÐ¸ÑÑÐ¸Ðº. Ð ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÐµ Ð¿ÑÐ°ÐºÑÐ¸ÑÐµÑÐºÐ¾Ð¹ ÑÐ°Ð±Ð¾ÑÑ Ð±ÑÐ» ÑÐ¾Ð·Ð´Ð°Ð½ Ð²ÐµÐ±-ÑÐµÑÐ²Ð¸ÑÑ ÑÐµÐºÐ¾Ð¼ÐµÐ½Ð´Ð°ÑÐ¸Ð¸ Ð¿ÐµÑÐµÑÐ¾Ð´Ð½ÑÑ ÑÑÑÐ¸ÑÑÐ¸ÑÐµÑÐºÐ¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð².Â 
description: The subject of the graduate qualification work is "Development of a web service for recommendations of walking tourist routes". The object of development is a web service for recommending walking routes. The purpose of the work is to develop a prototype of a web service for recommending walking routes. In this work, an overview of algorithms for constructing routes on graphs was made, the Dijkstra algorithm and the Bellman-Ford algorithm for finding the optimal path, heuristics for combinatorial optimization problems were described and implemented, statistical comparison of heuristics was carried out, a software implementation of a web service for building tourist routes using these algorithms and heuristics was also developed. As a result of practical work, a web service was created to recommend walking routes.