Study on tabu search algorithm for stochastic vehicle routing problem

On the basis of describing the vehicle routing problem briefly,a new improved tabu search algorithm is presented.In this algorithm,routing problem is divided into several sub-problems according to vehicle-customer assigning structure,and an inner tabu search algorithm is applied for each sub-problem,at last the answer of the whole problem is find among the answers of all sub-problems.Two conclusions are drawn by computation results and theory:the algorithm extends the search scope,improving the optimisation effect;The algorithm is a collateral algorithm that can be run by several computer at the same time to decrease the whole optimisation time.