摘要
研究了一种面向任务的拼修策略问题,建立了该问题的多维背包问题模型,提出了基于遗传算法的求解方案。然后设计了一种求解效果较好的两阶段遗传算法,进行了包括编码,交叉,变异,最优前沿限定算法,适应度函数,选择策略和退火局部搜索算法在内的全面的分析和设计。最后,给出了一个算例,检验了求解方案的实用性,并且通过计算实验分析了遗传算法的有效性。
A type of mission oriented cannibalization policy problem is studied this paper, the problem is modeled as a multi-dimensional knapsack problem, and a solution method what is based on genetic algorithm （CA） for the problem is presented. A two stages CA with better performance is designed and comprehensive analysis and design what including the optimal-frontier restriction algorithm, encoding, crossover, mutation, evaluation function, selection policy and simulated anneal based local search algorithm is performed. At last, the practicability of the solution method is verified by an example and analyzes the performance of the CA by computational, experiment respectively.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2009年第7期97-104,共8页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(70501031)
关键词
面向任务
拼修策略
多维背包问题
两阶段遗传算法
mission oriented
cannibalization policy
multi-dimensional knapsack problem
two stages genetic algorithm
