论文部分内容阅读
针对星载电子系统硬件演化电路的应用需求,提出一种求解可重构资源替换问题的两阶段寻优演化算法.该算法将遗传算法与局部最优的启发式算法相结合,在任务运行时出现故障节点时,利用局部最优算法找到与工作节点距离最近的节点集合作为备选节点,并利用有约束条件的遗传方法,在集合中选择全局路径长度最短的最优节点来替换故障节点,该算法兼顾了局部通信和全局遍历的应用需求,又提高了求解效率.在搭建的测试环境中,对所提出的算法进行了验证,仿真结果表明两阶段寻优演化算法可以高效地寻找到最优替换节点.
Aiming at the application requirements of the hardware evolution circuit of the spaceborne electronic system, a two-stage optimal evolution algorithm for solving the reconfigurable resource replacement problem is proposed. The algorithm combines the genetic algorithm with the local optimal heuristic algorithm. When the task is running When a faulty node occurs, the local optimal algorithm is used to find the node set nearest to the working node as an alternative node. By using the genetic method with constraints, the optimal node with the shortest global path length is selected in the set to replace the faulty node, The algorithm takes into account the application requirements of local communication and global traversal, and improves the efficiency of the solution.In the built test environment, the proposed algorithm is verified, and the simulation results show that the two-stage optimization algorithm can find the most efficient Excellent replacement node.