摘要
将贪婪法和遗传算法相结合,设计了一种价值密度,提出了一种求解多维0 1背包问题的混合遗传算法。经实例证明,该方法能较好地解决多维0 1背包问题并较简单遗传算法有较好的改善。
In this paper we present a hybrid genetic algorithm which is combined with greedylike heuristics for the multidimensional 01 knapsack problem(MDKP) by designing a profitdensityTested by instances the introduced method can solve MDKP better than simple genetic algorithms
出处
《武汉科技大学学报》
CAS
2003年第2期214-217,共4页
Journal of Wuhan University of Science and Technology
关键词
遗传算法
贪婪算法
背包问题
genetic algorithms
greedy-like heuristics
knapsack problem
