An ant colony optimization algorithm with adaptive greedy strategy to optimize path problems

Path planning problems have attracted the interest of more and more researchers due to its widespread existence in recent years. For example, express delivery and food delivery, courier often need to get to their destinations as quickly as possible under the constraints of time, economy etc. Therefore, the path planning issue under various constraints becomes more challenging. In order to solve these problems better, a new ant colony optimization algorithm based on adaptive greedy strategy (GSACO) is proposed this paper. In the process of continuous iteration, the control parameters of the algorithm are constantly adjusted and changed, which can expand the diversity of the population. In the process of ant colony search, the preference degree of ant colony is continuously changed by the greedy strategy, then the ant colony continuously explores the places with high pheromone concentration, and finally the convergence speed of the algorithm is accelerated. The experimental results show that GSACO algorithm has better performance than traditional heuristic algorithm and other evolutionary-based methods. The GSACO algorithm proposed in this paper can effectively accelerate the convergence speed, obtain the global optimal solution faster, and better solve the path planning problem under various constraints.