摘要
针对资源受限情况下动态多项目选择计划管理问题,探讨其数学模型,并设计免疫优化算法对其求解。算法设计中,分别引入基因块的随机漂移与确定性漂移两种变异方式,以及个体的亲和选择与激励选择两种选择方案。最后,数值实验验证了模型的合理性以及各算法的有效性。
For the problem of dynamic multi-project selective planning management with resource constraints,in this paper its mathematic model is discussed and an immune optimisation algorithm is designed to solve it.In the designed algorithm,two mutation modes of random and deterministic drift of gene segment were introduced respectively as well as two selection mechanisms of affinity selection and inspiriting selection of the individual.At last,the numerical experiments validates the rationality of the model and the effectiveness of each algorithm.
出处
《计算机应用与软件》
CSCD
2011年第2期62-64,92,共4页
Computer Applications and Software
基金
教育部科学技术研究重点项目(208125)
贵州大学研究生创新基金项目(校理工2009031)
关键词
动态多项目选择计划
资源分配
动态环境
免疫优化
Dynamic multi-project selection planning Resource allocation Dynamic environment Immune optimisation