Conclusions from comparing genetic algorithms for U-shaped assembly line balancing

This paper compares several different Genetic Algorithm approaches for solving the Mixed Model U-Line Balancing and Sequencing. We first overview the Genetic Algorithms approach and the Assembly Line Balancing Problem in general, then we describe the Mixed Model U-shaped Assembly Line and the problems it presents. We proceed to applications of Genetic Algorithms to these problems, describing and comparing the various algorithms proposed in recent years. Several different algorithms are implemented and the results of comparative executions on benchmark problems follow. The comparisons are done on various combinations of parameter values. In particular, we investigate the behavior of the algorithms under different levels of crossover intensity, mutation intensity and elitism. Finally, we draw conclusions and present potential future research directions.