【摘要】：軍用飛機的再次出動保障活動時間的長短,對飛機作戰(zhàn)效能的發(fā)揮起到至關重要的作用。針對軍用飛機在多資源約束條件下再次出動保障活動要求達到最快捷的實際軍事需求,以軍用飛機再次出動的部分任務為研究對象,提出了一種基于啟發(fā)式優(yōu)先規(guī)則與遺傳算法相結合的保障任務優(yōu)化新方法。首先,根據(jù)優(yōu)先規(guī)則確定對任務活動次序進行優(yōu)先規(guī)則編碼。根據(jù)合格節(jié)點判據(jù),實現(xiàn)完整的拓撲排序。然后利用遺傳算法對任務需求進行初始化,根據(jù)優(yōu)先規(guī)則得到的編碼進行遺傳算法的復制、交叉、變異。從而得到軍用飛機再次出動準備的最優(yōu)時間。最終通過提取軍用飛機再次出動的七個任務進行了試驗驗證,并且將結果與人工繪制的結果進行對比。結果表明,基于啟發(fā)式的遺傳算法能夠滿足軍用飛機再次出動準備時間在多資源約束條件下,時間最短,具有很高的實用價值。
[Abstract]:The length of the operation time of the military aircraft plays an important role in the operation efficiency of the aircraft. In view of the requirements of military aircraft to redeploy support activities under multi-resource constraints to achieve the fastest actual military needs, this paper takes part of the tasks of military aircraft re-deployed as the object of study. A new guarantee task optimization method based on heuristic priority rule and genetic algorithm is proposed. First of all, priority rule coding is defined according to priority rules for the order of task activities. According to the criteria of qualified nodes, complete topological ranking is realized. Then the genetic algorithm is used to initialize the task requirements, and then the genetic algorithm is duplicated, crossed, and mutated according to the code obtained by the priority rules. Thus we can get the optimal time for the military aircraft to move again. Finally, seven missions of military aircraft are extracted and verified by experiments, and the results are compared with those of manual rendering. The results show that the heuristic-based genetic algorithm can meet the requirements of military aircraft re-launch preparation time under multi-resource constraints, the shortest time, and has a high practical value.
【作者單位】： 沈陽航空航天大學自動化學院;中航工業(yè)上海航空測控技術研究所故障診斷與健康管理技術航空科技重點實驗室;沈陽飛機設計研究所綜合后勤保障部;
【基金】：國家自然科學基金(項目編號:51605309) 國防預研項目(項目編號:A0520110023) 國防基礎科研項目(項目編號:Z052012B002) 遼寧省自然科學基金聯(lián)合封閉基金(項目編號:2014024003) 航空科學基金(項目編號:20153354005)
【分類號】：E926;TP18
，

本文編號：2469813