• Journal of the Korea institute for structural maintenance and inspection
• /
• v.9 no.1
• /
• pp.259-269
• /
• 2005

This paper describes the application of genetic algorithm for the discrete optimum design of reinforced concrete continuous beams. The objective is to minimize the total cost of reinforced concrete beams including the costs of concrete, form work, main reinforcement and stirrup. The flexural and shear strength, deflection, crack, spacing of reinforcement, concrete cover, upper-lower bounds on main reinforcement, beam width-depth ratio and anchorage for main reinforcement are considered as the constraints. The width and effective depth of beam and steel area are taken as design variables, and those are selected among the discrete design space which is composed with dimensions and steel area being used from in practice. Optimum result obtained from GA is compared with other literature to verify the validity of GA. To show the applicability and efficiency of GA, it is applied to three and five span reinforced concrete beams satisfying with the Korean standard specifications.

• The Korean Journal of Applied Statistics
• /
• v.9 no.1
• /
• pp.153-164
• /
• 1996

We discussed estimation of parameters using Gibbs sampler under order restriction on the parameters. Two well-knwon probability models, ordered exponential family and binomial distribution, are considered. We derived full conditional distributions(FCD) and also used one-for-one sampling algorithm to sample from the FCD's under order restrictions. Finally through two real data sets we compared three kinds of estimators; isotonic regression estimator, isotonic Bayesian estimator and the estimator using Gibbs sampler.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.68-70
• /
• 1998

본 논문에서는 클록들을 주기적으로 동기화하는 분산 실시간 시스템에서 주어진 태스크의 시간 제약(timing constraint)을 변환시는 구가지 기법을 제안한다. 전형적인 이산 클록 동기화(discrete clock synchronization)알고리즘은 클록의 값을 순간적으로 보정(correct)하여 클록의 시간이 불연속적으로 진행학 한다. 이러한 시간상의 불연속성은 태스크의 시작제한시간(release time)이나 종료시한(deadline)과 같은 이벤트를 잃어버리거나 다시 발생시키는 오류를 범하게 한다. 클록 시간의 불연속성을 피하기 위해 일반적으로 연속 클록 동기화(continuous clock synchronization) 기법이제안되었지만 소프트웨어적으로 구현되기에는 많은 오버헤드를 유발시키는 문제점이 있다. 이에 따라 연속 클록 동기화는 PLL (Phase-Locked Loop)을 이용한 별도의 하드웨어를 사용하는 것이 보통이다. 본 논문에서는 연속 클록 동기화 기법을 사용하는 대신, 태스크의 시간 제약을 동적으로 변환시키는 DCT (Dynamic Constraint Transformation) 기법을 제안하였다. DCT는 소프트웨어 으로 구현이 가능하여 새로운 하드웨어를 필요로 하지 않으며, 이를 통해 기존의 이산적으로 동기화된 시스템에서 클록 시간의 불연속성에 의한 문제점들을 해결할 수 있다. 또 다른 문제점으로서, 클록의 물리적인 특성으로 인해 동기화된 클록들이 상한된(bounded from the above)오차(skew)를 갖는다는 것이다. 이러한 오차는 지역 클록(local clock)에 대해 만족될 수 있는 임의의 실기간 제약 조건이 전역 클록(global clock)에 대해서는 만족되지 않을 수 있음을 의미한다. 본 논문에서는 이를 위해 먼저 두 가지의 스케줄링 가능성, 지역적 스케줄링 가능서(local schedulability)과 전역적 스케줄링 가능성(global schedulability)을 정의하고, 실시간 제약을 정적으로 변환시키는 SCT (Static Constraint Transformation)기법을 제안하였다. SCT를 통해 지역적으로 스케줄링 가능한 태스크는 전역적으로 스케줄링이 가능하므로, 단지 지역적 스케줄링 가능성만을 검사하면서 스케줄링 문제를 해결할 수 있도록 하였다.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2009.04a
• /
• pp.392-395
• /
• 2009

응답면 기법을 활용하여 댐구조물과 같은 사회간접자본 시설물의 파괴확률을 구할 수 있다. 본 위험성 평가과정에서 응답면기법으로 구성한 한계상태 방정식을 유전자알고리즘의 적합도 방정식으로 사용하면, 핵심타입이나 지반종류, 지반다짐정도 등의 입력설계변수의 최적화 과정 속도를 더욱 신속화 시킬 수 있다. 제안된 응답면 기법과 유전자알고리즘의 복합해석기법은 신뢰성기반 최적화프로그램으로 기존의 유전자알고리즘의 수렴속도를 더욱 빠르게 하여주고, 특히 입력변수의 상하한계가 불확실한 경우에도 만족스러운 수렴성을 보장하여준다. 한계상태 방정식의 목표신뢰도 지수를 변화시켜면 해당하는 입력변수의 최적값을 출력하여주므로, 입력변수의 제약조건에 가격함수와 같은 가중치를 벌칙함수로 부여하면 가격최적화 프로그램으로 작용하게 되며, 시설물 운영자에게는 목표신뢰도에 대한 유지관리 기법과 정도를 의사결정 할 수 있도록 하여주는 기능을 가지게 된다. 조사된 많은 댐구조물의 파괴모드가 시간에 독립적으로 시공중 또는 시공완료 후 5년이내에 다수 발생하는바, 파괴모드를 조사하고 중요한 파괴모드인 파이핑 현상에 대해서 파괴확률을 계산하고 최적유지관리를 위한 개선된 유전자알고리즘 최적화 연산을 수행하였다. 기존 댐구조물과 같이 설계변수와 하중의 변동성을 알기가 어려운 경우에 유지관리비용 최소화를 위해서 본 제안 프로그램의 확장된 버젼은 중요한 기준을 제시하여줄 것으로 기대한다.

