Study on Stochastic Assembly Line Balancing Based on Improved Particle Swarm Optimization Algorithm

2011 ◽  
Vol 130-134 ◽  
pp. 3870-3874
Author(s):  
Hua Bing Zhu ◽  
Feng Yu ◽  
Yun Xi ◽  
Long Wang ◽  
Juan Zhang

Focusing on a particular assembly line balancing problem of which the task time is a stochastic variable, a stochastic model is established, which aimed at maximization of assembly line balancing rate, completed probability and smoothness index. Simultaneously, an improved particle swarm optimization algorithm is proposed to solve this problem and a reasonable chromosome coding method which effectively prevent to generate infeasible solution is designed. For this reason, the algorithm convergence rate could be improved. At last, rear axle assembly line balancing designs of an automotive part company is taken to test validity of algorithm. Availability of the algorithm is verified by this example.

2014 ◽  
Vol 599-601 ◽  
pp. 1453-1456
Author(s):  
Ju Wang ◽  
Yin Liu ◽  
Wei Juan Zhang ◽  
Kun Li

The reconstruction algorithm has a hot research in compressed sensing. Matching pursuit algorithm has a huge computational task, when particle swarm optimization has been put forth to find the best atom, but it due to the easy convergence to local minima, so the paper proposed a algorithm ,which based on improved particle swarm optimization. The algorithm referred above combines K-mean and particle swarm optimization algorithm. The algorithm not only effectively prevents the premature convergence, but also improves the K-mean’s local. These findings indicated that the algorithm overcomes premature convergence of particle swarm optimization, and improves the quality of image reconstruction.


Sign in / Sign up

Export Citation Format

Share Document