• Proceedings of the KIEE Conference
• /
• 1994.11a
• /
• pp.408-410
• /
• 1994

This Paper Presents a learning strategy for neural networks based on genetic algorithms and evolution strategies. Genetic algorithms and evolution strategies are used to train weights of feedforward neural network to solve problems faster than neural network, especially backpropagation. Simulations are performed exclusive-OR problem, full-adder problem, sine function generator to demonstrate the effectiveness of neural-GA-ES.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.05a
• /
• pp.77-81
• /
• 2003

SDM (Structural Dynamics Modification) is a tool to improve dynamic characteristics of a structure, more specifically of a base structure, by adding or deleting auxiliary (modifying) structures. In this paper, the goal of the optimal SDM is set to maximize the natural frequency of a base plate structure by attaching serially-connected beam stiffeners. The design variables are chosen as positions of the attaching beam stiffeners, where the number of stiffeners is considered as a design space. The problem of non-matching interface nodes between the base plate and beam stiffeners is solved by using localized Lagrange multipliers, which act to glue the two structures with non-matching interface nodes. As fer the cases of non-matching interface nodes problem, the governing equation of motion of a structure can be considered from the viewpoint of a topological modification, which involves the change of the number of structural members and DOFs. Consequently, the eigenpairs of the beam-stiffened plate structure are obtained by using an eigen reanalysis technique of topological modifications. Evolution Strategies (ES), which is a probabilistic population-based optimization technique that mimics the principles from biological evolution in nature, is utilized as a mean for the optimization.

• Advances in Computational Design
• /
• v.1 no.4
• /
• pp.315-327
• /
• 2016

Damage detection and localisation in structures is essential since it can be a means for preventive maintenance of those structures under service conditions. The use of structural modal data for detecting the damage is one of the most efficient methods. This paper presents comparative performance of various state-of-the-art meta-heuristics for use in structural damage detection based on changes in modal data. The metaheuristics include differential evolution (DE), artificial bee colony algorithm (ABC), real-code ant colony optimisation (ACOR), charged system search (ChSS), league championship algorithm (LCA), simulated annealing (SA), particle swarm optimisation (PSO), evolution strategies (ES), teaching-learning-based optimisation (TLBO), adaptive differential evolution (JADE), evolution strategy with covariance matrix adaptation (CMAES), success-history based adaptive differential evolution (SHADE) and SHADE with linear population size reduction (L-SHADE). Three truss structures are used to pose several test problems for structural damage detection. The meta-heuristics are then used to solve the test problems treated as optimisation problems. Comparative performance is carried out where the statistically best algorithms are identified.

• Special Issue of the Society of Naval Architects of Korea
• /
• 2005.06a
• /
• pp.63-68
• /
• 2005

Optimum design of the big brackets is performed through iterated 3-D FE analyses to meet the permissible limits of stress, which consumes an excessive amount of calculation time. Therefore, this study has been prepared to determine rapidly and accurately an optimum size and scantling of the big brackets at the initial design stage. The generalized slope deflection method (GSDM) based on the span point concept is applied to enhance the efficiency of iterated structural analyses. The accuracy and applicability of the present method is verified by comparing with a detail 3-D FE analysis of web frame structures. As an optimization technique, evolution strategies (ES) are applied using discrete design variables for practical design.

• Journal of the Society of Naval Architects of Korea
• /
• v.40 no.6
• /
• pp.12-19
• /
• 2003

Corrugated bulkheads for a bulk carrier are divided into watertight bulkheads and deep tank bulkheads. Design of the watertight bulkheads is principally determined by the permissible limit of Classification and IACS requirements. But, the verification of strength through finite element analysis is indispensable for design of the deep tank bulkheads. A stage for stress evaluation of corrugated part is required for optimum structural design of the deep tank bulkheads. Since the finite element analysis for real model requires excessive amount of calculation time, in this study one corrugated structure is replaced with beam element and is idealized as 2 dimensional frame structure connected to upper and lower stool Minimum weight design of the deep tank bulkheads is performed through generalized sloped deflection method(GSDM) as direct calculation method. The purpose of this study is the development of design system for the minimization of steel weight of deep tank bulkheads as well as watertight bulkheads. Discrete variables are used as design variables for the practical design. Evolution strategies(ES) is used as an optimization technique.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.33.1-33
• /
• 2001

