Improved Tabu Search Algorithm for Solving the Vehicle Routing Problem with Soft Time Windows in B2C Environment

摘要

With the development of E-commerce, the B2C E-commerce develop rapidly. Customers put forward higher requirements for delivery speed and accuracy. This paper studied the vehicle routing problem with soft time windows in B2C environment. It improved the tabu search (TS) algorithm, and used K-means clustering algorithm to determine the initial solution to improve the algorithm’s convergence speed. The algorithm was tested by using the data in literature [7]. The computing results were compared with those results in the literature [7] to verify the effectiveness of the algorithm.