考虑航线交叉的救援直升机起飞时序规划方法

为解决多架救援直升机的起飞时序规划问题，以最小化最后一架救援直升机的起飞时间为优化目标，建立多直升机多起降点的数学规划模型。设计了基于任务优先级的快速启发式算法，提出航线交叉点的处理方案，给出起飞时间求解算法。以云南鲁甸6.8级地震的灾后救援为背景，设计了包含24架直升机和12个起飞点的起飞时序规划案例，对模型和算法进行了仿真验证，并对航线交叉的影响与处理措施进行了深入讨论。实验结果表明该模型和方法能有效解决多架救援直升机的起飞时序规划问题。
Aiming at minimizing the departure time of the last helicopter, a mathematical programming model for multiple helicopters in multiple airports was set up to solve the departure time scheduling problem of multiple helicopters. A heuristic algorithm based on task priority was designed to solve the model, a scheme to deal with the airway intersection was put forward and an algorithm to solve the departure time was also established. Basing on the disaster rescue of the 6.8 magnitude earthquake in Yunnan Ludian, a departure time scheduling case which includes 24 helicopters in 12 airports was designed to validate the model and algorithms. The influence of airway intersection and the treatment measures were deeply discussed. The results demonstrate the efficiency of the model and algorithms in dealing with the scheduling problem of multiple helicopters.