MULTI-ROUTE PLANNING FOR ROUTE VEHICLES TAKING INTO ACCOUNT MULTI-DEPOT OPERATIONS AND DRIVER WORK/REST REGULATIONS

Abstract

A mathematical model for scheduling route transport operations on the city network has been improved. All trips per day are represented by vertices of a directed graph, and possible transitions between trips are represented by arcs, with waiting times and empty legs calculated. The construction of a set of feasible graph chains is interpreted as possible trip options for a single vehicle during a shift. Multiple depots and driver work and rest schedules are taken into account. Multiple depots are implemented through the introduction of first and second zero trips and the requirement that chains be closed at their permanent locations. Restrictions on work and rest schedules are implemented through preliminary chain verification for compliance with regulatory requirements for shift duration, total and continuous work time, and provision of rest and meal breaks. The mathematical model ensures a rational work plan that minimizes the reduced time costs and, consequently, the cost of transportation operations. The practical significance of the results lies in the creation of a theoretical basis for decision-making in daily planning and dispatch control of route vehicles in a complex route network.