Publication: An application of particle swarm optimisation with negative knowledge on multi-objective U-shaped assembly line worker allocation problems
Issued Date
2013-05-20
Resource Type
ISSN
17485045
17485037
17485037
Other identifier(s)
2-s2.0-84877782792
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
International Journal of Industrial and Systems Engineering. Vol.14, No.2 (2013), 139-174
Suggested Citation
Parames Chutima, Ronnachai Sirovetnukul An application of particle swarm optimisation with negative knowledge on multi-objective U-shaped assembly line worker allocation problems. International Journal of Industrial and Systems Engineering. Vol.14, No.2 (2013), 139-174. doi:10.1504/IJISE.2013.053735 Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/31755
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
An application of particle swarm optimisation with negative knowledge on multi-objective U-shaped assembly line worker allocation problems
Author(s)
Other Contributor(s)
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. Copyright © 2013 Inderscience Enterprises Ltd.