The Improved TS Algorithm for Vehicle Routing Problem with Simultaneous Delivery and Pick-Up

This paper solves the problem with simultaneous delivery and pick-up through using the improved TS algorithm on the basis of the traditional TS algorithm. The closest inserting algorithm is adopted to construct the initial solutions in this paper. To improve the initial solution, the paper uses 2-opt to structure neighborhood Reference set, which is divided into superior Ref Set1 and inferior Ref Set2. Two solutions are selected respectively from Ref Set1 and Ref Set2 to constitute a new solution, and then form into dispersal and diverse Candidate-set. In addition, Dynamic Tabu List is set up to make its length and construction change with search process and finally attains the purpose of improving the whole optimization. The findings proves the feasibility, effectiveness and stability of Tabu Search Algorithm.