Optimized vehicle Scheduling Algorithm of Distribution Center

摘要

This thesis goes deep into the vehicle scheduling problem (VSP), which is the key problem for the distribution center. This paper analyzes and optimizes the mathematical model of vehicle scheduling problem. The problem of dynamic vehicle scheduling with time windows is described in great details in the thesis, which also gives an arithmetic solution aiming at the scheduling problem. Finally, based on the research results and under the background of logistics distribution enterprises, the vehicle scheduling algorithm is exposed to experiment.