An Improved Discrete Particle Swarm Optimizer for Fast Vector Quantization Codebook Design

2007 ◽  
Author(s):  
Yu-Xuan Wang ◽  
Qiao-Liang Xiang
Keyword(s):  
Vector Quantization ◽  
Particle Swarm ◽  
Particle Swarm Optimizer ◽  
Discrete Particle ◽  
Codebook Design

Hybrid Discrete Particle Swarm Optimizer Algorithm for Traveling Salesman Problem

2012 ◽  
Vol 433-440 ◽  
pp. 4526-4529 ◽  
Author(s):  
Hua Li Wu ◽  
Jin Hua Wu ◽  
Ai Li Liu
Keyword(s):  
Simulated Annealing ◽  
Traveling Salesman Problem ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Traveling Salesman ◽  
Particle Swarm Algorithm ◽  
Local Optimum ◽  
Particle Swarm Optimizer ◽  
Discrete Particle ◽  
Discrete Pso

PSO has been widely used in continuous optimization problems, but in discrete domain the research and application is very little. By redefining the position and speed of particles and related operations, the discrete particle swarm algorithm can be constructed. Due to the weak capacity of local search of PSO and be easy to constringe the local optimum, it is combined with simulated annealing and the hybrid discrete PSO is constructed using the characteristics that simulated annealing can accept some ungraded solution under the control of certain probability,finally the algorithm is applied to solving the traveling salesman problem successfully. The simulation results show that the hybrid discrete PSO can get better optimization effect, which validates the effectiveness of the method.

A fast divisive clustering algorithm using an improved discrete particle swarm optimizer

2010 ◽  
Vol 31 (11) ◽  
pp. 1216-1225 ◽  
Author(s):  
Liang Feng ◽  
Ming-Hui Qiu ◽  
Yu-Xuan Wang ◽  
Qiao-Liang Xiang ◽  
Yin-Fei Yang ◽  
...  
Keyword(s):  
Clustering Algorithm ◽  
Particle Swarm ◽  
Particle Swarm Optimizer ◽  
Discrete Particle ◽  
Divisive Clustering
Sign in / Sign up

Export Citation Format

Share Document