• 대한산업공학회지
• /
• 제27권1호
• /
• pp.54-60
• /
• 2001

In this paper, a shape-based block layout (SBL) approach is presented to solve the facility layout problem with unequal-area and fixed shapes. The SBL approach employs hybrid genetic algorithm (Hybrid-GA) to find a good solution and the concept of bay structure is used. In the typical facility layout problem with unequal area and fixed shapes, the given geometric constraints of unequal-area and fixed shapes are mostly approximated to original shape by aspect ratio. Thus, the layout results require extensive manual revision to create practical layouts and it produces irregular building shapes and too much unusable spaces. Experimental results show that a SBL model is able to produce better solution and to create more practical layouts than those of existing approaches.

• Industrial Engineering and Management Systems
• /
• 제3권2호
• /
• pp.123-128
• /
• 2004

A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between facilities and total rectangular layout area where all facilities and dead spaces are enclosed. Using the genetic code corresponding to two kinds of information, facility sequence and branching positions in the tree structure model, a genetic algorithm has been applied for finding non-dominated solutions in the two-objective layout problem. We use three kinds of crossover (PMX, OX, CX) for the former part of the chromosome and one-point crossover for the latter part. Two kinds of layout problems have been tested by the proposed method. The results demonstrate that the presented algorithm is able to find good solutions in enough short time.

• 품질경영학회지
• /
• 제21권2호
• /
• pp.232-241
• /
• 1993

The objective of this study is to develop an algorithm in the consideration of importance Weight and desirable shape of specific department in the computerized layout planning. Quantitative relationship chart between each department was used. It is decided that the priority among the department as to variable factors and the optimum quantitative relationship chart was obtained using by the Weighting method. The algorithm presented in this study could generate more practical layout for the actual design problem.

• 콘크리트학회논문집
• /
• 제20권6호
• /
• pp.705-712
• /
• 2008

본 연구에서는 그라운드 구조법을 이용하여 콘크리트 구조형태의 최적화에 대한 수치 실험을 하였다. 마이크로 격자 모델은 단위 셀의 집합체로 구성되었다. 해석 과정은 각 부재의 응답계를 강성에 피드백 시켜서 유한요소해석을 반복하였다. 이 해석의 반복을 통하여, 트러스 모델은 수리적 최적화 수법이 아니라 국소적인 응력 상태를 이용하여 위상적인 구조 형태와 구조적 형상을 표현하였다. 격자 트러스 모델을 여러 예제에 적용하여 형상 배치 문제를 해석하는데 성공하였다.

• 한국경영과학회지
• /
• 제21권2호
• /
• pp.59-70
• /
• 1996

Given the flow matrix, plant size (rectangle shape) and department sizes, the algorithm in this paper provides the plant layout with rectilinear distance measure. To construct automated facility design, eigenvector approach is employed. A branch and bound computer code developed by Tillinghast is modified to find the feasible fits of departments without shape distortion (see [1])in the plant rectangle. The computational results compared with CRAFT are shown.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.162-165
• /
• 1998

We consider a facility layout problem for optimized material flow system design in the automated production system design. Existing facility layout algorithm have a weak point that arranged facilities have irregular shape or don't preserve their own shape and size. The proposed algorithm give a layout which is minimize total material handling cost and maximize space utility under preserving each facilities' own shape and size.

• 경영과학
• /
• 제11권3호
• /
• pp.55-65
• /
• 1994

Given the flow matrix, plant size and department sizes, the algorithms in this paper provide the layout with rectilinear distance. To construct automated facility design, cut tree approach is employed. A branch and bound computer code developed by Tillinghast is modifided to find the feasible fits of departments without shape distortion in the plant rectangle.

• 경영과학
• /
• 제14권1호
• /
• pp.67-76
• /
• 1997

The most research on facility layout problems ignored the actual shapes of activity spaces and the aisles between activities. In many cases, the research also ignored the actual shape of building where the activities are to be arranged. In this paper, We present a block based layout technique that applies a genetic algorithm to search for a very good facility layout with horizontal aisles. From the extensive experiments for two different cases with respect to the shape of activity space, it was found that the proposed method generated better layouts than the ones obtained by applying Tam's algorithm in all test problems. The proposed algorithm showed about 10% improvement of performance on the average. We determined the best combination of the reproduction rule and the genetic operators with their probabilities for each test problem through the experiment.

• 산업경영시스템학회지
• /
• 제22권49호
• /
• pp.89-98
• /
• 1999

The objective of this study is to develop an improved algorithm for layout problems. Computerized facility layout program was also applied to solve the layout problem in locomotive maintenance workshop. The current facility layout is structured in the large space without considerations of many variable factors. For this reason, effectiveness of layout results in loss on effective space utility. This study is to develop an algorithm in the consideration of importance weight and desirable shape of specific department in the computerized layout planning and quantitative relationship rating between each department was used. Standard process duration of locomotive maintenance workshop was used to select the main activities of locomotive maintenance work. This study could generate more efficient facility layout design to reduce the number of movement frequency and travel distance in maintenance workshop.

• 산업공학
• /
• 제20권2호
• /
• pp.121-132
• /
• 2007

The facility layout problem (FLP) involves the positioning of facilities within a given workplace in order to minimize the material flow distance between facilities. In this paper, we focus on the FLP in which the each facility has a rectangular shape and an input and output points. We develop a heuristic algorithm in which the facilities are arranged according to the layout algorithm using center of gravity and then simulated annealing algorithm is applied to improve the solution. A comparison of the computational results with exiting algorithms shows that the proposed algorithm provides better solutions in reasonable range of computational time.