2006 | OriginalPaper | Chapter
Improving the Genetic Algorithms Performance in Simple Assembly Line Balancing
Authors : Seren Özmehmet Tasan, Semra Tunali
Published in: Computational Science and Its Applications - ICCSA 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.