Abstract: Vehicle dispatching for small package express is a new problem in the field of transportation, which has positive significance for improving the allocation of vehicle resources in passenger transport enterprises. In order to solve this problem, this paper considers the optimal matching of goods and vehicles from a global perspective, and constructs a mathematical model aiming at maximizing 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 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. In the second stage, 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.Key word: Small package express, Vehicle scheduling, Two-stage algorithm, Matching degree Authors ZHANG Jin-hao, YANG Jing-shuai, LIU Qing-kai, ZHANG Hao-yu Authors affiliations: School of Automobile, Chang’an, Xi’an 710064, China Other information about paper: The research was sponsored by Shaanxi Provincial Natural Science Basic Research Project(2019JM-309), Fundamental Research Funds for the Central Universities(300102228205) and National Natural Science Foundation of China(51108040).

CICTP