Application of Artificial Bee Colony Algorithm in Vehicle Routing Problem with Time Windows

In order to improve the accuracy of the artificial bee colony algorithm (ABC) on vehicle routing problem with time window (VRPTW), This paper makes the following improvements to the ABC. Three kinds of neighborhood search methods are introduced. In the leader bee and follower bee search stage, the single search mode is changed into a three-way search method, which improves the optimization depth of the algorithm. Multiple neighborhood searches of new food sources generated by the scouter bee is conducted and proceeding to the next iteration has enhanced the survival of new food sources and increased the diversity of populations. The global optimal solution is recorded by setting and updating the bulletin board. Simulation experiments show that the improved discrete ABC algorithm has obvious advantages in solving large-scale VRPTW. Therefore, the improved discrete ABC algorithm has great potential and application value in solving VRPTW.