• Title/Summary/Keyword: layout algorithm

Search Result 356, Processing Time 0.024 seconds

The Development of Automatic Module for Formwork Layout using the BIM

  • Chijoo Lee;Sungil Ham;Ghang Lee
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.1266-1271
    • /
    • 2009
  • Formwork layout is perceived as important due to its strong tie to site works. But, most formwork is done manually and influenced by worker's skill and thus, a lot of construction errors occur. The introduction of BIM (Building Information Modeling) enables acquiring more precise information on the building shape, dimension, structure, etc. than 2D-based drawings and thus, the increased productivity, such as reduction of workload and work times, and the economic efficiency, such as reduction of formwork types and form dimensions with the consideration of constructability, are expected. This study reviewed the previous studies and formwork layout systems to derive this study's differentiations and factors to be first considered for formwork planning were derived by analyzing priorities against consideration factors. Last, a flow chart and algorithm were developed to apply the derived factors to the formwork layout module.

  • PDF

A Hierarchical and Incremental DRC System Using Sliced-Edge Trace Algorithm (Sliced-Edge Trace 알고리듬을 이용한 계층적 Incremental DRC 시스템)

  • 문인호;김현정;오성환;황선영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.28A no.1
    • /
    • pp.60-73
    • /
    • 1991
  • This paper presents an efficient algorithm for incremental and hierarchical design rule checking of VLSI layouts, and describes the implementation of a layout editor using the proposed algorithm. Tracing the sliced edges divided by the intersection of the edges either ina polygon or in two polygons (Sliced-Edge Trace), the algorithm performs VLSI pattern operations like resizing and other Boolean operations. The algorithm is not only fast enough to check the layouts of full-custom designs in real-time, but is general enough to be used for arbitrarily shaped polygons. The proposed algorithm was employed in developingt a layout editor on engineering workstations running UNIX. The editor has been successfully used for checking, generating and resizing of VLSI layouts.

  • PDF

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 Simplified Assessment Method and Application for Consideration of Survivability in Spatial Layout Design at the Early Design Stage of Naval Vessels (함정 초기 설계 단계에서 레이아웃 설계 시 생존성을 고려하기 위한 간이 평가 방법과 애플리케이션)

  • Jung, Jin-Uk;Jeong, Yong-Kuk;Ju, SuHeon;Shin, Jong Gye;Kim, JongChul
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.55 no.1
    • /
    • pp.9-21
    • /
    • 2018
  • Survivability of naval vessels is defined as the ability to perform functions and missions in a combat environment. Survivability has close relationship with the spatial layout of naval vessels. In order to maximize survivability, it must be considered from the early stage of design. However the existing concept of survivability was intended to be applied to unit vessels. So it was not suitable for assessment of spatial layout results at the early stage of design. In this paper, a simplified assessment method which can evaluate the spatial layout considering the survivability in the early stage of design has been proposed. For this, assessment layers were defined on survivability components such as susceptibility, vulnerability, and recoverability. Assessment layers of each component were overlapped to deduce a survivability layer of spatial layout alternatives. In addition, the proposed method and optimization algorithm were used to derive optimal spatial layout alternatives considering survivability.

MLP: Mate-based Sequence Layout with PHRAP

  • Kim, Jin-Wook;Roh, Kang-Ho;Park, Kun-Soo;Park, Hyun-Seok;Seo, Jeong-Sun
    • Bioinformatics and Biosystems
    • /
    • v.1 no.1
    • /
    • pp.61-66
    • /
    • 2006
  • We propose a new fragment assembly program MLP (mate-based layout with PHRAP). MLP consists of PHRAP, repeat masking, and a new layout algorithm that uses the mate pair information. Our experimental results show that by using MLP instead of PHRAP, we can significantly reduce the difference between the assembled sequence and the original genome sequence.

  • PDF

A Study of UWB Placement Optimization Based on Genetic Algorithm

  • Jung, Doyeon;Kim, Euiho
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.11 no.2
    • /
    • pp.99-107
    • /
    • 2022
  • Urban Air Mobility (UAM) such as a drone taxi is one of the future transportations that have recently been attracting attention. Along with the construction of an urban terminal, an accurate landing system for UAM is also essential. However, in urban environments, reliable Global Navigation Satellite Systems (GNSS) signals cannot be received due to obstacles such as high-rise buildings which causes multipath and non-line of sight signal. Thus, the positioning result in urban environments from the GNSS signal is unreliable. Consequently, we propose the Ultra-Wideband (UWB) network to assist the soft landing of UAM on a vertiport. Since the positioning performance of UWB network depends on the layout of UWB anchors, it is necessary to optimize the layout of UWB anchors. In this paper, we propose a two-steps genetic algorithm that consists of binary genetic algorithm involved multi objectives fitness function and integer genetic algorithm involved robust solution searching fitness function in order to optimize taking into account Fresnel hole effects.

