检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:董健康 岳雷鸣 Jian-lcang DONG;Lei-ming YUE(College of Electronic Information and Automation,Civil Aviation University of China,Tianjin 300300,China)
机构地区:[1]中国民航大学电子信息与自动化学院,天津300300
出 处:《机床与液压》2018年第18期94-99,共6页Machine Tool & Hydraulics
基 金:National Natural Science Foundation of China(60832011)
摘 要:飞机的勤务过程是一个资源约束的多人协同问题,任务分配是协同的基础。现有的关于勤务维修协同的研究还比较有限。针对以上问题,以单机勤务任务为研究对象,基于MAS构建飞机勤务维修任务分配的动态模型,综合考虑了任务时间窗、任务执行者时间要求、勤务任务执行成本、勤务任务需求能力等多重因素,以最短的时间和最低的成本完成单机勤务任务为双重优化目标,通过遗传算法与最短路算法相结合得到了勤务任务的最优分配方案及执行顺序。实例验证表明所提出的模型和算法对于勤务维修协同任务分配切实可行,对于机务人员的勤务维修管理具有指导性的意义。The aircraft service maintenance process is a multi-person collaborative issue of resource constraint,in which task allocation is the basis of collaboration.Existing studies on service maintenance collaboration are rather limited.Thus,this paper attempts to take tasks of a single aircraft as the study object and construct the dynamic model of aircraft service maintenance tasks based on MAS.By taking multiple factors including the task time window,task executors’time requirements,aircraft task execution cost and aircraft task needs capacities into account,it aims to complete service tasks of a single aircraft within the shortest time and at the lowest cost and take i as the dual optimization goal.By integrating the genetic algorithm and shortest path algorithm,the optimum allocation scheme and execution order of service tasks can be obtained.It is verified by setting example that the proposed model and algorithms are feasible for the collaborative task allocation of service maintenance.It has the guiding significance for the service maintenance management of the maintenance personnel.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.11