Abstract:

An improved tabu search algorithm was utilized to solve vehicle routing problem with time windows and built a general mathematical model corresponding to this problem. In the process of solving, initial solutions were selected from many random structured practical solutions, and 2opt method was adopted to produce neighborhood and structured dynamic structure tabu list so that the size and structure of tabu list could be changed in the searching process, the overall ability in search excellence was improved. Simulation experiments indicate the feasibility, validity and superiority of the algorithm.

Key words: vehicle routing problem； tabu search algorithm； time window