基于遗传算法的串行迭代过程最优执行顺序的确定  

Determination of the Optimal Execution Order in Serial Iterative Process Based on Genetic Algorithm

作　　者：田启华[1] 文小勇[1] 杜义贤[1] 梅月媛 

机构地区：[1]三峡大学机械与动力学院,湖北宜昌443002

出　　处：《机械设计与研究》2016年第5期88-91,共4页Machine Design And Research

基　　金：国家自然科学基金资助项目(51475265)

摘　　要：针对任务规模较大与依赖关系较复杂的串行迭代模型中迭代时间求解复杂和最优执行顺序搜索难度大的问题,研究了采用多阶段混合迭代时间计算模型简化串行迭代时间的计算和采用遗传算法优化任务执行顺序的方法。并以智能割草机的设计过程为例,说明该方法的有效性。Aiming at the complexity of solving iteration time and the difficulty of searching for the optimal execution order in the serial iterative model with larger scale tasks and more complex dependent relationship, the method that the calculation of serial iteration time is simplified by utilizing the calculating model of muhi-stage mixed iterative time and task execution sequence is optimized by utilizing genetic algorithm is studied in this paper. An example of the design process of an intelligent lawn mower is used to explain the effectiveness of this method.

关 键 词：串行迭代模型 最优执行顺序 遗传算法 智能割草机 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]