Research on Path Optimization of Automated Warehouse Based on Heuristic Ant Colony Algorithm

AGV (Automatic Guided Vehicle), as an important part of the automated warehouse, plays an important role in the efficient and normal operation of the warehouse. The heuristic ant colony algorithm used in this paper can avoid the local optimal phenomenon that traditional ant colony algorithm easily appears, and shorten the optimal route. At the same time, the heuristic ant colony algorithm is extended from the common two- dimensional planar path optimization to the three-dimensional space of the warehouse, and the distance between two points in the ant colony algorithm is converted into horizontal and vertical polylines, so as to optimize the route for AGV storing goods among multiple rows of three-dimensional shelves. Through the verification of examples, the results show that the heuristic ant colony algorithm can plan the moving path of AGV in the three-dimensional space of multiple rows of shelves, and improve the efficiency and speed of access.