期刊文献+

量子差分进化算法在二次背包问题中的应用 被引量:1

Quantum Differential Evolution Algorithm for Quadratic Knapsack Problem
下载PDF
导出
摘要 提出一种求解离散优化的量子差分进化算法,将逻辑运算引入到算法中,采用量子理论中的叠加态特性增强群体的多样性,基于突变论的思想采用突变操作防止群体陷入局部最优,算法具有较好的全局优化能力。通过二次背包问题的实验和与其他算法的比较,说明算法的可行性和有效性。 A quantum differential evolution is proposed for discrete optimization.The population diversity is increased by superposition characteristic. Based on the idea of catastrophe theory, the algorithm uses mutation operation to avoid falling into local optimum. The algorithm has stronger global optimization capability .The results of experiments on quadratic knapsack problem and comparison with other algorithms show that the algorithm is feasible and effective.
作者 陆文林
出处 《微计算机信息》 2010年第27期203-204,共2页 Control & Automation
关键词 量子 差分进化 二次背包问题 quantum differential evolution quadratic knapsack problem
  • 相关文献

参考文献12

  • 1R Storn, K Price. Differential evolution-A simple and efficient heuristic for global optimization over continuous spaees[J].Journal of Global-Optimization, 1997,11 (4):341-359.
  • 2Babu B V,Jehan M M L. Differential evolution for multi-objective optimization[J].Evolutionary Compuation,2003,11(4):8-12.
  • 3孔晓红,须文波.基于差分进化算法多处理机任务调度研究[J].微计算机信息,2006(10S):184-186. 被引量:2
  • 4贺安坤,苗良.差分进化微粒群优化算法—DEPSO[J].微计算机信息,2006(12X):284-286. 被引量:5
  • 5杨启文,蔡亮,薛云灿.差分进化算法综述[J].模式识别与人工智能,2008,21(4):506-513. 被引量:131
  • 6Peter L Hammer, David J Rader Jr.Efficient methods for solving quadratic 0-1 knapsack problems.Rutcor research report,RRR 40- 94[R].New jersey, USA: Rutgers University.Rutgers Genter for Operations Research,1994.
  • 7谢涛,陈火旺,康立山.二次背包问题的一种快速解法[J].计算机学报,2004,27(9):1162-1169. 被引量:4
  • 8Gallo G,hammer P L,Simeone.Quardratic knapsack problems[J]. Mathematics Programming,1980,12:132-149.
  • 9刘明广.差异演化算法及其改进[J].系统工程,2005,23(2):108-111. 被引量:38
  • 10Han K H, Kim J H. Quantum-inspired evolutionary algorithm for a class of combinatorial optimization [J]. IEEE Transactions on Evolutionary Computation, 2002, 6(6): 580-593.

二级参考文献103

共引文献263

同被引文献20

  • 1谢涛,陈火旺,康立山.二次背包问题的一种快速解法[J].计算机学报,2004,27(9):1162-1169. 被引量:4
  • 2华中生,张斌.求解可分离连续凸二次背包问题的直接算法[J].系统工程与电子技术,2005,27(2):331-334. 被引量:7
  • 3GALLO G, HAMMER P L, SIMEONE B. Quadratic knap- sack problems[J]. Combinatorial Optimization, 1980,12(1): 132-149.
  • 4PISINGER D. The quadratic knapsack prohlem-a survey[J]. Discrete Applied Mathematics, 2007,155(5) : 623-648.
  • 5BILLIONNET A, FAYE A, SOUTIF E. A new upper bound for the 0-1 quadratic knapsack problem[J]. European Journal of Operational Research, 1999,112(3) : 664-672.
  • 6PISINGER D, RASMUSSEN A B, SANDVIK R. Solution of large-sized quadratic knapsack problems through aggressive re- duction[J]. Informs Journal on Computing, 2005,12(3) : 1-15.
  • 7WANG H, KOCHENBERGER G, XU Y. A note on optimal solutions to quadratic knapsack problems[J]. International Journal of Mathematical Modelling and Numerical Optimisati- on, 2010,1(4) : 344-351.
  • 8LITOCART L, NAGIH A, PLATEAU G. Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem [J]. Computers Operations Research,2012,39(1):12-18.
  • 9HELMBERG C, RENDL F, WEISMANTEL IL A semidefi- nite programming approach to the quadratic knapsack problem [J]. Journal of Combinatorial Optimization, 2000, 4 ( 2 ) : 197-215.
  • 10JULSTROM B A. Greedy genetic and greedy genetic algo- rithms for the quadratic knapsack problem[C]//Proceedingsof 2005 Congress on Genetic and Evolutionary Computation. New York, N. Y. , USA:ACM,2005:607-614.

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部