• Title/Summary/Keyword: shape-layout problem

Search Result 33, Processing Time 0.032 seconds

Hybrid Genetic Algorithm for Facility Layout Problems with Unequal Area and Fixed Shapes (고정된 형태와 크기가 다른 설비의 배치를 위한 혼합 유전자 알고리듬)

  • Lee, Moon-Hwan;Lee, Young-Hae;Jeong, Joo-Gi
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.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.

  • PDF

Tree Structure Modeling and Genetic Algorithm-based Approach to Unequal-area Facility Layout Problem

  • Honiden, Terushige
    • Industrial Engineering and Management Systems
    • /
    • v.3 no.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.

A Layout Design Algorithm with the Importance Weight and Shape of Department (부서중요도(部署重要度)와 요구형태(要求形態)를 고려(考慮)한 배치(配置) 설계(設計) 알고리즘)

  • Lee, Sang-Seol;Gang, Hui-Jeong
    • Journal of Korean Society for Quality Management
    • /
    • v.21 no.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.

  • PDF

Structural Layout Design for Concrete Structures Based on the Repeated Control Method by Using Micro Lattice Truss Model (마이크로 격자트러스모델을 이용한 반복강성제어법에 의한 콘크리트 구조형태의 최적화)

  • Choi, Ik-Chang;Ario, Ichiro
    • Journal of the Korea Concrete Institute
    • /
    • v.20 no.6
    • /
    • pp.705-712
    • /
    • 2008
  • This study carried out simulation for structural layout design for concrete structures by using the models of the ground structure method. The micro lattice truss is modeled as assemblage of a number of unit cells. The progress of analysis repeat to undergo finite element analysis to feed-back results of stress to the stiffness of each member. Through the repeated this analysis, truss model is represented to form the topological materials and the structural shape with the use of the local stress condition without mathematical optimum tools. It is successful to analyse the shape-layout problem as numerical samples on the lattice truss model.

Branch and Bound Algorithm for the Facility Layout Problem Without Shape Distortion

  • Kim, Chae-Bogk;Kim, Yung-Sik;Lee, Dong-Hoon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.21 no.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.

  • PDF

A Study on Facility Layout for Optimamization of Material Flow System (물류시스템 최적화를 위한 설비배치에 관한 연구)

  • Park, Se-Joon;Lee, Young-Hae;Hur, Sun;Lee, Moon-Hwan;Yu, Ji-Yong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1998.10a
    • /
    • 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.

  • PDF

Cut tree approach for facility layout problem

  • Kim, Chae-Bogk
    • Korean Management Science Review
    • /
    • v.11 no.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.

  • PDF

Applying a genetic algorithm to a block layout (블록단위 설비배치를 위한 유전자 알고리듬의 적용)

  • 우성식;박양병
    • Korean Management Science Review
    • /
    • v.14 no.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.

  • PDF

A study on the Improvement of Facility Layout in Locomotive Maintenance Workshop (철도차량 정비공장의 설비배치 개선에 관한 연구)

  • 이상설;안도만;강희정
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.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.

  • PDF

Heuristic Algorithm for Facility Layout Design with Fixed Input and Output Points (입력점과 출력점이 고정된 설비배치설계를 위한 휴리스틱 알고리즘)

  • Jeong, Dong-Hwa;Seo, Yoon-Ho
    • IE interfaces
    • /
    • v.20 no.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.