No abstract

No abstract

Assembly sequence planning (ASP) is the foundation of the assembly planning which plays a key role in the whole product life cycle. Although the ASP problem has been tackled via a variety of optimization techniques, the particle swarm optimization (PSO) algorithm is scarcely used. This paper presents a PSO algorithm to solve ASP problem. Unlike generic versions of particle swarm optimization, the algorithm redefines the particle's position and velocity, and operation of updating particle positions. In order to overcome the problem of premature convergence, a new study mechanism is adopted. The geometrical constraints, assembly stability and the changing times of assembly directions are used as the criteria for the fitness function. To validate the performance of the proposed algorithm, a 29-component product is tested by this algorithm. The experimental results indicate that the algorithm proposed in this paper is effective for the ASP.

No abstract

No abstract