The “distribution” mode for material support is the trend of military logistics evolution, and the scientific scheduling of vehicle is crucial to achieve this target. The mathematical model of the vehicle scheduling problem of military material distribution was formulated, in which the minimization of the armies’ waiting time was used as the objective, and an improved ant colony optimization algorithm was utilized to solve it. In the proposed algorithm, the transition rule in ant colony optimization algorithm was improved, and the local search heuristics were integrated into the algorithm. The VRPTW benchmark instances were solved under different parameter settings, and the experimental results showed that our improved transition rule can significantly enhance the algorithm’s performance.
展开▼
