• Title/Summary/Keyword: layout algorithm

Search Result 356, Processing Time 0.028 seconds

Factory Layout and Aisle Structure Design Considering Dimension Constraints and Door Locations (형태 제약과 출입구를 고려한 설비 배치 및 복도 구조 디자인)

  • Chae-Bogk Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.26 no.3
    • /
    • pp.58-66
    • /
    • 2003
  • The cut tree approach of Montreuil and Ratliff [16] and eigenvector approach [10] are used to automatically draw a feasible facility layout with aisle structure. The department arrangement can minimize an aisle distance criterion considering door locations and dimension constraints. The aisle distance is measured by the door to door distance between departments. An eigenvector and cut tree approaches [1] are implemented based on the branch and bound technique in Kim et al. [2] in order to obtain feasible layouts. Then, the algorithm to fix the door location of each department is developed. After the door locations are determined, the factory layout is evaluated in terms of aisle distance. The aisle structure is obtained by expanding the original layout. The solution is kept until we will find better factory layout. The proposed approach based on the branch and bound technique, in theory, will provide the optimal solution. If the runs are time and/or node limited, the proposed method is a strong heuristic. The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length(l) and width(w) are fixed and a perfect fit is generated if a fit is possible.

Research on Facility Layout of Prefabricated Building Construction Site

  • Yang, Zhehui;Lu, Ying;Zhang, Xing;Sun, Mingkang;Shi, Yufeng
    • International conference on construction engineering and project management
    • /
    • 2017.10a
    • /
    • pp.42-51
    • /
    • 2017
  • Due to the high degree of mechanization and the good environmental benefits, the prefabricated buildings are being promoted in China. The construction site layout of the prefabricated buildings has important influence on its safety benefit. However, few scholars have studied the safety problem on it. Firstly, in order to give a follow-up study foreshadowing the characteristics of prefabricated buildings are analyzed, the research assumptions are given and three types of safety buffers are established. And then a mult-objective model for the prefabricated buildings site layout is presented: taking into account the limits of noise, the coverage of the tower crane and the possibility of exceeding boundaries and overlapping, the constraints are and designed established respectively; Based on the improved System Layout Planning (SLP) method, the efficiency\cost\safety interaction matrices among the facilities are also founded for objective function. For the sake of convenience, a hypothetical facility layout case of the prefabricated building is used, the optimal solution of that is obtained in MATLAB with particle swarm algorithm (PSO), which proves the effectiveness of the model presented in this paper.

  • PDF

