An Evolutionary Algorithm for Goal Programming: Application to two-sided Assembly Line Balancing Problems

목표계획법을 위한 진화알고리즘: 양면조립라인 밸런싱 문제에 적용

  • 송원섭 (전남대학교 산업공학과) ;
  • 김여근 (전남대학교 산업공학과)
  • Published : 2008.10.31

Abstract

This paper presents an evolutionary algorithm for goal programming with preemptive priority. To do this, an evolutionary strategy is suggested which search for the solution satisfying the goals in the order of the priority. Two-sided assembly line balancing problems with multiple goals are used to validate the applicability of the algorithm. In the problems, three goals are considered in the following priority order: minimizing the number of mated-stations, achieving the goal level of workload smoothness, and maximizing the work relatedness. The proper evolutionary components such as encoding and decoding method, evaluation scheme, and genetic operators, which are specific to the problem being solved, are designed in order to improve the algorithm's performance. The computational result is reported.

Keywords