We address a novel approach to identify a nonlinear dynamic system for Wiener models, which are composed of a linear dynamic system part followed by a nonlinear static part. The aim of system identification here is to provide the optimal mathematical model of both the linear dynamic and the nonlinear static parts in some appropriate sense. Assuming the nonlinear static part is invertible, we approximate the inverse function by a piecewise linear function. We estimate the piecewise linear inverse function by using the evolutionary computation approach such as genetic algorithm (GA) and evolution strategies (ES), while we estimate the linear dynamic system part by the least squares method. The results of numerical simulation studies indicate the usefulness of proposed approach to the Wiener model identification.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1269-1271
• /
• 1996

This paper presents a visual servoing combined by evolutionary algorithms and neural network for a robotic manipulators to control position and orientation of the end-effector. Using the multi layer feedforward neural network that permits the connection of other layers, evolutionary programming(EP) that search the structure and weight of the neural network, and evolution strategies(ES) which training the weight of neuron, we optimized the net structure of control scheme. Using the four feature image information from CCD camera attached to end-effector of RV-M2 robot manipulator having 5 dof, we generate the control input to agree the target image, to realize the visual servoing. The validity and effectiveness of the proposed control scheme will be verified by computer simulations.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1699-1708
• /
• 2007

The optimal power flow(OPF) problem was introduced by Carpentier in 1962 as a network constrained economic dispatch problem. Since then, the OPF problem has been intensively studied and widely used in power system operation and planning. In these days, OPF is becoming more and more important in the deregulation environment of power pool and there is an urgent need of faster solution technique for on-line application. To solve OPF problem, many heuristic optimization methods have been developed, such as Genetic Algorithm(GA), Evolutionary Programming(EP), Evolution Strategies(ES), and Particle Swarm Optimization(PSO). Especially, PSO algorithm is a newly proposed population based heuristic optimization algorithm which was inspired by the social behaviors of animals. However, population based heuristic optimization methods require higher computing time to find optimal point. This shortcoming is overcome by a straightforward parallel processing of PSO algorithm. The developed parallel PSO algorithm is implemented on a PC cluster system with 6 Intel Pentium IV 2GHz processors. The proposed approach has been tested on the IEEE 30-bus system. The results showed that computing time of parallelized PSO algorithm can be reduced by parallel processing without losing the quality of solution.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.1
• /
• pp.61-66
• /
• 2002

A position control algorithm for a flexible manipulator is studied. The proposed algorithm is based on a fuzzy theory with a Steady State Genetic Algorithm(SSGA) and an Adaptive Genetic Algorithms(AGA). The proposed controller for a flexible manipulator have decreased 90.8%, 31.8%, 31.3% in error when compared with a conventional fuzzy controller, fuzzy controller using neural network, fuzzy controller using evolution strategies, respectively when the weight and the velocity of end-point are 0.8k9 and 1m/s, respectively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.253-261
• /
• 2004

Game theory is mathematical analysis developed to study involved in making decisions. In 1928, Von Neumann proved that every two-person, zero-sum game with finitely many pure strategies for each player is deterministic. As well, in the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Not the rationality but through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) introduced by Maynard Smith. Keeping pace with these game theoretical studies, the first computer simulation of co-evolution was tried out by Hillis in 1991. Moreover, Kauffman proposed NK model to analyze co-evolutionary dynamics between different species. He showed how co-evolutionary phenomenon reaches static states and that these states are Nash equilibrium or ESS introduced in game theory. Since the studies about co-evolutionary phenomenon were started, however many other researchers have developed co-evolutionary algorithms, in this paper we propose Game theory based Co-Evolutionary Algorithm (GCEA) and confirm that this algorithm can be a solution of evolutionary problems by searching the ESS.To evaluate newly designed GCEA approach, we solve several test Multi-objective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by co-evolutionary algorithm and analyze optimization performance of GCEA by comparing experimental results using GCEA with the results using other evolutionary optimization algorithms.