• Title/Summary/Keyword: Construction Algorithm

Search Result 1,762, Processing Time 0.025 seconds

The Quantification of the Safety Accident of Foreign Workers in the Construction Sites (건설현장 외국인 노동자의 안전사고 예측 방안)

  • Kim, Ji-Myong
    • Korean Journal of Construction Engineering and Management
    • /
    • v.25 no.5
    • /
    • pp.25-31
    • /
    • 2024
  • The purpose of this study is to propose a model development framework to predict the risk of safety accidents for foreign workers based on a deep learning algorithm for systematic safety management of foreign workers in the construction industry. Many past studies have shown that foreign workers working at construction sites are relatively more vulnerable to safety accidents than non-foreign workers, but quantitative research on the risk of safety accidents among foreign workers working at construction sites is lacking. Furthermore, due to a lack of predictive research on safety accidents, realistic and systematic safety management for foreign workers is not possible. Therefore, in order to complement this, this study proposes a deep learning algorithm-based model that collects, analyzes, and predicts safety accident data occurring at construction sites for systematic safety management of foreign workers at construction sites. The results and framework of this study can be used to analyze and predict various safety accident risks that occur at construction sites, and ultimately can serve as an important guideline for safety management of foreign workers at construction sites.

A Study on the Displacement Prediction Method using the Inverse Analysis Algorithm (역해석 알고리즘을 이용한 변위예측 기법에 관한 연구)

  • Park, Hyun-Jung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.4
    • /
    • pp.920-926
    • /
    • 2014
  • In this study, we applieorithmd the inverse analysis alg to the prediction of displacement shape in the example construction and verified the feasibility of suggested algorithm. For this purpose, as information processing knowledge in the field of IT is required and the need for convergence with the major is emerged, it is intended to try to apply the algorithm to the construction sector. Prediction of displacement shape is very important since it is related to the earth pressure of slurry wall and effecting on the safety of slurry wall after anchor removal. 3 levels of inverse analysis were applied to the slurry walls in 3 sites and compared the measured displacement shape with predicted displacement shape of the last excavation construction. As the predicted displacement shape was matched well with the measured one, the applied analysis algorithm in this study can be applied to the excavation construction.

Two Algorithms for Constructing the Voronoi Diagram for 3D Spheres and Applications to Protein Structure Analysis (삼차원 구의 보로노이 다이어그램 계산을 위한 두 가지 알고리듬 및 단백질구조채석에의 응용)

  • Kim D.;Choi Y.;Kim D.S.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.2
    • /
    • pp.97-106
    • /
    • 2006
  • Voronoi diagrams have been known for numerous important applications in science and engineering including CAD/CAM. Especially, the Voronoi diagram for 3D spheres has been known as very useful tool to analyze spatial structural properties of molecules or materials modeled by a set of spherical atoms. In this paper, we present two algorithms, the edge-tracing algorithm and the region-expansion algorithm, for constructing the Voronoi diagram of 3D spheres and applications to protein structure analysis. The basic scheme of the edge-tracing algorithm is to follow Voronoi edges until the construction is completed in O(mn) time in the worst-case, where m and n are the numbers of edges and spheres, respectively. On the other hand, the region-expansion algorithm constructs the desired Voronoi diagram by expanding Voronoi regions for one sphere after another via a series of topology operations, starting from the ordinary Voronoi diagram for the centers of spheres. It turns out that the region-expansion algorithm also has the worst-case time complexity of O(mn). The Voronoi diagram for 3D spheres can play key roles in various analyses of protein structures such as the pocket recognition, molecular surface construction, and protein-protein interaction interface construction.

Case Study for Telecommunication Network Design based on Optimal Path Algorithm (최적경로 알고리듬을 활용한 경제적인 통신망 설계 적용 사례)

  • Jung, Ju-Young;Choi, Yun-Soo;Jun, Chul-Min;Cho, Seong-Kil
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.1 s.16
    • /
    • pp.107-118
    • /
    • 2006
  • In this paper, several network algorithms were tested to find an optimal one for telecommunication network design. Algorithms such as Dijkstra's shortest path algorithm, Ford-Bellman's shortest path algorithm, Prim's minimum spanning tree algorithm, and Kruscal's minimum spanning tree algorithm were reviewed and compared in terms of feasibility and resulted network construction cost. Then an optimal algorithm that is most suitable for telecommunication network design was selected. For more specific and quantitative analysis of the selected algorithm, it was implemented to a real telecommunication network construction site. The analyzed results showed that the suggested design method when compared with the conventional one, reduced the network construction cost considerably. The total network length estimated by the conventional method were 5267 meters while the suggested method resulted in 4807 meters. Thus the new method reduced the total network length by 8.7 percent which is equivalent to 97,469,000 Won of construction cost. Considering the frequent telecommunication network constructions, due to new urban developments in the nation, the economic benefit of the suggested telecommunication network design method will be significant. In addition to the construction cost savings, the suggested telecommunication network design procedure possesses several other economic benefits. Since the design procedure can be standardized and automatized, it can reduce the design cost itself and the skill acquirement periods required for new or inapt design crews. Further, due to the standardized and automatized design procedure, any telecommunication network design results can accessed more objectively.

  • PDF

