By Topic

A Discrete Particle Swarm Optimization Algorithm for Assembly Line Balancing Problem of Type 1

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Dou Jianping ; Southeast Univ., Nanjing, China ; Su Chun ; Li Jun

A discrete particle swarm optimization (DPSO) algorithm is presented for the assembly line balancing problem of type 1, ALBP-I. A new permutation encoding method is developed to make the particle correspond to a feasible operation sequence (FOS) which satisfies the precedence constrains of assembly tasks. A position based crossover operator for permutation encoding is unitized to update the particle. Based on the encoding method and particle updating mechanism, the DPSO is employed to find the optimum efficiently in the search space comprising the optimal assignments associated with all FOSs. The DPSO algorithm is tested on a set of problems taken from the literature and compared with other approaches. The computational results show the effectiveness and efficiency of the proposed algorithm.

Published in:

Measuring Technology and Mechatronics Automation (ICMTMA), 2011 Third International Conference on  (Volume:1 )

Date of Conference:

6-7 Jan. 2011