拓守恒. 一种求解多维背包问题的和声优化搜索算法[J]. 微电子学与计算机, 2012, 29(6): 76-80,86.
引用本文: 拓守恒. 一种求解多维背包问题的和声优化搜索算法[J]. 微电子学与计算机, 2012, 29(6): 76-80,86.
TUO Shou-heng. A Harmony Search Algorithm for Resolving Multi-Dimensional Knapsack Problems[J]. Microelectronics & Computer, 2012, 29(6): 76-80,86.
Citation: TUO Shou-heng. A Harmony Search Algorithm for Resolving Multi-Dimensional Knapsack Problems[J]. Microelectronics & Computer, 2012, 29(6): 76-80,86.

一种求解多维背包问题的和声优化搜索算法

A Harmony Search Algorithm for Resolving Multi-Dimensional Knapsack Problems

  • 摘要: 提出了一种解决多维背包问题的和声优化搜索算法.算法采用n进制编码初始化和声记忆库,采用自适应的和声保留概率、音调调节概率和音调调节步长产生新解.通过修正算子修正不可行解,以保证解满足约束条件,然后利用非劣解集更新算法优化最优前端,使其扩大覆盖率,保证均匀性.通过20次随机实验,结果表明,该算法能够有效的克服早熟收敛。能够保持种群多样性和求解精度,具有解决复杂多维背包问题的能力。

     

    Abstract: A multi-band encoding harmony search algorithm is proposed for MKP in this work.First,harmonic memory is initialized by multi-band encoding.Adaptive harmony memory consideration rate,pitch adjusting rate and band width are used to produce new solution.The infeasible solution is modified by modified algorithm for satisfy the constraint condition.Then,a pareto-optimal-set optimization algorithm is used to enlarge coverage rate and uniformity.Finally,20 independent experiments illustrate that the proposed algorithm has some advantages in convergence velocity,population diversity and solution precision compared with traditionally algorithm.

     

/

返回文章
返回