Notice of RetractionVehicle Routing Problem with Time Windows Based on Improved Ant Colony Algorithm

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

The vehicle routing problem with time windows (VRPTW) is based on a vehicle routing problem (VRP) which increased customer access time windows. More and more of the VRPTW research is attention because many real-life problems can be attributed to VRPTW, Consequently, good vehicle routing can not only increase the profit of logistics but also make logistics management more scientific. In view of the characteristic of logistics, an improved ant colony algorithm is proposed. The new algorithm is proposed to fast solve the initial solution to accelerate the convergence speed, and used pheromones adjust strategies to prevent falling into local optimization in order to improve search results. The path length is improved through path construct strategy and the introduction of the exchange law to reduce the computation, thereby increasing search speed. The algorithm given in this paper can obtain an optimized solution effectively and has proved to be a good scheme to solve VRPTW.