Journal of System Simulation ›› 2024, Vol. 36 ›› Issue (8): 1969-1981.doi: 10.16182/j.issn1004731x.joss.23-0779

• Papers • Previous Articles    

Research on Path Optimization Algorithm in Dynamic Routing Environment

Xie Xin1, Hu Xiaobing2, Zhou Hang3   

  1. 1.College of Electronic Information and Automation, Civil Aviation University of China, Tianjin 300300, China
    2.College of Safety Science & Engineering, Civil Aviation University of China, Tianjin 300300, China
    3.Sino-European Institute of Aviation Engineering, Civil Aviation University of China, Tianjin 300300, China
  • Received:2023-06-28 Revised:2023-08-22 Online:2024-08-15 Published:2024-08-19
  • Contact: Hu Xiaobing

Abstract:

In a real dynamic routing environment, static path optimization (SPO) and traditional dynamic path optimization (DPO) tend to encounter issues such as detours, reversals and high computational complexity due to frequent real-time optimization calculation. To address these problems, a novel restart co-evolutionary path optimization (RCEPO) method based on the ripple-spreading algorithm (RSA) is proposed. This method integrates the path optimization process with the dynamic changes of the routing network environment to enhance the effectiveness of path optimization. Moreover, the path re-optimization calculation is performed only when the dynamic changes in the routing environment exceed the predicted range, thereby reducing computational complexity. Experimental results demonstrate that the actual travel path length and the actual travel time of this method are shortened by 17% and 12%, respectively, compared with the traditional DPO method under the dynamic routing network environment. It can effectively solve the path optimization problem under the real dynamic routing network environment. The feasibility and effectiveness of this approach are validated through experiments conducted with a robot dog.

Key words: path optimization, co-evolutionary, dynamic environment, ripple-spreading algorithm, uncertainty

CLC Number: