计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (15): 36-38.

• 研究、探讨 • 上一篇    下一篇

基于有导向变异算子求解多维背包问题

陆建波,闭应洲,龙 珑,元昌安   

  1. 广西师范学院 计算机与信息工程学院,南宁 530001
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-05-21 发布日期:2011-05-21

Solving multi-knapsack problems based on guided mutation

LU Jianbo,BI Yingzhou,LONG Long,YUAN Chang’an   

  1. College of Computer and Information Engineering,Guangxi Teachers Education University,Nanning 530001,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-05-21 Published:2011-05-21

摘要: 多维背包问题(MKP)是经典的NP难的组合优化问题。引入有导向变异算子的进化算法GM-EA(Guided Mutation EA)来求解该问题,通过结合粒子群优化的方法改进郭涛算法,更好地利用种群中的全局信息,取得较好的效果。实验结果表明GM-EA是求解MKP有效的算法。

关键词: 多维背包问题, 有导向的变异, 局部搜索, GAlib

Abstract: Multidimensional Knapsack Problem(MKP) is a kind of classical combinatorial optimization problems.A “Guided” Mutation Evolutionary Algorithm(GM-EA) is introduced to solve this problem,which combines Guotao’s algorithm with the idea from particle swarm optimization,utilizes the global information in population.The experimental results show that GM-EA algorithm is competitive to solve MKP.

Key words: Multidimensional Knapsack Problem(MKP), guided mutation, local search, GAlib