A Novel Parallel Ant Colony Optimization Algorithm for Warehouse Path Planning

Abstract

In order to improve the working efficiency of automated guided vehicles (AGVs) and the processing efficiency of fulfilling orders in intelligent warehouses, a novel parallel ant colony optimization algorithm for warehouse path planning is proposed. Through the interaction of pheromones among multiple subcolonies, the coevolution of multiple subcolonies is realized and the operational capability of the algorithm is improved. Then, a multiobjective function with the object of the shortest path and the minimum number of turns of the AGV is established. And the path satisfying this objective function is obtained by the proposed algorithm. In addition, the path is further smoothed by reducing the number of intermediate nodes. The results show that the stability and convergence rate of the algorithm are faster and more stable, compared to other algorithms, in generating paths for different complexity maps. The smoothing treatment of the path significantly reduces the number of turns and the path length in the AGV driving process.