title: Ð Ð°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ° Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð½Ð¾Ð³Ð¾ Ð¼Ð¾Ð´ÑÐ»Ñ Ð´Ð»Ñ ÑÐ¾ÑÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð¿Ð»Ð°Ð½Ð° Ð¾Ð±Ñ Ð¾Ð´Ð° Ð²ÑÐ°ÑÐµÐ¹
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: Development of a software module for drawing up a doctorsâ bypass plan
Creators: name: ÐÑÐ¾ÑÑÐµÐ½, Ð Ð¾Ð¼Ð°Ð½
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2022
Subjects: Ð·Ð°Ð´Ð°ÑÐ° ÐÐ¾Ð¼Ð¼Ð¸Ð²Ð¾ÑÐ¶ÑÑÐ°
Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ñ
Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¸Ð¼Ð¸ÑÐ°ÑÐ¸Ð¸ Ð¾ÑÐ¶Ð¸Ð³Ð°
Javascript
traveling Salesman Problem
optimization
simulated annealing

description: Ð¢ÐµÐ¼Ð° ÑÐ°Ð±Ð¾ÑÑ: ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ° Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð½Ð¾Ð³Ð¾ Ð¼Ð¾Ð´ÑÐ»Ñ Ð´Ð»Ñ ÑÐ¾ÑÑÐ°Ð²Ð»ÐµÐ½Ð¸Ñ Ð¿Ð»Ð°Ð½Ð° Ð¾Ð±ÑÐ¾Ð´Ð° Ð²ÑÐ°ÑÐµÐ¹. Ð¦ÐµÐ»Ñ ÑÐ°Ð±Ð¾ÑÑ â ÑÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°ÑÑ Ð¾Ð´Ð¸Ð½ Ð¸Ð· Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð½Ð°ÑÐ¾Ð¶Ð´ÐµÐ½Ð¸Ñ ÐºÑÐ°ÑÑÐ°Ð¹ÑÐµÐ³Ð¾ Ð¿ÑÑÐ¸ Ð¾Ð±ÑÐ¾Ð´Ð° Ð²Ð·Ð²ÐµÑÐµÐ½Ð½Ð¾Ð³Ð¾ Ð³ÑÐ°ÑÐ° Ð´Ð»Ñ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸ Ð¿Ð¾ÑÐ»ÐµÐ´Ð¾Ð²Ð°ÑÐµÐ»ÑÐ½Ð¾ÑÑÐ¸ Ð¿Ð¾ÑÐµÑÐµÐ½Ð¸Ñ Ð²ÑÐ°ÑÐµÐ¹ Ð² Ð¿Ð¾Ð»Ð¸ÐºÐ»Ð¸Ð½Ð¸ÐºÐµ. Ð ÑÐ°Ð±Ð¾ÑÐµ ÑÐ°ÑÑÐ¼Ð¾ÑÑÐµÐ½Ñ ÑÐ°Ð·Ð»Ð¸ÑÐ½ÑÐµ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ñ ÑÐµÑÐµÐ½Ð¸Ñ Ð·Ð°Ð´Ð°ÑÐ¸ ÐÐ¾Ð¼Ð¼Ð¸Ð²Ð¾ÑÐ¶ÑÑÐ° â Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¿Ð¾Ð»Ð½Ð¾Ð³Ð¾ Ð¿ÐµÑÐµÐ±Ð¾ÑÐ°, Ð¶Ð°Ð´Ð½ÑÐ¹ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼, Ð¼ÑÑÐ°Ð²ÑÐ¸Ð½ÑÐ¹ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¸ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¸Ð¼Ð¸ÑÐ°ÑÐ¸Ð¸ Ð¾ÑÐ¶Ð¸Ð³Ð°. ÐÐµÐ¶Ð´Ñ Ð´Ð°Ð½Ð½ÑÐ¼Ð¸ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð°Ð¼Ð¸ Ð¿ÑÐ¾Ð²ÐµÐ´ÐµÐ½Ð¾ ÑÑÐ°Ð²Ð½ÐµÐ½Ð¸Ðµ Ð¿Ð¾ Ð¸Ñ ÑÐºÐ¾ÑÐ¾ÑÑÐ¸, ÑÐ¾ÑÐ½Ð¾ÑÑÐ¸, Ð»ÑÐ³ÐºÐ¾ÑÑÐ¸ ÑÐµÐ°Ð»Ð¸Ð·Ð°ÑÐ¸Ð¸, Ð² ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÐµ ÑÐµÐ³Ð¾ Ð²ÑÐ±ÑÐ°Ð½ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¸Ð¼Ð¸ÑÐ°ÑÐ¸Ð¸ Ð¾ÑÐ¶Ð¸Ð³Ð°. ÐÐ»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¸Ð¼Ð¸ÑÐ°ÑÐ¸Ð¸ Ð¾ÑÐ¶Ð¸Ð³Ð° ÑÐ°ÑÑÐ¼Ð¾ÑÑÐµÐ½ Ð¿Ð¾Ð´ÑÐ¾Ð±Ð½ÐµÐµ â Ð´Ð»Ñ Ð½ÐµÐ³Ð¾ Ð¿Ð¾ÑÑÑÐ¾ÐµÐ½Ð° Ð±Ð»Ð¾Ðº-ÑÑÐµÐ¼Ð°, Ð° ÑÐ°ÐºÐ¶Ðµ Ð¾Ð½ Ð°Ð´Ð°Ð¿ÑÐ¸ÑÐ¾Ð²Ð°Ð½ Ð´Ð»Ñ Ð¸ÑÐ¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°Ð½Ð¸Ñ Ð² Ð¸Ð½ÑÐ¾ÑÐ¼Ð°ÑÐ¸Ð¾Ð½Ð½Ð¾Ð¹ ÑÐ¸ÑÑÐµÐ¼Ðµ âWEB ÐÐ¾Ð»Ð¸ÐºÐ»Ð¸Ð½Ð¸ÐºÐ°â. Ð ÑÐµÐ·ÑÐ»ÑÑÐ°ÑÐµ ÑÐ°Ð±Ð¾ÑÑ ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð½ÑÐ¹ Ð¼Ð¾Ð´ÑÐ»Ñ, Ð²ÑÑÑÐ°Ð¸Ð²Ð°ÐµÐ¼ÑÐ¹ Ð² Ð¸Ð½ÑÐ¾ÑÐ¼Ð°ÑÐ¸Ð¾Ð½Ð½ÑÑ ÑÐ¸ÑÑÐµÐ¼Ñ âWEB ÐÐ¾Ð»Ð¸ÐºÐ»Ð¸Ð½Ð¸ÐºÐ° ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð½ÑÑ ÐºÐ¾Ð¼Ð¿Ð°Ð½Ð¸ÐµÐ¹ ÐÐÐ âÐÐ¡Ðâ.
description: Topic of work: development of a software module for drawing up a doctorsâ bypass plan. The aim of the work is to implement one of the algorithms for finding the shortest path around a weighted graph to optimize the sequence of visits to doctors in the polyclinic. The paper considers various algorithms for solving the Traveling Salesman problem â a brute-force search, a greedy algorithm, an ant algorithm and an annealing simulation algorithm. A comparison was made between these algorithms in terms of their speed, accuracy, and ease of implementation, as a result of which an annealing simulation algorithm was chosen. The algorithm of simulated annealing is considered in more detail - a block diagram is built for it, and it is also adapted for use in the WEB Polyclinic information system. As a result of the work, a software module has been developed that is embedded in the WEB Polyclinic information system developed by ZAO VSD (VSD, CJSC).