title: Ð ÐµÑÐµÐ½Ð¸Ðµ Ð³ÐµÑÐµÑÐ¾Ð³ÐµÐ½Ð½Ð¾Ð¹ ÑÑÐ°Ð½ÑÐ¿Ð¾ÑÑÐ½Ð¾Ð¹ Ð·Ð°Ð´Ð°ÑÐ¸ Ð´Ð²Ð¸Ð¶ÐµÐ½Ð¸Ñ ÑÑÐ°Ð¼Ð²Ð°ÐµÐ² Ñ ÑÑÑÑÐ¾Ð¼ Ð¿Ð°ÑÑÐ°Ð¶Ð¸ÑÐ¾Ð¿Ð¾ÑÐ¾ÐºÐ°
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð±Ð°ÐºÐ°Ð»Ð°Ð²ÑÐ°
titleType: Subtitle
title: Solving a heterogeneous routing problem in a dynamic tram network, taking into account passenger flow
Creators: name: ÐÑÐ»Ð´Ð°ÐºÐ¾Ð²Ð°, ÐÐ°ÑÐ¸Ñ
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2024
Subjects: ÑÑÐ°Ð½ÑÐ¿Ð¾ÑÑÐ½Ð°Ñ Ð·Ð°Ð´Ð°ÑÐ°
ÑÑÐ°Ð¼Ð²Ð°Ð¹Ð½ÑÐµ ÑÐµÑÐ¸
Ð¿Ð°ÑÑÐ°Ð¶Ð¸ÑÐ¾Ð¿Ð¾ÑÐ¾ÐºÐ¸
Ð¼Ð°ÑÑÑÑÑÐ¸Ð·Ð°ÑÐ¸Ñ Ð¾Ð±ÑÐµÑÑÐ²ÐµÐ½Ð½Ð¾Ð³Ð¾ ÑÑÐ°Ð½ÑÐ¿Ð¾ÑÑÐ°
vrp
tram networks
passenger flows
public transport routing

