求解多目标带时间窗VRP问题的文化狼群算法

o solve the vehicle routing problem with time window for the shortest length of vehicle travel and the minimum number of the using vehicles, this paper proposed a cultural wolf pack algorithm. To improve the quality of the wolf pack, this paper constructed the initial wolf pack according to the customer's nearest neighbor matrix. Considering the features of this problem and the wolf pack algorithm, this paper redefined the intelligent behaviors of artificial wolves. The mutation of leader wolf increased the searching range of the optimal solution. According to the favorable information of the current optimal solution, this paper constructed the knowledge of the belief space to guide the evolution direction of the wolf pack and improve the search efficiency. Simulation results show that the cultural wolf pack algorithm can get less number of vehicles, shorter total distance and better stability than other algorithms.