A Characteristic Analysis of Ergonomic Console Layout Studies Using Optimization Techniques

  • Jung, Kihyo;Kim, Jaejung;You, Taekho;Lee, Baekhee;Lee, Wonsup;Park, Seikwon;Roh, Woongseok;You, Heecheon
    • Journal of the Ergonomics Society of Korea
    • /
    • v.31 no.6
    • /
    • pp.733-740
    • /
    • 2012
  • Objective: The present study systematically analyzed the characteristics of ergonomic layout optimization methods by a comprehensive literature survey. Background: Although layout design methods for ergonomic placement of controls and displays on a console have been developed, understanding of their characteristics is lacking. Method: The present study analyzed layout optimization papers published past 20 years from the following four aspects: optimization model, optimization algorithm, design principle, and constraint/assumption. Results: The existing layout optimization methods based on various optimization techniques consider only a partial set of four layout principles(importance, frequency of use, sequence of use, and functional grouping) and two ergonomic criteria(visibility and reach). In addition, the existing methods oversimplify components in various sizes, shapes, and angles by assuming the equality of the components in size and shape. Conclusion: A more effective layout optimization method is needed which considers the layout principles and ergonomic criteria in a comprehensive manner and reflect the diversity of components in size and shape. Application: The identified characteristics on the existing layout optimization methods can be applicable to development of a better ergonomic console layout design method.

Optimal Layout Design of Frequency- and Temperature-Dependent Viscoelastic Materials for Maximum Loss Factor of Constrained-Layer Damping Beam (점탄성 물질의 온도와 주파수 의존성을 고려한 구속형 제진보의 최대 손실계수 설계)

  • Lee, Doo-Ho
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2007.05a
    • /
    • pp.1023-1026
    • /
    • 2007
  • Optimal damping layout of the constrained viscoelastic damping layer on beam is identified with temperatures by using a gradient-based numerical search algorithm. An optimal design problem is defined in order to determine the constrained damping layer configuration. A finite element formulation is introduced to model the constrained damping layer beam. The four-parameter fractional derivative model and the Arrhenius shift factor are used to describe dynamic characteristics of viscoelastic material with respect to frequency and temperature. Frequency-dependent complex-valued eigenvalue problems are solved by using a simple resubstitution algorithm in order to obtain the loss factor of each mode and responses of the structure. The results of the numerical example show that the proposed method can reduce frequency responses of beam at peaks only by reconfiguring the layout of constrained damping layer within a limited weight constraint.

  • PDF

An Initial Placement Algorithm in Layout CAD of Gate Array LSE (Gate Array LSI의 레이아웃 설계에 있어 초기 배치 알고리즘)

  • 정정화
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.21 no.6
    • /
    • pp.85-93
    • /
    • 1984
  • In the paper, a new constructive initial placement algorithm is proposed in computer aided layout design in LSI. An useful object function are proposed to place the modules in logic design diagram laid down by manual to the fixed chip, reflecting the relative positions between modules and cells, and then an initial placement are determined by the function. In order to show the usefulness of the proposed method, it was compared with clustering development method in maximum cut numbers and total routing lengths by program experiments.

  • PDF

Multi-level Building Layout With Dimension Constraints On Departments (형태제약을 가지는 부서의 다층빌딩 설비배치)

  • Chae-Bogk Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.26 no.4
    • /
    • pp.42-49
    • /
    • 2003
  • The branch and bound techniques based on cut tree and eigenvector have been Introduced in the literature [1, 2, 3, 6, 9, 12]. These techniques are used as a basis to allocate departments to floors and then to fit departments with unchangeable dimensions into floors. Grouping algorithms to allocate departments to each floor are developed and branch and bound forms the basis of optimizing using the criteria of rectilinear distance. The proposed branch and bound technique, in theory, will provide the optimal solution on two dimensional layout. 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 and width are fixed and a perfect fit is generated if a fit is possible. Computational results obtained by cut tree-based algorithm and eigenvector-based algorithm are shown when the number of floors are two or three and there is an elevator.