• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.9
• /
• pp.1399-1407
• /
• 2004

Structural optimization has been carried out in continuous design space or in discrete design space. Generally, available designs are discrete in design practice. However, the methods for discrete variables are extremely expensive in computational cost. An iterative optimization algorithm is proposed for design in a discrete space, which is called a sequential algorithm using orthogonal arrays (SOA). We demonstrate verifying the fact that a local optimum solution can be obtained from the process with this algorithm. The local optimum solution is defined in a discrete design space. Then the search space, which is a set of candidate values of each design variables formed by the neighborhood of a current design point, is defined. It is verified that a local optimum solution can be found by sequentially moving the search space. The SOA algorithm has been applied to problems such as truss type structures. Then it is confirmed that a local solution can be obtained by using the SOA algorithm

• Structural Monitoring and Maintenance
• /
• v.1 no.4
• /
• pp.427-449
• /
• 2014

A hybrid optimization method for the identification of state-space models is presented in this study. Hybridization is succeeded by combining the advantages of deterministic and stochastic algorithms in a superior scheme that promises faster convergence rate and reliability in the search for the global optimum. The proposed hybrid algorithm is developed by replacing the original stochastic mutation operator of Evolution Strategies (ES) by the Levenberg-Marquardt (LM) quasi-Newton algorithm. This substitution results in a scheme where the entire population cloud is involved in the search for the global optimum, while single individuals are involved in the local search, undertaken by the LM method. The novel hybrid identification framework is assessed through the Monte Carlo analysis of a simulated system and an experimental case study on a shear frame structure. Comparisons to subspace identification, as well as to conventional, self-adaptive ES provide significant indication of superior performance.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.6
• /
• pp.853-866
• /
• 2011

We propose a multi-objective space search algorithm (MSSA) and introduce the identification of fuzzy inference systems based on the MSSA and information granulation (IG). The MSSA is a multi-objective optimization algorithm whose search method is associated with the analysis of the solution space. The multi-objective mechanism of MSSA is realized using a non-dominated sorting-based multi-objective strategy. In the identification of the fuzzy inference system, the MSSA is exploited to carry out parametric optimization of the fuzzy model and to achieve its structural optimization. The granulation of information is attained using the C-Means clustering algorithm. The overall optimization of fuzzy inference systems comes in the form of two identification mechanisms: structure identification (such as the number of input variables to be used, a specific subset of input variables, the number of membership functions, and the polynomial type) and parameter identification (viz. the apexes of membership function). The structure identification is developed by the MSSA and C-Means, whereas the parameter identification is realized via the MSSA and least squares method. The evaluation of the performance of the proposed model was conducted using three representative numerical examples such as gas furnace, NOx emission process data, and Mackey-Glass time series. The proposed model was also compared with the quality of some "conventional" fuzzy models encountered in the literature.

• Structural Engineering and Mechanics
• /
• v.37 no.5
• /
• pp.543-560
• /
• 2011

In structural engineering there are randomness inherently exist on determination of the loads, strength, geometry, and so on, and the manufacturing of the structural members, workmanship etc. Thus, objective and constraint functions of the optimization problem are functions that depend on those randomly natured components. The constraints being the function of the random variables are evaluated by using reliability index or performance measure approaches in the optimization process. In this study, the minimum weight of a space truss is obtained under the uncertainties on the load, material and cross-section areas with harmony search using reliability index and performance measure approaches. Consequently, optimization algorithm produces the same result when both the approaches converge. Performance measure approach, however, is more efficient compare to reliability index approach in terms of the convergence rate and iterations needed.

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.319-326
• /
• 2009

