Abstract
In this paper, a hybrid GA approach combining genetic algorithm (GA) and tabu search (TS) is proposed to solve simple assembly line balancing problem. As this problem is combinatorial and NP hard in nature, the optimum seeking methods are impractical. Therefore, we proposed a hybrid approach, which unites the advantages and mitigates the disadvantages of the two algorithms. To increase the performance of the hybrid GA, we also optimized the control parameters such as the population size, rate of crossover and mutation. Moreover, to gain more insight on the performance of hybrid GA, we implemented it to various benchmark problems and observed that the hybridization of GA with TS improves the solution performance of the balancing problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Scholl, A.: Balancing and Sequencing of Assembly Lines. Physica-Verlag, Heidelberg (1999)
Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: The Proc of IEEE Int Conf on Robotics and Automation, pp. 1189–1192 (1992)
Falkenauer, E.: A grouping genetic algorithm for line balancing with resource dependent task times. In: The Proc of Int Conf on Neural Information Processing, pp. 464–468 (1997)
Rekiek, B., de Lit, P., Pellichero, F., Falkenauer, E., Delchambre, A.: Applying the equal piles problem to balance assembly lines. In: The Proc of ISATP 1999, pp. 399–404 (1999)
Brown, E.C., Sumichrast, R.T.: Evaluating performance advantages of grouping genetic algorithms. Eng. Appl. of Artificial Intelligence 18, 1–12 (2005)
Leu, Y.Y., Matheson, L.A., Rees, L.P.: Assembly line balancing using genetic algorithms with heuristic generated initial populations and multiple criteria. Decision Sciences 15, 581–606 (1994)
Kim, Y.K., Kim, Y.J., Kim, Y.H.: Genetic algorithms for assembly line balancing with various objectives. Computers and Industrial Engineering 30(3), 397–409 (1996)
Bautista, J., Suarez, R., Mateo, M., Companys, R.: Local search heuristics for the assembly line balancing problem with incompatibilities between tasks. In: The Proc of IEEE Int Conf on Robotics and Automation, pp. 2404–2409 (2000)
Ponnambalam, S.G., Aravindan, P., Naidu, G., Mogileeswar, G.: Multi-objective genetic algorithm for solving assembly line balancing problem. Int Journal of Advanced Manufacturing Technology 16(5), 341–352 (2000)
Sabuncuoglu, I., Erel, E., Tanyer, M.: Assembly line balancing using genetic algorithms. Journal of Intelligent Manufacturing 11(3), 295–310 (2000)
Goncalves, J.F., De Almedia, J.R.: A hybrid genetic algorithm for assembly line balancing. Journal of Heuristic 8, 629–642 (2002)
Stockton, D.J., Quinn, L., Khalil, R.A.: Use of genetic algorithms in operations management Part 1: applications. Proc of Inst of Mech Eng-Part B: Journal of Engineering Manufacture 218(3), 315–327 (2004a)
Stockton, D.J., Quinn, L., Khalil, R.A.: Use of genetic algorithms in operations management Part 2: results. Proc of Inst of Mech Eng-Part B: Journal of Engineering Manufacture 218(3), 329–343 (2004)
Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1996)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1998)
Scholl, A.: Data of assembly line balancing problems. Schriften zur Quantitativen Betriebswirtschaftslehre 16/93, TU Darmstadt (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tasan, S.Ă–., Tunali, S. (2006). Improving the Genetic Algorithms Performance in Simple Assembly Line Balancing. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751649_9
Download citation
DOI: https://doi.org/10.1007/11751649_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34079-9
Online ISBN: 978-3-540-34080-5
eBook Packages: Computer ScienceComputer Science (R0)