• Journal of Korean Society of Steel Construction
• /
• v.15 no.2
• /
• pp.197-206
• /
• 2003

The optimal design method in cooperation with a nonlinear elastic analysis method was presented. The proposed nonlinear elastic method overcame the drawback of the conventional LRFD method this approximately accounts for the nonlinear effect caused by using the moment amplification factors of and. The genetic algorithm uses a procedure based on the Darwinian notions of the survival of the fittest, where selection, crossover, and mutation operators are used to look for high performance among the sections of the database. They satisfy constraint functions and give the lightest weight to the structure. The objective function was set to the total weight of the steel structure. The constraint functions were load-carrying capacities, serviceability, and ductility requirement. Case studies for a two-dimensional frame, a three-dimensional frame, and a three-dimensional steel arch bridge were likewise presented.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.101-117
• /
• 2007

In this paper, we propose a customized genetic algorithm (GA) to find the minimum-cost guideway network (GN) of personal rapid transit (PRT) subject to connectivity, reliability, and traffic capacity constraints. PRT is a novel transportation concept, where a number of automated taxi-sized vehicles run on an elevated GN. One of the most important problems regarding PRT is how to design its GN topology for given station locations and the associated inter-station traffic demands. We model the GN as a directed graph, where its cost, connectivity, reliability, and node traffics are formulated. Based on this formulation, we develop the GA with special genetic operators well suited for the GN design problem. Such operators include steady state selection, repair algorithm, and directed mutation. We perform numerical experiments to determine the adequate GA parameters and compare its performance to other optimization algorithms previously reported. The experimental results verify the effectiveness and efficiency of the proposed approach for the GN design problem having up to 210 links.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.2
• /
• pp.169-176
• /
• 2018

In this paper, we consider duty-cycled wireless sensor networks (WSNs) in which sensor nodes are periodically dormant in order to reduce energy consumption. In such networks, as the duty cycle interval increases, the energy consumption decreases. However, a higher duty cycle interval leads to the increase in the end-to-end (E2E) delay. Many applications of WSNs are delay-sensitive and require packets to be delivered from the sensr nodes to the sink with delay requirements. Most of existing studies focus on only reducing the E2E delay, rather than considering the delay bound requirement, which makes hard to achieve the balanced performance between E2E delay and energy consumption. A few study that considered delay bound requirement require time synchronization between neighboring nodes or a specific distribution of deployed nodes. In order to address limitations of existing works, we propose a duty-cycle scheduling algorithm that aims to achieve low energy consumption, while satisfying the delay requirements. To that end, we first estimate the probability distribution for the E2E delay. Then, by using the obtained distribution we determine the maximal duty cycle interval that still satisfies the delay constraint. Simulation results show that the proposed design can satisfy the given delay bound requirements while achieving low energy consumption.

• Journal of Korea Water Resources Association
• /
• v.34 no.5
• /
• pp.567-575
• /
• 2001

A methodology is developed for designing the minimum-cost water distribution network. The method is based on network simulations and an optimization scheme using genetic algorithms. Being a stochastic optimization scheme, genetic algorithms have advantages over the conventional search algorithms in solving network problems known for their nonlinearities and herculean computational costs. While existing methods focus on the design of either entirely new or parallel augmentation of network systems, the proposed method can be applied to problems having both new branches of tree-type and paralle augmentation in loops. The applicability of the method was shown through a case study for Baekryeon water supply system. The optimized design resulted in the maximum 5.37% savings compared to the conventional design without optimization, while meeting the hydraulic constraints.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.151-156
• /
• 2023

This paper deals with the optimization problem that decides the number of advertising for any media among various medium to maximize the perception quality index of new product meets the given budget and over the minimum reached people constraints. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(nlog n)time complexity to solve the optimal solution for this problem. This paper suggests the evaluation index to select the media most economically-efficient way and decides the media and the number of advertisement. While we utilize Excel, the proposed algorithm can be get the same optimal solution as LP for experimental data.

• Journal of Advanced Navigation Technology
• /
• v.21 no.1
• /
• pp.36-42
• /
• 2017

An airport surface movement scheduler using first-come first-served (FCFS) algorithm is developed to efficiently manage surface traffic in an airport. It is based on the previously developed traffic flow management scheduler. Link directionality and intersection processing, which are additional constraints for ground movement, are added to the scheduler. To verify each of additional constraints, several simulations were performed by making simple scenarios, and the results show that all constraints were satisfied. Also, a simulation was performed by making a scenario based on flight operation information system (FOIS) data which is real departure and arrival flight data of Jeju airport. To determine the practicality of the developed scheduler, we compare the actual average delay time with the average delay time calculated by the scheduler.