원문정보
Sequencing to Minimize the Total Utility Work in Car Assembly Lines
초록
영어
The sequence which minimizes overall utility work in car assembly lines reduces the cycle time, the number of utility workers, and the risk of conveyor stopping. This study suggests mathematical formulation of the sequencing problem to minimize overall utility work, and present a genetic algorithm which can provide a near optimal solution in real time. To apply a genetic algorithm to the sequencing problem in car assembly lines, the representation, selection methods, and genetic parameters are studied. Experiments are carried out to compare selection methods such as roullette wheel selection, tournament selection and ranking selection. Experimental results show that ranking selection method outperforms the others in solution quality, whereas tournament selection provides the best performance in computation time.
목차
1. 서론
2. 모형화
2.1 문제의 설정
2.2 수리모형
3. 유전 알고리즘
3.1 수정 유전 알고리즘
3.2 선별방법
4. 실험 결과
4.1 실험 예제
4.2 선별방법의 비교분석
5. 결론
6. 참고문헌