A Multi-Objective Genetic Algorithm for Solving Assembly Line Balancing Problem

In this paper, a multi-objective genetic agorithm to solve assembly line balancing problems is proposed. The performance criteria considered are the number of workstations, the line efficiency, the smoothness index before trade and transfer, and the smoothness index after trade and transfer. The developed genetic algorithm is compared with six popular heuristic algorithms, namely, ranked positional weight, Kilbridge and Wester, Moodie and Young, Hoffmann precedence matrix, immediate update first fit, and rank and assign heuristic methods. For comparative evaluation, 20 networks are collected from open literature, and are used with five different cycle times. All the six heuristics and the genetic algorithm are coded in C++ language. It is found that the proposed genetic algorithm performs better in all the performance measures than the heuristics. However, the execution time for the GA is longer, because the GA searches for global optimal solutions with more iterations.