Optimizing Assembly Line Balancing Problems with Soft Constraints

• 발행기관: 한국산업경영시스템학회
• 저자명: Seong-Hoon Choi(최성훈) Geun-Cheol Lee(이근철)
• 간행물 정보: 『산업경영시스템학회지』제41권 제2호, 105~116쪽, 전체 12쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2018.06.30

영문 초록

In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.

목차

1. 서 론

2. 소프트 할당제약 혼합정수계획 모델

3. 소프트 할당제약 GALB 문제를 위한 GA

4. 성능평가 실험

5. 결 론

키워드

Generalized Assembly Line Balancing Problem Soft Constraints Genetic Algorithm