Zhang Dingxue

Learn More
An adaptive particle swarm optimization (PSO) was proposed based on a version of PSO without the velocity of the previous iteration. To overcome premature searching for the velocity of a particle at zero, reinitialize the velocity of the particle with a random velocity. Simultaneity, to enhance exploration in the early stage and exploitation during the(More)
To overcome premature searching by standard particle swarm optimization (PSO) algorithm for the large lost in population diversity, the measure of population diversity and its calculation are given, and an adaptive PSO with dynamically changing inertia weight is proposed. Simulation results show that the adaptive PSO not only effectively alleviates the(More)
To overcome premature searching by standard particle swarm optimization (PSO) algorithm, a new modified PSO with information of the closest particle is proposed. In the algorithm, the particle is updated not only by the best previous position and the best position among all the particles in the swarm, but also by the best previous position of the closest(More)
  • 1