检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《软件》2013年第2期82-83,共2页Software
摘 要:随着航天任务的增多,测控资源越来越有限,传统的调度算法在问题规模变大时容易产生组合爆炸问题。本文通过对遗传算子的改进,设计了能够求解大规模任务规划调度问题的改进算法,仿真结果表明,算法能够在合理的时间内找到已知最优解。With the increase of space missions, TT&C resources are becoming more and more limited. Combinatorial explosion appears especially in larger scale of problems which still solved by traditional scheduling algorithms. By improving the basic element of genetic algorithm, a improved genetic algorithm is designed which is committed to solve the large scale problem. Simulation shows that the improved algorithm is able to find the a best known solution.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.195