一种更新因子叠加思想在救援调度中的应用

Application of Updating Factor Superimposition Ideology in Rescue Scheduling

为提高大规模自然灾害救援效率,防止次生灾害的巨大威胁,并实现在不断变化的灾区环境中进行最优化运输调度,设计了一种救援调度算法。首先对灾区运输中路径变化、物资堆积、天气影响等特性进行分析,并分析了蚁群算法以及在灾区物资运输的不足,针对存在的问题,设计更新因子根据实时信息叠加算法,弥补单纯依靠信息素量无法进行动态调度的不足,实现信息素实时更新以及更新因子调整的最优化路径调度。最后进行模拟实验,算法可实现静态以及动态信息下最优路径的调度,验证了算法的可行性。

In order to improve the efficiency of large-scale natural disaster relief, to prevent secondary disasters hugethreat, and to achieve in a changing environment optimized scheduling disaster, designed to optimize the dynamic pathscheduling algorithm, and the existing problems, designing dynamic weight to make up for not relying solely on the amountof pheromone dynamically scheduling insufficient to achieve real-time updates and dynamic pheromone weight adjustmentof the optimal path scheduling. Finally, simulation experiments, the algorithm can be realized under static and dynamic optimal path scheduling information to verify the feasibility of the algorithm.