지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 대한산업공학회 Industrial Engineering & Management Systems Industrial Engineering & Management Systems 제12권 제3호
- 발행연도
- 2013.9
- 수록면
- 181 - 189 (9page)
이용수
초록· 키워드
오류제보하기
This paper proposes a two-phase genetic algorithm (GA) to solve the problem of obtaining an optimum configuration of a paired single row assembly line. We pair two single-row assembly lines due to the shared usage of several workstations, thus obtaining an optimum configuration by considering the material flow of the two rows simultaneously. The problem deals with assigning workstations to a sequence and selecting the best arrangement by looking at the length and width for each workstation. This can be considered as an enhancement of the single row facility layout problem (SRFLP), or the so-called paired SRFLP (PSRFLP). The objective of this PSRFLP is to find an optimal configuration that seeks to minimize the distance traveled by the material handler and even the use of the material
handler itself if this is possible. Real-world applications of such a problem can be found for apparel, shoe, and other manual assembly lines. This research produces the schematic representation solution using the heuristic approach. The crossover and mutation will be utilized using the schematic representation solution to obtain the neighborhood solutions. The first phase of the GA result is recorded to get the best pair. Based on these best matched pairs, the secondphase GA can commence.
handler itself if this is possible. Real-world applications of such a problem can be found for apparel, shoe, and other manual assembly lines. This research produces the schematic representation solution using the heuristic approach. The crossover and mutation will be utilized using the schematic representation solution to obtain the neighborhood solutions. The first phase of the GA result is recorded to get the best pair. Based on these best matched pairs, the secondphase GA can commence.
목차
ABSTRACT
1. INTRODUCTION
2. PREVIOUS STUDIES
3. PROBLEM DEFINITION
4. PROPOSED METHOD
5. RESULTSAND DISCUSSION
6. CONCLUSION
REFERENCES
참고문헌 (20)
참고문헌 신청
1. [학술지(정기간행물)] - Al-Hakim, L. / 2000 / On solving facility layout problems using genetic algorithms / International Journal of Production Research 38 (11) : 2573 ~ 2582
2. [학술지(정기간행물)] - Ariafar, S. / 2009 / An improved algorithm for layout design in cellular manufacturing systems / Journal Manufacturing Systems 28 (4) : 132 ~ 139
3. [학술지(정기간행물)] - Braglia, M. / 1996 / Optimization of a simulated-annealingbased heuristic for single row machine layout problem by genetic algorithm / International Transaction in Operation Research 1 (3) : 37 ~ 49
4. [학술지(정기간행물)] - Datta, D. / 2011 / Single row facility layout problem using a permutation-based genetic algorithm / European Journal of Operational Research 213 (2) : 388 ~ 394
5. [학술지(정기간행물)] - Dimopoulos, C. / 2000 / Recent developments in evolutionary computation for manufacturing optimization : problems, solutions, and comparisons / IEEE Transactions on Evolutionary Computation 4 (2) : 93 ~ 113
2. [학술지(정기간행물)] - Ariafar, S. / 2009 / An improved algorithm for layout design in cellular manufacturing systems / Journal Manufacturing Systems 28 (4) : 132 ~ 139
3. [학술지(정기간행물)] - Braglia, M. / 1996 / Optimization of a simulated-annealingbased heuristic for single row machine layout problem by genetic algorithm / International Transaction in Operation Research 1 (3) : 37 ~ 49
4. [학술지(정기간행물)] - Datta, D. / 2011 / Single row facility layout problem using a permutation-based genetic algorithm / European Journal of Operational Research 213 (2) : 388 ~ 394
5. [학술지(정기간행물)] - Dimopoulos, C. / 2000 / Recent developments in evolutionary computation for manufacturing optimization : problems, solutions, and comparisons / IEEE Transactions on Evolutionary Computation 4 (2) : 93 ~ 113
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2014-500-002847963