The Grid Type Quadratic Assignment Problem Algorithm (그리드형 2차 할당문제 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.4
    • /
    • pp.91-99
    • /
    • 2014
  • TThis paper suggests an heuristic polynomial time algorithm to solve the optimal solution for QAP (quadratic assignment problem). While Hungarian algorithm is most commonly used for a linear assignment, there is no polynomial time algorithm for the QAP. The proposed algorithm derives a grid type layout among unit distances of a distance matrix. And, we apply max-flow/min-distance approach to assign this grid type layout in such a descending order way that the largest flow is matched to the smallest unit distance from flow matrix. Evidences from implementation results of the proposed algorithm on various numerical grid type QAP examples show that a solution to the QAP could be obtained by a polynomial algorithm.

The Extracting Method of Key-frame Using Color Layout Descriptor (컬러 레이아웃을 이용한 키 프레임 추출 기법)

  • 김소희;김형준;지수영;김회율
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.213-216
    • /
    • 2001
  • Key frame extraction is an important method of summarizing a long video. This paper propose a technique to automatically extract several key frames representative of its content from video. We use the color layout descriptor to select key frames from video. For selection of key frames, we calculate similarity of color layout features extracted from video, and extract key frames using similarity. An important aspect of our algorithm is that does not assume a fixed number of key frames per video; instead, it selects the number of appropriate key frames of summarizing a long video Experimental results show that our method using color layout descriptor can successfully select several key frames from a video, and we confirmed that the processing speed for extracting key frames from video is considerably fast.

  • PDF

Cable layout design of two way prestressed concrete slabs using FEM

  • Khan, Ahmad Ali;Pathak, K.K.;Dindorkar, N.
    • Computers and Concrete
    • /
    • v.11 no.1
    • /
    • pp.75-91
    • /
    • 2013
  • In this paper, a new approach for cable layout design of pre-stressed concrete slabs is presented. To account the cable profile accurately, it is modelled by B-spline. Using the convex hull property of the B-spline, an efficient algorithm has been developed to obtain the cable layout for pre-stressed concrete slabs. For finite element computations, tendon and concrete are modelled by 3 noded bar and 20 noded brick elements respectively. The cable concrete interactions are precisely accounted using vector calculus formulae. Using the proposed technique a two way prestressed concrete slab has been successfully designed considering several design criteria.

A Design Rule checker Based on Bit-Mapping (Bit-map 방식에 의한 설계규칙 검사)

  • Eo, Gil-Su;Kim, Gyeong-Tae;Gyeong, Jong-Min
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.2
    • /
    • pp.36-43
    • /
    • 1985
  • This paper describes a DRC (Design Rule Check) algorithm and its program implement-ation which requires CPU time linearly proportional to the number of rectangular patterns n the NMOS If layout. While the CPU time for conventional DRC algorithm is proportion-al to 0(nlogn) or 0(n**1.2), (n:number of rectangles it was shown that the present also-rithm only consumes CPU time linearly proportional to 0(n).

  • PDF

Minimization of the Rearrangement of a Block Stockyard Based on the Genetic Algorithm (유전 알고리즘을 기반으로 한 조선소 블록 적치장의 재배치 최소화)

  • Roh, Myung-Il;Im, Byeong-Seog
    • Korean Journal of Computational Design and Engineering
    • /
    • v.16 no.3
    • /
    • pp.207-215
    • /
    • 2011
  • Due to its large size, a ship is first divided into scores of blocks and then each block is constructed through various shops, such as the assembly shop, the painting shop, and the outfitting shop. However, each block may not be directly moved to the next shop and may be temporarily laid on a block stockyard because the working time in each shop is different. If blocks are laid on the block stockyard without any planning, the rearrangement of the blocks by a transporter are required because the blocks have the different in and out time. In this study, an optimal layout method based on the genetic algorithm was proposed in order to minimize the rearrangement of the blocks in the block stockyard. To evaluate the applicability of the proposed method, it was applied to a simple layout problem of the block stockyard.

IMPROVING REGIONAL OVERPOWER PROTECTION TRIP SET POINT VIA CHANNEL OPTIMIZATION

  • Kastanya, Doddy
    • Nuclear Engineering and Technology
    • /
    • v.44 no.7
    • /
    • pp.799-806
    • /
    • 2012
  • In recent years, a new algorithm has been introduced to perform the regional overpower protection (ROP) detector layout optimization for $CANDU^{(R)}$ reactors. This algorithm is called DETPLASA. This algorithm has been shown to successfully come up with a detector layout which meets the target trip set point (TSP) value. Knowing that these ROP detectors are placed in a number of safety channels, one expects that there is an optimal placement of the candidate detectors into these channels. The objective of the present paper is to show that a slight improvement to the TSP value can be realized by optimizing the channelization of these ROP detectors. Depending on the size of the ROP system, based on numerical experiments performed in this study, the range of additional TSP improvement is from 0.16%FP (full power) to 0.56%FP.

Development of the Pre-erection Block Arrangement System for Deckhouse (선실 PE장 정반배치 계획수립 시스템 개발)

  • Ha, Seung-Jin;Kim, Ji-On;Choi, Tae-Hoon
    • Special Issue of the Society of Naval Architects of Korea
    • /
    • 2007.09a
    • /
    • pp.79-88
    • /
    • 2007
  • In this study, we improved the layout of deckhouse pre-erection area where erects the blocks and developed the pre-erection block arrangement system for the improvement of productivity and effectiveness. The major operating point of the pre-erection area is to fabricate as many as possible that has restrict area and working plate. The developed system has information management module, scheduling module, schedule control module, statistics module, and information integrate module. The heuristic algorithm is issued and evaluated with real data. And genetic algorithm is used for the evaluation of issued it.

  • PDF

Structural optimization of stiffener layout for stiffened plate using hybrid GA

  • Putra, Gerry Liston;Kitamura, Mitsuru;Takezawa, Akihiro
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.11 no.2
    • /
    • pp.809-818
    • /
    • 2019
  • The current trend in shipyard industry is to reduce the weight of ships to support the reduction of CO2 emissions. In this study, the stiffened plate was optimized that is used for building most of the ship-structure. Further, this study proposed the hybrid Genetic Algorithm (GA) technique, which combines a genetic algorithm and subsequent optimization methods. The design variables included the number and type of stiffeners, stiffener spacing, and plate thickness. The number and type of stiffeners are discrete design variables that were optimized using the genetic algorithm. The stiffener spacing and plate thickness are continuous design variables that were determined by subsequent optimization. The plate deformation was classified into global and local displacement, resulting in accurate estimations of the maximum displacement. The optimization result showed that the proposed hybrid GA is effective for obtaining optimal solutions, for all the design variables.