Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm


DOI: 10.1007/s00170-010-2937-3

Cite this article as:
Bagher, M., Zandieh, M. & Farsijani, H. Int J Adv Manuf Technol (2011) 54: 271. doi:10.1007/s00170-010-2937-3


Recently, there is a growing interest in the industry to replace traditional straight assembly lines with U-shaped lines for more flexibility and higher productivity. Due to mathematical and computational complexity, assembly line balancing problems are known to be NP hard in nature. Therefore, many meta-heuristics have been proposed to find optimal solution for these problems. This paper presents a new hybrid evolutionary algorithm to solve stochastic U-type assembly line balancing problems, with the aim of minimizing the number of work stations, idle time at each station, and non-completion probabilities of each station (probability of the station time exceeding cycle time). The proposed algorithm is a combination of computer method for sequencing operations for assembly lines (COMSOAL), task assignment rules heuristic, and newly introduced imperialist competitive algorithm (ICA). Unlike the current evolutionary algorithms that are computer simulation of natural processes, ICA is inspired from socio-political evolution processes. Since appropriate design of the parameters has a significant impact on the algorithm efficiency, various parameters of the ICA are tuned by means of the Taguchi method. For the evaluation of the proposed hybrid algorithm, the performance of the proposed method is examined over benchmarks from the literature and compared with the best algorithm proposed before. Computational results demonstrate the efficiency and robustness of our algorithm.


Stochastic U-type assembly line balancing problems Imperialist competitive algorithm Taguchi method 

Copyright information

© Springer-Verlag London Limited 2010

Authors and Affiliations

  1. 1.Department of Industrial Management, Management and Accounting FacultyShahid Beheshti UniversityTehranIran

Personalised recommendations