The Process for Development of the Optimum Layout Model in Slab Formwork of High-rise Building Construction (초고층 건축공사의 바닥거푸집 최적배치 모델 구축 프로세스 연구)

  • Cha, Minsoo;Kim, Taehoon;Cho, Hunhee;Kang, Kyung-In
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2011.05a
    • /
    • pp.171-172
    • /
    • 2011
  • Formwork accounts for a large proportion of the framework in high-rise construction projects in terms of the duration and cost. Especially, slab formwork has a significant influence on these factors. However, the current selection of formwork method in general contractors depends on the decisions of few experienced engineers, and layout planning of the formwork in specialty contractors requires lots of time by different floor types. As a preliminary study for developing an optimum layout model in slab formwork of high-rise building construction, this study proposes the process of the optimum layout model and determines a fitness function for use of the genetic algorithm aimed at table formwork.

  • PDF

Optimum Layout Model of Lift Car for Improving Productivity in High-rise Building Exterior Finishing Work (마감공사 생산성 향상을 위한 리프트 카 최적배치 모델)

  • Lee, Dongmin;Lim, Hyunsu;Kim, Taehoon;Cho, Hunhee;Kang, Kyung-In
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2013.05a
    • /
    • pp.171-172
    • /
    • 2013
  • An operation planning of lift car is crucial in tall building construction especially it's arrangement plans, because it is related with transportation distance of finishing materials affecting construction productivity. Since tall building construction, composed of complicating and huge plane have complex traffic lines of finishing materials, to determine the position of lift car empirically or intuitively has limits. Therefore this paper suggest an optimum layout model of lift car minimizing the transportation distance both at site-level and floor-level using Graph theory and Dijkstra algorithm.

  • PDF

Mobility-Aware Mesh Construction Algorithm for Low Data-Overhead Multicast Ad Hoc Routing

  • Ruiz, Pedro M.;Antonio F., Gomez-Skarmeta
    • Journal of Communications and Networks
    • /
    • v.6 no.4
    • /
    • pp.331-342
    • /
    • 2004
  • We study the problem of controlling data overhead of mesh-based multicast ad hoc routing protocols by adaptively adding redundancy to the minimal data overhead multicast mesh as required by the network conditions. We show that the computation of the minimal data overhead multicast mesh is NP-complete, and we propose an heuristic approximation algorithm inspired on epidemic algorithms. In addition, we propose a mobility-aware and adaptive mesh construction algorithm based on a probabilistic path selection being able to adapt the reliability of the multicast mesh to the mobility of the network. Our simulation results show that the proposed approach, when implemented into ODMRP, is able to offer similar performance results and a lower average latency while reducing data overhead between 25 to 50% compared to the original ODMRP.

Application of genetic Algorithm to the Back Analysis of the Underground Excavation System (지하굴착의 역해석에 대한 유전알고리즘의 적용)

  • 장찬수;김수삼
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2002.10a
    • /
    • pp.65-84
    • /
    • 2002
  • The Observational Method proposed by Terzaghi can be applied for the safe and economic construction projects where the exact prediction of the behavior of the structures is difficult as in the underground excavation. The method consists of measuring lateral displacement, ground settlement and axial force of supports in the earlier stage of the construction and back analysis technique to find the best fit design parameters such as earth pressure coefficient, subgrade reaction etc, which will minimize the gap between calculated displacement and measured displacement. With the results, more reliable prediction of the later stage can be obtained. In this study, back analysis programs using the Direct Method, based on the Hill Climbing Method were made and evaluated, and to overcome the limits of the method, Genetic Algorithm(GA) was applied and tested for the actual construction cases.

  • PDF

Cost optimization of segmental precast concrete bridges superstructure using genetic algorithm

  • Ghiamat, R.;Madhkhan, M.;Bakhshpoori, T.
    • Structural Engineering and Mechanics
    • /
    • v.72 no.4
    • /
    • pp.503-512
    • /
    • 2019
  • The construction of segmental precast concrete bridge is an increase due to its superior performance and economic advantages. This type of bridge is appropriate for spans within 30 to 150 m (100 to 500 ft), known as mega-projects and the design optimization would lead to considerable economic benefits. A box-girder cross section superstructure of balanced cantilever construction method is assessed here. The depth of cross section, (variable along the span linearly), bottom flange thickness, and the count of strands are considered as design variables. The optimum design is characterized by geometry, serviceability, ductility, and ultimate limit states specified by AASHTO. Genetic algorithm (GA) is applied in two fronts: as to the saving in construction cost 8% and as to concrete volume 6%. The sensitivity analysis is run by considering different parameters like span/depth ratio, relation between superstructure cost, span length and concrete compressive strength.

A New Construction of the Irreducible Polynomial for parallel multiplier over GF(2$^{m}$ ) (GF(2$^{m}$ )상에서 병렬 승산기에 대한 기약다항식의 새로운 구성)

  • 문경제;황종학;박승용;김흥수
    • Proceedings of the IEEK Conference
    • /
    • 2003.07c
    • /
    • pp.2617-2620
    • /
    • 2003
  • This paper presents the construction algorithm of the irreducible polynomial which needs to multiply over GF(2$\^$m/) and the flow chart representing the proposed algorithm has been proposed. And also, we get the degree from the value of xm+k formation to the value of k = 7 using the proposed flow chart. The multiplier circuit has been implemented by using the proposed irreducible polynomial generation(IPG) algorithm in this paper, and we compared the proposed circuit with the conventional one. In the case of k = 7, one AND gate and five Ex-or gates are needed as the delay time for the irreducible polynomial in the proposed algorithm, but seven AND gates and sever Ex-or gates in the conventional one. As a result, the proposed algorithm shows the improved performance on the delay time.

  • PDF