摘要
0/1背包问题是一个典型的NP难题,具有重要的理论研究价值,也具有广泛的应用基础。借鉴北京大学关于烟花算法的新近成果,尝试考虑二者的结合,初步设计并实现了求解0/1背包问题的烟花算法,开展了较为充分的实验,并作了相关分析与探讨。
0/1 knapsack problem is a kind of NP problems,which is of great theoretical significance and widespread usage.This paper tries to adopt fireworks algorithm which is recently developed in Peking University to solve 0/1 knapsack problem.The initial solving algorithm and extensive experiments are introduced.The research carried out in this paper is a brand new way for solving 0/1 knapsack problem.
出处
《武汉工程职业技术学院学报》
2011年第3期64-66,共3页
Journal of Wuhan Engineering Institute
关键词
0/1背包问题
烟花算法
选择
变异
0/1 knapsack problem
fireworks algorithm
selection
mutation
