多模式多项目选择计划的动态克隆选择算法  

Dynamic Colonel Algorithm for Multi-mode Multi-project and Multi-job Selection Planning

作　　者：夏林丽[1] 雷宏[1] 苏显方[2] 

机构地区：[1]铜仁学院数学与计算机科学系,贵州铜仁554300 [2]湖南大学工商管理学院,湖南长沙410012

出　　处：《计算机技术与发展》2015年第6期60-63,68,共5页Computer Technology and Development

基　　金：贵州省科技计划项目(黔科合J字LKT[2012]20号;铜市科研(2013)9-3号(科技局政产学研))

摘　　要：针对多模式多项目多任务选择计划问题的特点,随机选取各任务的执行模式,综合考虑资源限制、项目承继约束、任务时序约束、项目合同时间约束等,建立多模式多项目多任务选择计划的数学模型。采用二层编码表示调度的编码,利用半随机的方式生成抗体群,依据克隆选择原理,实施动态克隆、自适应变异等策略,设计动态克隆选择算法求解模型的最佳决策方案。通过数值实验,与启发式算法、免疫克隆选择算法相比,该算法具有更好的性能。For the analysis of the characteristics of multi-project and multi-job selection planning,considering the resource limitation, projects inheritance constrains,timing constrains of tasks,project contract time constrains and so on comprehensively,the multi-mode, multi-project and multi-job selection planning model was proposed. It is used to obtain the optimal scheduling sequences so that resource equilibrium are utilized. According to the colonel selection principle,some strategies are adopted such as dynamic clone,adaptive mutation and so on,an Dynamic Colonel Selection Algorithm （ DCSA） is designed to find the best solution of the model. By numerical experi-ments,compared with the immune colonel selection algorithm and the heuristic algorithm,show that the algorithm has better performance.

关 键 词：承继约束 资源均衡 克隆选择 自适应变异 动态克隆 

分 类 号：TP399[自动化与计算机技术—计算机应用技术] TP301.6[自动化与计算机技术—计算机科学与技术]