• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1999년도 가을 학술발표회 논문집
• /
• pp.333-342
• /
• 1999

An improved optimization algorithm for multi-objective and multi-level (MO/ML) optimum design of steel frames is proposed in this paper. In order to optimize the steel frames under seismic load, two main objective functions need to be considered for minimizing the structural weight and maximizing the strain energy. For the efficiency of the proposed method, well known multi-level optimization techniques using decomposition method that separately utilizes both system-level and element-level optimizations and an artificial constraint deletion technique are incorporated in the algorithm. And also dynamic analysis is executed to evaluate the implicit function of structural strain energy at each iteration step. To save the numerical efforts, an efficient reanalysis technique through sensitivity analysis of dynamic properties is unposed in the paper. The efficiency and robustness of the improved MOML algorithm, compared with a plain MOML algorithm, is successfully demonstrated in the numerical examples.

• Smart Structures and Systems
• /
• 제21권2호
• /
• pp.235-248
• /
• 2018

An efficient method utilizing the multi-stage improved differential evolution algorithm (MSIDEA) as an optimization solver is presented here to detect the multiple-damage of structural systems. Natural frequency changes of a structure are considered as a criterion for damage occurrence. The structural damage detection problem is first transmuted into a standard optimization problem dealing with continuous variables, and then the MSIDEA is utilized to solve the optimization problem for finding the site and severity of structural damage. In order to assess the performance of the proposed method for damage identification, an experimental study and two numerical examples with considering measurement noise are considered. All the results demonstrate the effectiveness of the proposed method for accurately determining the site and severity of multiple-damage. Also, the performance of the MSIDEA for damage detection compared to the standard differential evolution algorithm (DEA) is confirmed by test examples.

• 수산해양교육연구
• /
• 제29권2호
• /
• pp.544-551
• /
• 2017

Metaheuristic algorithms are efficient techniques for a class of mathematical optimization problems without having to deeply adapt to the inherent nature of each problem. They are very useful for structural design optimization in which the cost of gradient computation can be very expensive. Among them, the characteristics of simulated annealing and genetic algorithms are briefly discussed. In Metropolis genetic algorithm, favorable features of Metropolis criterion in simulated annealing are incorporated in the reproduction operations of simple genetic algorithm. Numerical examples of structural design optimization are presented. The example structures are truss, breakwater and steel box girder bridge. From the theoretical evaluation and numerical experience, performance and applicability of metaheuristic algorithms for structural design optimization are discussed.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 추계학술대회 논문집 전력기술부문
• /
• pp.79-81
• /
• 2003

This paper presents development and testing of a new numerical spectral domain algorithm devoted to blocking unsuccessful automatic reclosing onto permanent faults and the fault distance calculation. The arc voltage amplitude and the fault distance are calculated from the fundamental and third harmonics of the terminal voltages and currents phasors. From the calculated arc voltage amplitude it can be concluded if the fault is transient arcing fault or permanent arcless fault. If the fault is permanent automatic reclosure should be blocked. The algorithm can be applied for adaptive autoreclosure, distance protection, and fault location. The results of algorithm testing through computer simulation are given.

• 한국해양공학회지
• /
• 제19권1호
• /
• pp.64-70
• /
• 2005

Target Strength(TS) is an important factor for the detection of the target in an active sonar system: thus the numerical model for the prediction of TS is widely being developed. For the frequency range of several kHz, the most important scattering mechanism is known to be specular reflection, which is largely affected by the geometrical shape of the target. In this paper, a numerical algorithm to predict TS is developed based on the Kirchhoff approximation which is computationally efficient. The developed algorithm is applied to the canonical targets of simple shapes, for which the analytical solutions exist. The numerical results show good agreement with the analytical solutions. Also, the algorithm is applied to more complex scatterers, and is compared with the experimental data obtained in the water tank experiment for the purpose of verifying the developed numerical model. Discussions on the effect of spatial sampling and other aspects of numerical m odeling are presented.

• 충청수학회지
• /
• 제37권1호
• /
• pp.41-55
• /
• 2024

The nonconvex and nonsmooth optimization problem has been widely applicable in image processing and machine learning. In this paper, we propose an extension of the proximal iteratively reweighted ℓ₁ algorithm for nonconvex and nonsmooth minmization problem. We assume the co-coerciveness of a term of objective function instead of Lipschitz gradient condition, which is generalized property of Lipschitz continuity. We prove the global convergence of the proposed algorithm. Numerical results show that the proposed algorithm converges faster than original proximal iteratively reweighed algorithm and existing algorithms.

• Journal of applied mathematics & informatics
• /
• 제2권1호
• /
• pp.41-58
• /
• 1995

When F(χ)=0 is a system of nonlinear equations, we have established the parametrizied Homotopy algorithm for solving F(χ)=0 and some theorems for algorithm have been obtained.

• 한국국방경영분석학회지
• /
• 제8권2호
• /
• pp.31-35
• /
• 1982

Recently, Park [1] proposed an algorithm for the optimum spare-part stock level in an (S-1, S) inventory system for small fleet. This paper reports validative GPSS simulation results and numerical experiences with the algorithm.

• 산업경영시스템학회지
• /
• 제19권40호
• /
• pp.137-142
• /
• 1996

An algorithm for solving the cardinality constrained linear programming knapsack problem is presented. The algorithm has a convenient structure for a branch-and-bound approach to the integer version, especially to the 0-1 collapsing knapsack problem. A numerical example is given.

• 대한전기학회논문지:전력기술부문A
• /
• 제54권11호
• /
• pp.525-532
• /
• 2005

This paper presents a new two-terminal numerical algorithm for fault location estimation and for faults recognition using the synchronized phaser in time-domain. The proposed algorithm is also based on the synchronized voltage and current phasor measured from the assumed PMUs(Phasor Measurement Units) installed at both ends of the transmission lines. Also the arc voltage wave shape is modeled numerically on the basis of a great number of arc voltage records obtained by transient recorder. From the calculated arc voltage amplitude it can make a decision whether the fault is permanent or transient. In this paper the algorithm is given and estimated using DFT(discrete Fourier Transform) and the LES(Least Error Squares Method). The algorithm uses a very short data window and enables fast fault detection and classification for real-time transmission line protection. To test the validity of the proposed algorithm, the Electro-Magnetic Transient Program(EMTP/ATP) is used.