Find in Library

This paper presents a novel routing planning method based on multi-objective optimization to tackle the routing problem in computing power networks. The proposed method aims to improve the performance and efficiency of routing by considering multiple objectives. In this study, we first model the computing power network and formulate the routing problem as a multi-objective optimization problem. To address this problem, we introduce a non-dominated sorting genetic algorithm incorporating a ratio parameter adjustment strategy based on reinforcement learning. Extensive simulations are conducted to evaluate the performance of the proposed routing algorithm. The results demonstrate significant client latency and cost reductions, highlighting the algorithm’s effectiveness. By providing a comprehensive solution to the routing problem in computing power networks, this work contributes to the field by offering improved performance and efficiency. The proposed method’s ability to optimize multiple objectives sets it apart from existing approaches, making it a valuable contribution to the research community.