RUS  ENG
Full version
JOURNALS // Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie // Archive

Vestnik YuUrGU. Ser. Mat. Model. Progr., 2022 Volume 15, Issue 4, Pages 109–114 (Mi vyuru666)

Short Notes

Parallel delivery operations modelling

D. S. Zavalishchina, K. K. Vakolyukb

a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Yekaterinburg, Russian Federation
b Ural State University of Railway Transport, Yekaterinburg, Russian Federation

Abstract: Some delivery organization scheme is considered. The key point is the principle of routes parallelization using several carriers at the same time and these auxiliary carriers can be based on the main carrier. An example of such a delivery system is a van carrying several autonomous carriers, which in turn can carry out simultaneous so–called parallel deliveries. Delivery routes are determined based on the coordinates of customers, the determination of acceptable starting points for auxiliary carriers, the technical and energy limitations of the main and auxiliary carriers, and the minimization of the amount of time spent on delivery operations. The developed algorithm for solving the problem on routing of delivery using primary and secondary carriers allows to reduce delivery time and resources. The algorithm is implemented in Python using the libraries for processing and visualization of trajectories and other space–time data, packages for extracting, modelling, analyzing and visualizing street networks on the example of the Yekaterinburg city.

Keywords: operations research, routing problem, traveling salesman problem, nearest neighbors algorithm, delivery service.

UDC: 519.8

MSC: 90B06

Received: 10.05.2022

Language: English

DOI: 10.14529/mmp220410



© Steklov Math. Inst. of RAS, 2024