Study on Algorithm and Model of Military Vehicle Scheduling Problem

For the strong timeliness of military transport, a mathematical model with time window is presented and an improved tabu search algorithm solving the problem is adopted in this paper. In the improved algorithm, initial solutions are selected from many random structured solutions, and 2-opt is adopted to produce neighborhood. At the same time, the paper structures dynamic structure tabu list and improves selection method of initial points of circulations so that the global ability in search excellence is improved. Experiment results show that the improved algorithm can solve the problem efficiently.