量子菌群算法的分析及应用-信号与信息处理专业论文.docxVIP

AbstractQuantum swarm intelligent optimization algorithms such as quantum genetic algorithm、 quantum ant colony optimization 、 quantum particle swarm optimization are new efficientalgorithms by integrating quantum computing into particle swarm optimization. They have the advantages of better parallelism 、faster convergence speed 、better population variety、better global search capability. Simple bacterial foraging optimization algorithm (BFO) is a bionic swarmalgorithm that simulates the mechanism of natural evolution. A new quantum bacterial foraging optimization algorithm(QBFO) based on quantum computing and simple BFO will be proposed in this paper. The algorithm is applied to 0-1 knapsack problem and traveling salesman problem. The main research work of this paper can be summarized as follows:Firstly, the basic principle of BFO and the algorithm process are been analysized. Then chemotaxis、reproduction、elimination and dispersal in detail are researched and the performance of the algorithm is tested by simulating on a series of benchmark functions. The simulation resultsshow that BFO has some advantage and shortage in solving optimal problems.Secondly, the basic conception and principle on quantum computing are analysized. A new QBFO is proposed by integrating quantum computing into simple BFO. The chromosome is used to represent bacterium and the quantum rotation gate is used to update bacterium’s position. After thatit deeply discusses the concept of QBFO、quantum chromosome encoding、algorithm process andspecific methods of operation. Its performance is analyzed deeply by testing on various typical benchmark functions. The results indicate that QBFO has much better effects than original BFO.Thirdly, it analysizes some relevant conception、model、classification and common methods.The algorithm is applied to 0-1 knapsack problem and traveling salesman problem. The experiments successfully demonstrate QBFO by testing on groups of data. It achieves