An application of particle swarm optimisation with negative knowledge on multi-objective U-shaped assembly line worker allocation problems
by Parames Chutima; Ronnachai Sirovetnukul
International Journal of Industrial and Systems Engineering (IJISE), Vol. 14, No. 2, 2013

Abstract: Multi-objective U-shaped manually operated assembly line worker allocation problems with symmetrical and rectangular layouts are addressed in this paper. The problems are optimised in a hierarchical manner. The primary objective is to minimise the number of workers and the second objective comprises two conflicting sub-objectives including the deviation of operation times of workers and the walking time which are minimised simultaneously. Mathematical formulation of the problems is presented. Since the problems are classified in the non-deterministic polynomial time hard type, a novel evolutionary algorithm, namely particle swarm optimisation with negative knowledge (PSONK), is proposed as a solution technique. The performance of PSONK is compared with several well-known algorithms, i.e. non-dominated sorting genetic algorithm-II, memetic algorithm (MA) and discrete particle swarm optimisation. PSONK and MA tend to give indifferent performance but they outperform the others. However, PSONK can reach final solutions much faster than the others, especially MA.

Online publication date: Fri, 27-Dec-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com