• Title/Summary/Keyword: Global Updating

Search Result 71, Processing Time 0.023 seconds

Finite element model updating of a cable-stayed bridge using metaheuristic algorithms combined with Morris method for sensitivity analysis

  • Ho, Long V.;Khatir, Samir;Roeck, Guido D.;Bui-Tien, Thanh;Wahab, Magd Abdel
    • Smart Structures and Systems
    • /
    • v.26 no.4
    • /
    • pp.451-468
    • /
    • 2020
  • Although model updating has been widely applied using a specific optimization algorithm with a single objective function using frequencies, mode shapes or frequency response functions, there are few studies that investigate hybrid optimization algorithms for real structures. Many of them did not take into account the sensitivity of the updating parameters to the model outputs. Therefore, in this paper, optimization algorithms and sensitivity analysis are applied for model updating of a real cable-stayed bridge, i.e., the Kien bridge in Vietnam, based on experimental data. First, a global sensitivity analysis using Morris method is employed to find out the most sensitive parameters among twenty surveyed parameters based on the outputs of a Finite Element (FE) model. Then, an objective function related to the differences between frequencies, and mode shapes by means of MAC, COMAC and eCOMAC indices, is introduced. Three metaheuristic algorithms, namely Gravitational Search Algorithm (GSA), Particle Swarm Optimization algorithm (PSO) and hybrid PSOGSA algorithm, are applied to minimize the difference between simulation and experimental results. A laboratory pipe and Kien bridge are used to validate the proposed approach. Efficiency and reliability of the proposed algorithms are investigated by comparing their convergence rate, computational time, errors in frequencies and mode shapes with experimental data. From the results, PSO and PSOGSA show good performance and are suitable for complex and time-consuming analysis such as model updating of a real cable-stayed bridge. Meanwhile, GSA shows a slow convergence for the same number of population and iterations as PSO and PSOGSA.

CMAC Neuro-Fuzzy Design for Color Calibration (컬러재현을 위한 CMAC의 뉴로퍼지 설계)

  • 이철희;변오성;문성룡;임기영
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2001.05a
    • /
    • pp.97-100
    • /
    • 2001
  • CMAC model was proposed by Albus [6] to formulate the processing characteristics of the human cerebellum. Instead of the global weight updating scheme used in the back propagation, CMAC use the local weight updating scheme. Therefore, CMAC have the advantage of fast learning and high convergence rate. In this paper, simulate Color Calibration by CMAC in color images and design hardware by VHDL-base high-level synthesis.

  • PDF

Vibration based damage detection in a scaled reinforced concrete building by FE model updating

  • Turker, Temel;Bayraktar, Alemdar
    • Computers and Concrete
    • /
    • v.14 no.1
    • /
    • pp.73-90
    • /
    • 2014
  • The traditional destructive tests in damage detection require high cost, long consuming time, repairing of damaged members, etc. In addition to these, powerful equipments with advanced technology have motivated development of global vibration based damage detection methods. These methods base on observation of the changes in the structural dynamic properties and updating finite element models. The existence, location, severity and effect on the structural behavior of the damages can be identified by using these methods. The main idea in these methods is to minimize the differences between analytical and experimental natural frequencies. In this study, an application of damage detection using model updating method was presented on a one storey reinforced concrete (RC) building model. The model was designed to be 1/2 scale of a real building. The measurements on the model were performed by using ten uni-axial seismic accelerometers which were placed to the floor level. The presented damage identification procedure mainly consists of five steps: initial finite element modeling, testing of the undamaged model, finite element model calibration, testing of the damaged model, and damage detection with model updating. The elasticity modulus was selected as variable parameter for model calibration, while the inertia moment of section was selected for model updating. The first three modes were taken into consideration. The possible damaged members were estimated by considering the change ratio in the inertia moment. It was concluded that the finite element model calibration was required for structures to later evaluations such as damage, fatigue, etc. The presented model updating based procedure was very effective and useful for RC structures in the damage identification.

Efficient Path Search Method using Ant Colony System in Traveling Salesman Problem (순회 판매원 문제에서 개미 군락 시스템을 이용한 효율적인 경로 탐색)

  • 홍석미;이영아;정태충
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.9
    • /
    • pp.862-866
    • /
    • 2003
  • Traveling Salesman Problem(TSP) is a combinational optimization problem, Genetic Algorithm(GA) and Lin-Kernighan(LK) Heuristic[1]that is Local Search Heuristic are one of the most commonly used methods to resolve TSP. In this paper, we introduce ACS(Ant Colony System) Algorithm as another approach to solve TSP and propose a new pheromone updating method. ACS uses pheromone information between cities in the Process where many ants make a tour, and is a method to find a optimal solution through recursive tour creation process. At the stage of Global Updating of ACS method, it updates pheromone of edges belonging to global best tour of created all edge. But we perform once more pheromone update about created all edges before global updating rule of original ACS is applied. At this process, we use the frequency of occurrence of each edges to update pheromone. We could offer stochastic value by pheromone about each edges, giving all edges' occurrence frequency as weight about Pheromone. This finds an optimal solution faster than existing ACS algorithm and prevent a local optima using more edges in next time search.

