Modeling of spare parts supply route optimization with hard time windows

Abstract

In view of the spare parts supply route problem with hard time windows in transportation, an optimal model that aims to minimize the total delivery time is put forward. In this paper, the supply route optimization problem with the shortest transportation distance as the decision target is discussed in detail. Taking the shortest total transportation distance of all vehicles as the optimization goal, a mathematical analytical model that considers the hard time window requirements of each customer is established. Based on the improved ant colony algorithm, the algorithm flow of solving the vehicle routing problem with hard time windows is designed to solve the difficulty of the model. In addition, the feasibility of the improved algorithm is verified by a case considering the actual terrain. The results show that the improved algorithm can quickly find the solution of VRPTW and provide an effective delivery plan for decision makers.