Optimization of Two-dimensional Path Optimization Algorithm Based on Dijkstra Ant Colony Optimization Algorithm

To address the limitations of the traditional Dijkstra algorithm in two-dimensional path optimization problems, this article uses ant colony algorithm to optimize the Dijkstra algorithm, solving the limitations of the Dijkstra algorithm that requires path optimization in finite node graphs and is difficult to traverse the best path that matches actual situations. Generate initial path through Dijkstra algorithm and allocate pheromones to the initial path through ant colony algorithm for iterative calculation, ultimately converging to the optimal path. Through MATLAB software simulation, the optimized Dijkstra-ant algorithm was compared with the original algorithm, optimized algorithm resulted in a better path.