Computer and Modernization ›› 2020, Vol. 0 ›› Issue (12): 32-37.

Previous Articles     Next Articles

Dynamic Routing of Routing Frequency Based on Ant Colony Algorithm Optimization

  

  1. (1. Tangshan Caofeidian Liancheng Technology Co., Ltd., Tangshan 063200, China;
    2. North China University of Science and Technology, Tangshan 063200, China;
    3. Tangshan Caofeidian Development Investment Group Co., Ltd., Tangshan 063200, China)
  • Online:2021-01-07 Published:2021-01-07

Abstract: In the conventional routing frequency dynamic path selection method, the set obstacle avoidance rules are missing, resulting in the route transmission path is not optimal, and the path selection time is long. Therefore, based on ant colony algorithm, the dynamic path selection method of routing frequency is optimized. The grid simulation transmission environment is adopted to set key information selection rules. According to the rule of route frequency change and input guiding factors, the setting of route movement rules is realized. The overall situation is taken as a whole, ant perception is calculated according to ant colony algorithm, and the global obstacle avoidance rules are set based on the local area obstacle avoidance rules. The initial pheromone and pheromone during ant search are calculated by compensating the pheromone concentration, the optimal solution of the route is obtained. The experimental results show that compared with the conventional path selection method, the proposed path selection method takes into account the overall situation, and the route obtained is superior to the conventional method, and the path selection time is the shortest. It can be seen that the path selection method based on ant colony algorithm has achieved the purpose of this study.

Key words: ant colony algorithm, routing dynamic frequency, optimal path