Numerical Verification of Hybrid Optimization Technique for Finite Element Model Updating (유한요소모델개선을 위한 하이브리드 최적화기법의 수치해석 검증)

  • Jung, Dae-Sung;Kim, Chul-Young
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.10 no.6 s.52
    • /
    • pp.19-28
    • /
    • 2006
  • Most conventional model updating methods must use mathematical objective function with experimental modal matrices and analytical system matrices or must use information about the gradient or higher derivatives of modal properties with respect to each updating parameter. Therefore, most conventional methods are not appropriate for complex structural system such as bridge structures due to stability problem in inverse analysis with ill-conditions. Sometimes, moreover, the updated model may have no physical meaning. In this paper, a new FE model updating method based on a hybrid optimization technique using genetic algorithm (GA) and Holder-Mead simplex method (NMS) is proposed. The performance of hybrid optimization technique on the nonlinear problem is demonstrated by the Goldstein-Price function with three local minima and one global minimum. The influence of the objective function is evaluated by the case study of a simulated 10-dof spring-mass model. Through simulated case studies, finally, the objective function is proposed to update mass as well as stiffness at the same time. And so, the proposed hybrid optimization technique is proved to be an efficient method for FE model updating.

Ant Colony System Considering the Iteration Search Frequency that the Global Optimal Path does not Improved (전역 최적 경로가 향상되지 않는 반복 탐색 횟수를 고려한 개미 집단 시스템)

  • Lee, Seung-Gwan;Lee, Dae-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.1
    • /
    • pp.9-15
    • /
    • 2009
  • Ant Colony System is new meta heuristic for hard combinatorial optimization problem. The original ant colony system accomplishes a pheromone updating about only the global optimal path using global updating rule. But, If the global optimal path is not searched until the end condition is satisfied, only pheromone evaporation happens to no matter how a lot of iteration accomplishment. In this paper, the length of the global optimal path does not improved within the limited iterations, we evaluates this state that fall into the local optimum and selects the next node using changed parameters in the state transition rule. This method has effectiveness of the search for a path through diversifications is enhanced by decreasing the value of parameter of the state transition rules for the select of next node, and escape from the local optima is possible. Finally, the performance of Best and Average_Best of proposed algorithm outperforms original ACS.

Presenting a map on global positioning system (GSP의 화면 표시 방식에 관한 연구)

  • 김병주;남기원;박재호;한승아;한성호
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.395-398
    • /
    • 1996
  • A Global Positioning System(GPS) in an automobile can provide navigational information for identifying the current location of the automobile and helping the drive determine a desirable route to the destination. Usefulness of such a system depends on many design factors. This study examined two critical design factors from a human factors standpoint. The rotation methods and updating schemes of a map were manipulated in a simulated driving environment. Design guidelines are suggested based on the experimental results.

  • PDF

CMAC Neuro-Fuzzy Design for Color Calibration (컬러재현을 위한 CMAC의 뉴로퍼지 설계)

  • 이철희;변오성;문성룡;임기영
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.4
    • /
    • pp.331-335
    • /
    • 2001
  • Cl\iAC model was proposed by Albus [6J to formulate the processing characteristics of the human cerebellum. Instead of the global weight updating scheme used in the back propagation, CMAC use the local weight updating scheme. Therefore, CMAC have the advantage of fast learning and high convergence rate. In this paper, simulate Color Calibration by CMAC in color images and design hardware by VHDL-base high-level synthesis.

  • PDF

The Ground Vibration Test on an Aircraft and FE Model Update (항공기 지상 진동 시험 및 동특성 모델의 개선)

  • 유홍주;변관화;박금룡
    • Journal of KSNVE
    • /
    • v.8 no.4
    • /
    • pp.690-699
    • /
    • 1998
  • This paper discusses the techniques, procedures and the results of the ground vibration test(GVT) performed on the development aircraft and the simple procedure of FE model updating technique from the GVT results. The GVT was carried out using random excitation technique with MIMO(Multi-Input-Multi-Output) data acquistion method, and taking full advantage of poly-reference global parameter estimation technique to identify the vibration modes. In dynamic FE modeling, the aircraft was represented by beam elements and all dynamic analysis was performed using MSC/NASTRAN for this model. In updating procedure, the stiffness of the beam model was adjusted iteratively so as to get the natural frequencies and mode shapes close to the GVT results.

  • PDF

Efficient Adaptive Global Optimization for Constrained Problems (구속조건이 있는 문제의 적응 전역최적화 효율 향상에 대한 연구)

  • Ahn, Joong-Ki;Lee, Ho-Il;Lee, Sung-Mhan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.38 no.6
    • /
    • pp.557-563
    • /
    • 2010
  • This paper addresses the issue of adaptive global optimization using Kriging metamodel known as EGO(Efficient Global Optimization). The algorithm adaptively chooses where to generate subsequent samples based on an explicit trade-off between reduction of global uncertainty and exploration of the region of the interest. A strategy that saves the computational cost by using expectations derived from probabilistic nature of approximate model is proposed. At every iteration, a candidate test point that seems to be feasible/inactive or has little possibility to improve for minimum is identified and excluded from updating approximate models. By doing that the computational cost is saved without loss of accuracy.