Research output: Contribution to conference › Paper › peer-review
Automating the Construction of an Optimal Refuelling Plan along a Car Route Taking into account the Limit on the Number of Stops. / Есин, Максим Сергеевич; Золотых, Дмитрий Андреевич; Корепанова, Анастасия Андреевна; Сабреков, Артём Азатович.
2024. 389-392 Paper presented at 2024 XXVII International Conference on Soft Computing and Measurements (SCM), Санкт-Петербург, Russian Federation.Research output: Contribution to conference › Paper › peer-review
}
TY - CONF
T1 - Automating the Construction of an Optimal Refuelling Plan along a Car Route Taking into account the Limit on the Number of Stops
AU - Есин, Максим Сергеевич
AU - Золотых, Дмитрий Андреевич
AU - Корепанова, Анастасия Андреевна
AU - Сабреков, Артём Азатович
PY - 2024/5/22
Y1 - 2024/5/22
N2 - The paper discusses the concept of a trip cost estimation service, which allows minimizing fuel expenses by constructing an optimal refueling plan along a fixed route. The service operates based on solving a discrete optimization problem related to finding the globally optimal refueling plan considering the locations of refueling stations and constraints on the total number of stops. To construct the optimal plan, it is proposed to use methods of three-dimensional dynamic programming with state dynamics recalculation. The study includes an asymptotic analysis of the constructed polynomial algorithm, as well as performance measurements of the algorithm, demonstrating a high degree of practical applicability of the results.
AB - The paper discusses the concept of a trip cost estimation service, which allows minimizing fuel expenses by constructing an optimal refueling plan along a fixed route. The service operates based on solving a discrete optimization problem related to finding the globally optimal refueling plan considering the locations of refueling stations and constraints on the total number of stops. To construct the optimal plan, it is proposed to use methods of three-dimensional dynamic programming with state dynamics recalculation. The study includes an asymptotic analysis of the constructed polynomial algorithm, as well as performance measurements of the algorithm, demonstrating a high degree of practical applicability of the results.
KW - artificial intelligence in logistics and industry
KW - asymptotic complexity estimation
KW - discrete optimization
KW - dynamic programming
KW - dynamic state recalculation algorithm
KW - trip cost estimation
UR - https://www.mendeley.com/catalogue/18ae8e4d-2498-3ed0-8bb8-2c4d58fe77e2/
U2 - 10.1109/scm62608.2024.10554122
DO - 10.1109/scm62608.2024.10554122
M3 - Paper
SP - 389
EP - 392
Y2 - 22 May 2024 through 24 May 2024
ER -
ID: 124122139