An improved ts algorithm design for vehicle routing problems with time windows

Tabu search algorithm is proposed for the vehicle routing problems with time windows. In the process of solving, Several initial solutions are randomly constructed, Meanwhile, adjacent structure is constructed by using double operation. Under such condition, the length of tabu list is changed by the resulting linear relation, which can improve the whole capability of optimizing. The applicability and efficiency of the proposed algorithm are validated by simulation experiments.