• Title/Summary/Keyword: Optimal candidate

Search Result 380, Processing Time 0.031 seconds

Fast Dynamic Reliability Estimation Approach of Seismically Excited SDOF Structure (지진하중을 받는 단자유도 구조물의 신속한 동적 신뢰성 추정 방법)

  • Lee, Do-Geun;Ok, Seung-Yong
    • Journal of the Korean Society of Safety
    • /
    • v.35 no.5
    • /
    • pp.39-48
    • /
    • 2020
  • This study proposes a fast estimation method of dynamic reliability indices or failure probability for SDOF structure subjected to earthquake excitations. The proposed estimation method attempts to derive coefficient function for correcting dynamic effects from static reliability analysis in order to estimate the dynamic reliability analysis results. For this purpose, a total of 60 cases of structures with various characteristics of natural frequency and damping ratio under various allowable limits were taken into account, and various types of approximation coefficient functions were considered as potential candidate models for dynamic effect correction. Each reliability index was computed by directly performing static and dynamic reliability analyses for the given 60 cases, and nonlinear curve fittings for potential candidate models were performed from the computed reliability index data. Then, the optimal estimation model was determined by evaluating the accuracy of the dynamic reliability analysis results estimated from each candidate model. Additional static and dynamic reliability analyses were performed for new models with different characteristics of natural frequency, damping ratio and allowable limit. From these results, the accuracy and numerical efficiency of the optimal estimation model were compared with the dynamic reliability analysis results. As a result, it was confirmed that the proposed model can be a very efficient tool of the dynamic reliability estimation for seismically excited SDOF structure since it can provide very fast and accurate reliability analysis results.

Optimal sensor placements for system identification of concrete arch dams

  • Altunisik, Ahmet Can;Sevim, Baris;Sunca, Fezayil;Okur, Fatih Yesevi
    • Advances in concrete construction
    • /
    • v.11 no.5
    • /
    • pp.397-407
    • /
    • 2021
  • This paper investigates the optimal sensor placements and capabilities of this procedure for dynamic characteristics identification of arch dams. For this purpose, a prototype arch dam is constructed in laboratory conditions. Berke arch dam located on the Ceyhan River in city of Osmaniye is one of the highest arch dam constructed in Turkey is selected for field verification. The ambient vibration tests are conducted using initial candidate sensor locations at the beginning of the study. Enhanced Frequency Domain Decomposition and Stochastic Subspace Identification methods are used to extract experimental dynamic characteristics. Then, measurements are repeated according to optimal sensor locations of the dams. These locations are specified using the Effective Independence Method. To determine the optimal sensor locations, the target mode shape matrices which are obtained from ambient vibration tests of the selected dam with a large number of accelerometers are used. The dynamic characteristics obtained from each ambient vibrations tests are compared with each other. It is concluded that the dynamic characteristics obtained from initial measurements and those obtained from a limited number of sensors are compatible with each other. This situation indicates that optimal sensor placements determined by the Effective Independence Method are useful for dynamic characteristics identification of arch dams.

Optimal Design of Truss Structures by Resealed Simulated Annealing

  • Park, Jungsun;Miran Ryu
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.9
    • /
    • pp.1512-1518
    • /
    • 2004
  • Rescaled Simulated Annealing (RSA) has been adapted to solve combinatorial optimization problems in which the available computational resources are limited. Simulated Annealing (SA) is one of the most popular combinatorial optimization algorithms because of its convenience of use and because of the good asymptotic results of convergence to optimal solutions. However, SA is too slow to converge in many problems. RSA was introduced by extending the Metropolis procedure in SA. The extension rescales the state's energy candidate for a transition before applying the Metropolis criterion. The rescaling process accelerates convergence to the optimal solutions by reducing transitions from high energy local minima. In this paper, structural optimization examples using RSA are provided. Truss structures of which design variables are discrete or continuous are optimized with stress and displacement constraints. The optimization results by RSA are compared with the results from classical SA. The comparison shows that the numbers of optimization iterations can be effectively reduced using RSA.

Optimal Allocation Model for Ballistic Missile Defense System by Simulated Annealing Algorithm (탄도미사일 방어무기체계 배치모형 연구)

  • Lee, Sang-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.1020-1025
    • /
    • 2005
  • The set covering(SC) problem has many practical application of modeling not only real world problems in civilian but also in military. In this paper we study optimal allocation model for maximizing utility of consolidating old fashioned and new air defense weapon system like Patriot missile and develop the new computational algorithm for the SC problem by using simulated annealing(SA) algorithm. This study examines three different methods: 1) simulated annealing(SA); 2) accelerated simulated annealing(ASA); and 3) selection by effectiveness degree(SED) with SA. The SED is adopted as an enhanced SA algorithm that the neighboring solutions could be generated only in possible optimal feasible region at the PERTURB function. Furthermore, we perform various experiments for both a reduced and an extended scale sized situations depending on the number of customers(protective objective), service(air defense), facilities(air defense artillery), threat, candidate locations, and azimuth angles of Patriot missile. Our experiment shows that the SED obtains the best results than others.

  • PDF

