移动Agent多任务调度算法  

Mobile Agent Multi-task Scheduling Algorithm

作　　者：刘爱珍[1] 王嘉祯[1] 张西红[1] 陈立云[1] 

机构地区：[1]军械工程学院计算机工程系,石家庄050000

出　　处：《计算机工程》2008年第13期204-206,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60672143);河北省科技攻关基金资助项目(052435179D)

摘　　要：提出一种可覆盖全部解空间的移动agent多任务分配与调度混合遗传算法。给出问题模型及染色体表示方法,采用禁忌表加随机算法生成初始种群,设计新的交叉机制保证交叉进化解的合法性。为促进算法的收敛,变异个体使用禁忌及任务均衡启发变异算子。还采用保持解的不降性的最佳个体保留策略。2种任务节点、3种通信代价、3种主机节点共18组图的仿真结果表明该算法进化的最优解较标准遗传算法有37.1%的平均改进量。A hybrid genetic algorithm is proposed to search the optimal solution of mobile agent multi-task matching and scheduling problem. The problem model and chromosome representation are defined. The initial population is generated by the taboo search and random selecting method. And a new crossover mechanism is designed to make the new scheduling evolved by crossover mechanism valid. To accelerate the algorithm convergence, taboo search and tasks load mutation operator is adopted. Also the best chromosome preserving strategy is adopted to keep optimal solution non-decreasing performance. Simulation results of 18 graphs combined by 2 kinds of task nodes, 3 kinds of communication costs and 3 kinds of host nodes show that the algorithm can get 37.1% improvement compared with standard genetic algorithm.

关 键 词：移动AGENT 多任务调度 遗传算法 交叉机制 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]