Efficient distribution of motor vehicles of different loading capacities on routes
Abstract
In the article, the questions of efficient allocation of motor vehicles of different carrying capacity on routes are considered using theoretical properties of the combinatorics method, which allows to determine discrete solutions of the given problem, develop an application algorithm for transport processes. The distribution of the fleet of vehicles with different carrying capacities along the routes determines the number and type of vehicles allocated for the carriage of goods on each route and the number of trips required for each vehicle on the route. In this case, the vehicles are distributed along the transport routes in such a way as to satisfy the need for the allowable load of the connection address. Communication is achieved by changing the number of vehicles in each direction without changing the volume of cargo delivered or transported to the destination, controlled following its needs and the total number of vehicles used. This is because of the technological nature of the needs of the consignee (or consignor) in the bandwidth of the connection, the satisfaction of this need, the full use of the shipment (or acceptance), and the cost of transportation following the selected criteria.