Author:
Chen Qinglong,Peng Yong,Zhang Miao,Yin Quanjun
Abstract
Abstract
Particle Swarm Optimization (PSO) is kind of algorithm that can be used to solve optimization problems. In practice, many optimization problems are discrete but PSO algorithm was initially designed to meet the requirements of continuous problems. A lot of researches had made efforts to handle this case and varieties of discrete PSO algorithms were proposed. However, these algorithms just focus on the specific problem, and the performance of it significantly degrades when extending the algorithm to other problems. For now, there is no reasonable unified principle or method for analyzing the application of PSO algorithm in discrete optimization problem, which limits the development of discrete PSO algorithm. To address the challenge, we first give an investigation of PSO algorithm from the perspective of spatial search, then, try to give a novel analysis of the key feature changes when PSO algorithm is applied to discrete optimization, and propose a classification method to summary existing discrete PSO algorithms.
Subject
General Physics and Astronomy
Reference47 articles.
1. A Modified Particle Swarm Optimizer;Shi,1998
2. No free lunch theorems for optimization;Wolpert;IEEE Transactions on Evolutionary Computation,1997
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献