Small Package Express Vehicle Scheduling Problem Based on Two-Stage Algorithms

Small package express vehicle dispatching is a new problem within the transportation sector, which has positive significance for improving the allocation of vehicle resources in passenger transport enterprises. This paper considers the optimal matching of goods and vehicles from a global perspective, and constructs a mathematical model aiming to maximize the sum of matching degree between small package express transportation and vehicles, according to the demand of small package express service, the remaining capacity of the luggage compartment and time window constraints. Then, a two-stage algorithm is designed. In the first stage, an algorithm based on the matching degree of small express vehicles and goods is proposed to calculate the matching degree between goods and each bus. Next, an algorithm of small-part express allocation is proposed to solve the problem of cargo car selection. The validity of the model and design algorithm is validated by experiments with randomly generated data.