Optimization algorithm of dynamic discrete particle swarm
Luo Gui · Jisuanji gongcheng yu sheji · 2009
To solve the optimization problems of discrete events under dynamic environment in the real world,particle swarm optimization(PSO) algorithm is studied,which is used widely to solve the optimization problems in the dynamic environment or discrete operation at present,and a dynamic discrete PSO algorithm is proposed.The dynamic environment is monitored and responsed with a judgement strategy of the environment absolute value and sensitivity in this algorithm,and redefined the formals of discrete PSO algorithm with mutation operator,the proposed algorithm could satisfy the demand of large-scale discrete computing.Finally,this algorithm is evaluated by using the solving of zero state response in discrete-time systems,which results shows that this algorithm has a good convergence in the domain of definition.