Optimal Control for Proximity Operations and Docking

  • Lee, Dae-Ro;Pernicka, Henry
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.11 no.3
    • /
    • pp.206-220
    • /
    • 2010
  • This paper proposes optimal control techniques for determining translational and rotational maneuvers that facilitate proximity operations and docking. Two candidate controllers that provide translational motion are compared. A state-dependent Riccati equation controller is formulated from nonlinear relative motion dynamics, and a linear quadratic tracking controller is formulated from linearized relative motion. A linear quadratic Gaussian controller using star trackers to provide quaternion measurements is designed for precision attitude maneuvering. The attitude maneuvers are evaluated for different final axis alignment geometries that depend on the approach distance. A six degrees-of-freedom simulation demonstrates that the controllers successfully perform proximity operations that meet the conditions for docking.

Decision Making on Bus Splitting Locations Using a Modified Fault Current Constrained Optimal Power Flow (FCC-OPF)

  • Song, Hwachang;Vovos, Panagis N.;Cho, Kang-Wook;Kim, Tae-Sun
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.1
    • /
    • pp.76-85
    • /
    • 2016
  • This paper presents a method of decision on where bus splitting is needed to reduce fault current level of power systems and to satisfy the fault current constraints. The method employs a modified fault current constrained optimal power flow (FCC-OPF) with X variables for the candidate locations of splitting and for decision making on whether to split or not, it adopts soft-discretization by augmenting inversed U-shaped penalty terms. Also, this paper discusses the procedure on the adequate selection of bus splitting locations based on the results of the modified FCC-OPF, to reduce the total number of the actions taken.

An Exact Algorithm for the Asymmetrical Vehicle Routing Problem (차량경로문제에 대한 최적해법)

  • 송성헌;박순달
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.12 no.1
    • /
    • pp.34-44
    • /
    • 1987
  • The general vehicle routing problem has been studied by many researchers such as Christofides, et al. and Laporte, et al., but only limited effort has been devoted to developing the optimal algorithms. The purpose of this paper is to develop a branch and bound algorithm which determines the optimal vechicle routes and the optimal number of vehicles concurrenetly for the asymmetrical vehicle routing problem. In order to enhance the efficiency, this algorithm emphasizes the followings ; First, an efficient primal-dual approach is developed to solve subproblems which are called the specialized transportation problem, formed by relaxing the illegal subtour constraints from the vehicle routing problem, second, an improved branching scheme is developed to reduce the number of candidate subproblems by adequate utilization of vehicle capacity restrictions.

  • PDF

Using Genetic-Fuzzy Methods To Develop User-preference Optimal Route Search Algorithm

  • Choi, Gyoo-Seok;Park, Jong-jin
    • The Journal of Information Technology and Database
    • /
    • v.7 no.1
    • /
    • pp.42-53
    • /
    • 2000
  • The major goal of this research is to develop an optimal route search algorithm for an intelligent route guidance system, one sub-area of ITS. ITS stands for intelligent Transportation System. ITS offers a fundamental solution to various issues concerning transportation and it will eventually help comfortable and swift moves of drivers by receiving and transmitting information on humans, roads and automobiles. Genetic algorithm, and fuzzy logic are utilized in order to implement the proposed algorithm. Using genetic algorithm, the proposed algorithm searches shortest routes in terms of travel time in consideration of stochastic traffic volume, diverse turn constraints, etc. Then using fuzzy logic, it selects driver-preference optimal route among the candidate routes searched by GA, taking into account various driver's preferences such as difficulty degree of driving and surrounding scenery of road, etc. In order to evaluate this algorithm, a virtual road-traffic network DB with various road attributes is simulated, where the suggested algorithm promptly produces the best route for a driver with reference to his or her preferences.

  • PDF

Optimization of Multiple Tower Cranes and Material Stockyards Layout (다중 양중장비와 자재 야적 위치의 최적 결정을 위한 모델 개발)

  • Kim, Kyong-Ju;Kim, Kyoung-Min;Lee, Sang-Kyu
    • Korean Journal of Construction Engineering and Management
    • /
    • v.10 no.6
    • /
    • pp.127-134
    • /
    • 2009
  • This study aims to provide an optimal model for the layout of multiple tower cranes and material stockyards which have multiple candidate positions. In a high-rise building construction, the positional allocation of tower cranes and material stockyard has an effect on the travel time of material hauling. In addition, in case of using multiple tower cranes, specific location of a tower crane allocated to each material determines the efficiency of the works. Current optimal model limited to the optimization of position of single tower crane and material stockyards. This study suggests optimal model both for the positions of multiple tower cranes and material stockyards. Layout of multiple tower cranes requires additional allocation of each crane to each material hauling and control on the minimum distance between tower cranes. This optimization model utilizes genetic algorithm to deal with complex interaction on the candidate positions of multiple tower cranes, material stockyards, and types of materials. In order to identify its utility, case study was performed.

Fast Motion Estimation Algorithm using Filters of Multiple Thresholds (다중 문턱치 필터를 이용한 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.19 no.4
    • /
    • pp.199-205
    • /
    • 2018
  • So many fast motion estimation algorithms for prediction quality and computational reduction have been published due to tremendous computations of full search algorithm. In the paper, we suggest an algorithm that reduces computation effectively, while keeping prediction quality as almost same as that of the full search. The proposed algorithm based on multiple threshold filter calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, removes impossible candidates, and calculates optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain the better performance of calculation speed by reducing unnecessary computations. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.