PSO(Particle Swarm Optimization) is an optimization algorithm in which simple particles search an optimal solution using shared information acquired through their own experiences. PSO applications are so numerous and diverse. Lots of researches have been made mainly on the parameter settings, topology, particle's movement in order to achieve fast convergence to proper regions of search space for optimization. In standard PSO, since each particle uses only information of its and best neighbor, swarm does not explore diverse regions and intended to premature to local optima. In this paper, we propose a new particle's movement strategy in order to explore diverse regions of search space. The strategy is that each particle moves according to relative weights of several better neighbors. The strategy of exploring diverse regions is effective and produces less local optimizations and accelerating of the optimization speed and higher success rates than standard PSO. Also, in order to raise success rates, we propose a strategy for checking whether swarm falls into local optimum. The new PSO algorithm with these two strategies shows the improvement in the search speed and success rate in the test of benchmark functions.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.131-136
• /
• 1990

In this paper, new methods are proposed which speed up the logical redundancy identification for the gate-level logic optimization. Redundancy indentification, as well as deterministic test pattern generation, can be viewed as a finite space search problem, of which execution time depends on the size of the search space. For the purpose of efficient search, we propose dynamic head line and mandatory assignment. Dynamic head lines are changed dynamically in the process of the redundancy identification. Mandatory assignement can avoid unnecessary assignment. They can reduce the search size efficiently. Especially they can be used even though the circuit is modified in the optimization procedure, that is different from the test pattern generation methods. Some experimental results are presented indicating that the proposed methods are faster than existing methods.

• Smart Structures and Systems
• /
• v.25 no.3
• /
• pp.345-368
• /
• 2020

The present work proposes a self-controlled multi-stage optimization method for damage identification of structures utilizing standard particle swarm optimization (PSO) algorithm. Damage identification problem is formulated as an inverse optimization problem where damage severity in each element of the structure is considered as optimization variables. An efficient objective function is formed using the first few frequencies and mode shapes of the structure. This objective function is minimized by a self-controlled multi-stage strategy to identify and quantify the damage extent of the structural members. In the first stage, standard PSO is utilized to get an initial solution to the problem. Subsequently, the algorithm identifies the most damage-prone elements of the structure using an adaptable threshold value of damage severity. These identified elements are included in the search space of the standard PSO at the next stage. Thus, the algorithm reduces the dimension of the search space and subsequently increases the accuracy of damage prediction with a considerable reduction in computational cost. The efficiency of the proposed method is investigated and compared with available results through three numerical examples considering both with and without noise. The obtained results demonstrate the accuracy of the present method can accurately estimate the location and severity of multi-damage cases in the structural systems with less computational cost.

• Smart Media Journal
• /
• v.9 no.4
• /
• pp.36-43
• /
• 2020

The Monte Carlo tree search (MCTS) is a popular method for implementing an intelligent game program. It has several hyper-parameters that require an optimization for showing the best performance. Due to the stochastic nature of the MCTS, the hyper-parameter optimization is difficult to solve. This paper uses the self-playing capability of the MCTS-based game program for optimizing the hyper-parameters. It seeks a winner path over the hyper-parameter space while performing the self-play. The top-q longest winners in the winner path compete for the final winner. The experiment using the 15-15-5 game (Omok in Korean name) showed a promising result.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.111-113
• /
• 2006

DEAS is an direct searching and optimization method that based on the binary code space. It can be classified as an direct hill climbing searching. However, because of binary code space based searching, the searching in low resolution has random property. As the resolution of code increases during the search, its property of searching changes like that of hill climbing search. This paper propose a method for improving the performance of minimum seeking ability of DEAS with history information. The cost evaluation is increased. However the minimum searching ability of DEAS is improved along the same starting resolution.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.6
• /
• pp.987-992
• /
• 2002

In an attempt to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands the user to have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Pareto-optimal points, instead of a single point. In this paper, pareto-based Continuous Evolutionary Algorithms for Multiobjective Optimization problems having continuous search space are introduced. This algorithm is based on Continuous Evolutionary Algorithms to solve single objective optimization problems with a continuous function and continuous search space efficiently. For multiobjective optimization, a progressive reproduction operator and a niche-formation method fur fitness sharing and a storing process for elitism are implemented in the algorithm. The operator and the niche formulation allow the solution set to be distributed widely over the Pareto-optimal tradeoff surface. Finally, the validity of this method has been demonstrated through a numerical example.