description: ÐÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð¿Ð¾ÑÐ²ÑÑÐµÐ½Ð° ÑÐµÑÐµÐ½Ð¸Ñ Ð³ÐµÑÐµÑÐ¾Ð³ÐµÐ½Ð½Ð¾Ð¹ ÑÑÐ°Ð½ÑÐ¿Ð¾ÑÑÐ½Ð¾Ð¹ Ð·Ð°Ð´Ð°ÑÐ¸ Ð² Ð´Ð¸Ð½Ð°Ð¼Ð¸ÑÐµÑÐºÐ¾Ð¹ ÑÑÐ°Ð¼Ð²Ð°Ð¹Ð½Ð¾Ð¹ ÑÐµÑÐ¸ Ñ ÑÑÑÑÐ¾Ð¼ Ð¿Ð°ÑÑÐ°Ð¶Ð¸ÑÐ¾Ð¿Ð¾ÑÐ¾ÐºÐ°. ÐÐ±ÑÐµÐºÑÐ¾Ð¼ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ ÑÐ²Ð»ÑÐµÑÑÑ Ð´Ð¸Ð½Ð°Ð¼Ð¸ÑÐµÑÐºÐ°Ñ ÑÑÐ°Ð¼Ð²Ð°Ð¹Ð½Ð°Ñ ÑÐµÑÑ. ÐÑÐµÐ´Ð¼ÐµÑÐ¾Ð¼ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ ÑÐ²Ð»ÑÐµÑÑÑ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¿ÐµÑÐµÐ¾Ð¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð¸Ñ Ð¼Ð½Ð¾Ð¶ÐµÑÑÐ²Ð° Ð¼Ð°ÑÑÑÑÑÐ¾Ð² Ð´Ð²Ð¸Ð¶ÐµÐ½Ð¸Ñ ÑÑÐ°Ð¼Ð²Ð°ÐµÐ² Ñ ÑÑÑÑÐ¾Ð¼ Ð¿Ð°ÑÑÐ°Ð¶Ð¸ÑÐ¾Ð¿Ð¾ÑÐ¾ÐºÐ°. Ð¦ÐµÐ»ÑÑ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ ÑÐ²Ð»ÑÐµÑÑÑ ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐºÐ° Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð¿ÐµÑÐµÐ¾Ð¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð² Ð´Ð²Ð¸Ð¶ÐµÐ½Ð¸Ñ Ð´Ð»Ñ ÑÐ´Ð¾Ð²Ð»ÐµÑÐ²Ð¾ÑÐµÐ½Ð¸Ñ Ð¼Ð°ÐºÑÐ¸Ð¼Ð°Ð»ÑÐ½Ð¾Ð³Ð¾ ÐºÐ¾Ð»Ð¸ÑÐµÑÑÐ²Ð° Ð·Ð°ÑÐ²Ð¾Ðº. ÐÐ»Ñ Ð´Ð¾ÑÑÐ¸Ð¶ÐµÐ½Ð¸Ñ Ð¿Ð¾ÑÑÐ°Ð²Ð»ÐµÐ½Ð½Ð¾Ð¹ ÑÐµÐ»Ð¸ Ð±ÑÐ» Ð¿ÑÐ¾Ð²ÐµÐ´ÑÐ½ Ð°Ð½Ð°Ð»Ð¸Ð· Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð¿Ð¾ÑÑÑÐ¾ÐµÐ½Ð¸Ñ Ð¼Ð°ÑÑÑÑÑÐ¾Ð² Ð² Ð´Ð¸Ð½Ð°Ð¼Ð¸ÑÐµÑÐºÐ¸Ñ ÑÑÐ°Ð½ÑÐ¿Ð¾ÑÑÐ½ÑÑ ÑÐµÑÑÑ. Ð ÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ð¿ÐµÑÐµÐ¾Ð¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð¸Ñ Ð¼Ð½Ð¾Ð¶ÐµÑÑÐ²Ð° Ð¼Ð°ÑÑÑÑÑÐ¾Ð² Ð´Ð²Ð¸Ð¶ÐµÐ½Ð¸Ñ Ñ ÑÑÑÑÐ¾Ð¼ Ð´Ð°Ð½Ð½ÑÑ Ð¾ Ð¿Ð°ÑÑÐ°Ð¶Ð¸ÑÐ¾Ð¿Ð¾ÑÐ¾ÐºÐµ. ÐÐ»Ñ Ð¿ÑÐ¾Ð²ÐµÑÐºÐ¸ ÑÐ°Ð±Ð¾ÑÑ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð±ÑÐ»Ð° ÑÐ¾Ð·Ð´Ð°Ð½Ð° Ð´Ð¸Ð½Ð°Ð¼Ð¸ÑÐµÑÐºÐ°Ñ ÑÑÐ¾ÑÐ°ÑÑÐ¸ÑÐµÑÐºÐ°Ñ ÑÑÐ°Ð¼Ð²Ð°Ð¹Ð½Ð°Ñ ÑÐµÑÑ, Ñ ÑÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½Ð½ÑÐ¼ Ð¼Ð¾Ð´ÑÐ»ÐµÐ¼ Ð¿Ð¾ÑÐ²Ð»ÐµÐ½Ð¸Ñ Ð·Ð°ÑÐ²Ð¾Ðº. ÐÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¾ Ð²ÑÐµÐ¼Ñ ÑÐ°Ð±Ð¾ÑÑ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð¿ÑÐ¸ ÑÐ°Ð·Ð½Ð¾Ð¼ ÑÐ¸ÑÐ»Ðµ Ð°ÐºÑÐ¸Ð²Ð½ÑÑ ÑÑÐ°Ð¼Ð²Ð°ÐµÐ². ÐÑÑÐ²Ð»ÐµÐ½ Ð¿ÑÐ¾ÑÐµÐ½Ñ Ð½ÐµÑÐ´Ð¾Ð²Ð»ÐµÑÐ²Ð¾ÑÑÐ½Ð½ÑÑ Ð·Ð°ÑÐ²Ð¾Ðº Ð¿ÑÐ¸ ÑÐ°Ð·Ð»Ð¸ÑÐ½Ð¾Ð¼ ÑÐ¸ÑÐ»Ðµ ÑÑÐ°Ð¼Ð²Ð°ÐµÐ² Ð´Ð»Ñ ÑÐ¸ÑÑÐµÐ¼Ñ Ñ Ð¸ÑÐ¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°Ð½Ð¸ÐµÐ¼ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ð¸ Ð±ÐµÐ· Ð½ÐµÐ³Ð¾.
description: This final qualification work is dedicated to solving a heterogeneous transport problem in a dynamic tram network, taking into account passenger flow. The object of the research is the dynamic tram network. The subject of the research is the algorithm for reallocating the routes of active trams considering passenger flow. The aim of the research is to redefine the set of tram routes in such a way that they cover the maximum number of requests within a given time, assuming that requests appear randomly as the routes are traversed. To achieve this goal, an analysis of routing algorithms in dynamic transport networks was conducted. An algorithm for reallocating routes considering passenger flow data was implemented. A dynamic stochastic tram network with a module for request generation was created to test the algorithms performance. The algorithms operating time was studied for different numbers of active trams. The percentage of unsatisfied requests was identified for different numbers of active trams for the system with and without the algorithm.