Research on vehicle scheduling problem with transportation scope constraints

Abstract

In view of transportation range of different vehicles, a vehicle scheduling model was established with with multiple vehicle types, multiple materials, multiple warehouse points, and multiple demand points. Targeting at the shortest overall transportation time, the influence of vehicle transportation range constraints on the overall transportation time is studied. Established material supply and demand constraints and vehicle transportation range constraints to ensure that the vehicle allocation plan in each genetic entity meets the transportation scope and the material transportation does not exceed the total supply and demand. A case containing 3 types of vehicle types and 4 types of transportation ranges is designed, and a genetic algorithm is used to solve the vehicle scheduling plan. The calculation results show that the optimal scheduling scheme satisfies all the constraints in the model and is an excellent solution. The corresponding scheduling scheme makes full use of scheduling resources. The results also show that the reasonable allocation of vehicles according to different vehicle transportation ranges can obtain a vehicle scheduling plan that is more in line with the scheduling goal and closer to the actual situation.