A modified tabu search algorithm (TS) is designed to enhance the efficiency of TS, the relevant data structures are redesigned;in order to solve the precision of TS, the algorithm flow is adjusted under the premise of retaining the essence of TS, besides, and the modified algorithm uses three neighborhood functions to generate candidate solutions sorted to better the precision and efficiency of VRP. Comparing the efficiency with the classical TS, the computation time of the modified algorithm is obviously shortened. Mean-while, Solomon instance of different scales are tested, the result shows ...
