量子进化膜算法及其背包问题应用  

Quantum evolutionary algorithm and its application in membrane of knapsack problem

作　　者：郭永[1] 张韧[1] 

机构地区：[1]西南交通大学,四川成都610031

出　　处：《电子元器件应用》2012年第9期53-56,共4页Electronic Component & Device Applications

摘　　要：量子进化膜算法是基于量子进化算法和膜计算所提出的一种分布式优化算法。将量子进化膜算法应用于0-1背包问题,讨论了基本膜个数的变化对背包问题求解的影响,找到最适合的基本膜个数,并分别与三种不同的量子进化算法进行对比实验,通过多组实例数据进行测试,结果表明该算法具有更高的求解性能。Quantum evolutionary membrane algorithm is based on quantum evolutionary algorithm and the film is calculated by the proposed a distributed optimization algorithm. The quantum evolutionary membrane algorithm applied to 0-1 knapsack problem, discusses the basic film number changes on knapsack problem solving, to find the most suitable basic membrane number, and with three different quantum evolutionary algorithm are compared to experiment, through a plurality of groups of data tested, the results show that the algorithm has higher solution properties.

关 键 词：背包问题 量子进化膜算法 膜计算 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]