Development of an efficient method for allocating motor vehicles to routes within the capacity constraints of loading (unloading) addresses

Abstract

The article discusses the drawbacks of solving the problem of allocating motor vehicles to routes using integer linear programming and proposes a combinatorial method that allows determining discrete solutions for efficient vehicle-to-route allocation. In identifying discrete solutions for efficient route allocation, a mathematical model and algorithms have been developed based on the requirement to satisfy the capacity constraints of loading (unloading) at the routes for all types of motor vehicles. The proposed combinatorial approach aims to ensure the effective and optimal distribution of motor vehicles, thereby enhancing the efficiency of cargo transportation under real-world conditions. The main objective of the models is to fully meet the demands imposed on routes by considering the volumes of cargo shipments and the diverse characteristics of transport vehicles, while minimizing transportation costs. Additionally, the algorithms provide an effective means to handle the complexities that arise in managing a large number of shipments and transport vehicles.