摘要
针对多机型保障流程调度复杂问题,在考虑不同机型、不同保障任务和不同保障时间基础上,建立一种基于调度模型的多机型保障流程模型,提出了基于遗传算法的保障流程优化算法,算法以FSP为基础,提出了双择优策略优化思路,以机群保障总时间为优化目标,对多机型保障流程进行排序。通过分析能够得到规定保障任务种类、流程和时间条件下任意飞行架次和保障任务数量相组合产生的最短保障时间及流程。
Aiming at the complex dispatcher problem of multi-model aircrafts’ re-dispatch guarantee process,with considering different models,different support tasks and different support time,a multi-model aircrafts’ guarantee process model based on dispatcher model is established,and a guarantee process optimization algorithm based on genetica gorithmis proposed.The algorithm uses flow-shop scheduling model and takes the total support time of jets as the optimization goal,seqencing the multi-model aircrafts support process.Throug-h analysis,the shortest support time and process generated by any combination of aircraftssorties and support tasks under the specified support task type,process and time conditionscan be obtained.
作者
刘君阳
LIU Jun-yang(Airforce Logistics Academy,Xuzhou 221000,China)
出处
《电脑与信息技术》
2022年第3期30-32,36,共4页
Computer and Information Technology
关键词
飞行保障
流程优化
遗传算法
流水车间调度
flight support
process optimization
genetic algorithm
Flow-Shop Schedul-ing
