소프트 제약을 포함하는 조립라인 밸런싱 문제 최적화
Optimizing Assembly Line Balancing Problems with Soft Constraints
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
Abstract
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.
참고문헌 (26)
- "ALB-Research Group" (2018)[URL]
- Battaia, O., "A taxonomy of line balancing problems and their solution approaches", Int. J. Production Economics, 142(2), pp.259~277 (2013)[DOI]
- Becker, C., "A survey on problems and methods in generalized assembly line balancing", European J. of Operational Research, 168(3), pp.694~715 (2006)[DOI]
- Bukchin, J., "Design of Fexible assembly line to minimize equipment cost", IIE Transactions, 32(7), pp.585~598 (2002)
- 최경현, "유전 알고리듬을 이용한 U형태 혼합모델에서의 작업시간과 육체적 작업부하를 고려한 최적 라인밸런싱", 한국산업경영시스템학회지, 28(3), pp.98~108 (2005), 한국산업경영시스템학회
- 최성훈, "일반 조립 라인 편성 문제를 위한 정수계획 모형", 생산성연구: 국제융합학술지, 25(1), pp.409~428 (2011), 한국생산성학회[DOI]
- 최성훈, "비주얼 작업관리 소프트웨어, VITAMAX 개발에 관한 연구", 한국산업경영시스템학회지, 33(2), pp.33~38 (2010), 한국산업경영시스템학회
- Guo, Z.X., "A genetic-algorithm-based optimization model for scheduling flexible assembly lines", Int J. Adv. Manuf. Technol., 36(1-2), pp.156~168 (2008)[DOI]
- Herdy, M., "Application of the Evolutions strategie to discrete optimization problems", Proc. of the 1st Int. Conf. on Parallel Problem Solving from Nature, pp.187~192 (1991)
- Holland, J.H., "Adaptation in natural and artificial systems" (1975), The University of Michigan Press
- Hu, S.J., "A brief review of trends in design and research of assembly line", Industrial Engineering Magazine, 21(3), pp.24~30 (2014)
- Kendall, J.W., "Hard and soft constraints in linear programming", Omega, 3(6), pp.709~715 (1975)[DOI]
- 김정섭, "IE 기법을 활용한 EPS 모터 제조공정의 운영효율성 향상 사례", 한국산학기술학회논문지, 18(7), pp.63~72 (2017), 한국산학기술학회[DOI]
- Kim, Y.J., "A genetic algorithm for flexible assembly line balancing", Proceedings of the Korean Institute of Industrial Engineers Spring Joint Conference, pp.425~428 (2004)
- Kim, Y.K., "0-1 Programming Formulations for Assembly Line Balancing of Large-Sized Product", J. of the Korean Operations Research and Management Science Society, 17(1), pp.55~65 (1992)
- Kim, Y.K., "A Genetic Algorithm for Two-sided Assembly Line Balancing", IE interfaces, 12(1), pp.132~142 (1999)
- Kim, Y.K., "Metaheuristics" (2017), Chonnam National University Press
- Kim, Y.K., "Metaheuristic" (1997), Yeongji Moonhwasa
- Lee, H.F., "An Integrated design sup- port method for flexible assembly system", J. of Manufacuring Systems, 15(1), pp.13~32 (1996)[DOI]
- Lee, S.W., "The development of critical node method based heuristic procedure for Solving fuzzy assembly-line balancing problem", J. of Society of Korea Industrial and Systems Engineering, 22(51), pp.189~197 (1999)
- Patterson, J.H., "Assembly-Line Balancing : Zero-One Programming with Fibonacci Search", Operations Research, 23(1), pp.166~172 (1975)[DOI]
- Rachamadugu, R., "Improving the equality of workload assignments in assembly lines", International J. of Production Research, 29(3), pp.619~633 (1991)[DOI]
- Scholl, A., "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing", European J. of Operational Research, 168(3), pp.666~693 (2006)[DOI]
- Scholl, A., "SALOME : A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing", Informs J. on Computing, 9(4), pp.319~334 (1997)[DOI]
- Starkweather, T., "A comparison of genetic sequencing operators", Proceedings of the fourth International Conference on Genetic Algorithms, pp.69~76 (1991)
- Tasan, S.O., "A review of the current applications of genetic algorithms in assembly line balancing", J. Intell. Manuf., 19(1), pp.49~69 (2008)[DOI]