An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate


ŞAHİN M., KELLEGÖZ T.

MEMETIC COMPUTING, vol.9, no.3, pp.213-229, 2017 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 9 Issue: 3
  • Publication Date: 2017
  • Doi Number: 10.1007/s12293-017-0239-0
  • Title of Journal : MEMETIC COMPUTING
  • Page Numbers: pp.213-229

Abstract

U-type assembly line is one of the important tools that may increase companies' production efficiency. In this study, two different modeling approaches proposed for the assembly line balancing problems have been used in modeling type-II U-line balancing problems, and the performances of these models have been compared with each other. It has been shown that using mathematical formulations to solve medium and large size problem instances is impractical since the problem is NP-hard. Therefore, a grouping genetic and simulated annealing algorithms have been developed, and a particle swarm optimization algorithm is adapted to compare with the proposed methods. A special crossover operator that always obtains feasible offspring has been suggested for the proposed grouping genetic algorithm. Furthermore, a local search procedure based on problem-specific knowledge was applied to increase the intensification of the algorithm. A set of well-known benchmark instances was solved to evaluate the effectiveness of the proposed and existing methods. Results showed that while the mathematical formulations can only be used to solve small size instances, metaheuristics can obtain high quality solutions for all size problem instances within acceptable CPU times. Moreover, grouping genetic algorithm has been found to be superior to the other methods according to the number of optimal solutions, or deviations from the lower bound values.