论文部分内容阅读
针对遗传算法容易陷入局部最优和蚁群算法初始信息素匮乏的缺点,提出将遗传和蚁群融合算法应用于中继卫星系统的资源调度问题。通过改进蚁群算法信息素的定义,利用基于时间窗口序号编码思想,给出中继卫星资源调度约束条件与目标函数并建立数学模型。仿真分析了融合算法、标准遗传算法和改进蚁群算法的优化特性,结果表明融合算法是解决中继卫星调度问题的有效方法。
Aiming at the shortcoming of genetic algorithm easily falling into local optimum and the lack of initial pheromone of ant colony algorithm, a genetic algorithm and ant colony algorithm are proposed to solve the resource scheduling problem of relay satellite system. By improving the definition of the ant colony algorithm pheromone and using the coding idea based on the sequence number of the time window, the scheduling constraints and objective functions of the relay satellite resources are given and a mathematical model is established. The optimization characteristics of the fusion algorithm, the standard genetic algorithm and the improved ant colony algorithm are simulated and analyzed. The results show that the fusion algorithm is an effective method to solve the scheduling problem of relay satellites.