• Structural Engineering and Mechanics
• /
• v.17 no.5
• /
• pp.611-626
• /
• 2004

On the basis of a structural analysis of radial gate (i.e. Tainter gate), the current paper focuses on weight minimization according to the location of the arms on a radial gate. In spite of its economical significance, there are hardly any previous studies on the optimum design of radial gate. Accordingly, the present study identifies the optimum position of the support point for a radial gate that guarantees the minimum weight satisfying the strength constraint conditions. This study also identifies the optimum position for 2 or 3 radial arms with a convex cylindrical skin plate relative to a given radius of the skin plate curvature, pivot point, water depth, ice pressure, etc. These optimum designs are then compared with previously constructed radial gates. Local genetic and hybrid-type genetic algorithms are used as the optimum tools to reduce the computing time and enhance the accuracy. The results indicate that the weights of the optimized radial gates are appreciably lower than those of previously constructed gates.

• Journal of KIISE:Software and Applications
• /
• v.32 no.4
• /
• pp.268-276
• /
• 2005

This paper deals with optimum communication spanning tree(OCST) problem. Generally, OCST problem is known as NP-hard problem and recently, it is reveled as MAX SNP hard by Papadimitriou and Yannakakis. Nevertheless, many researchers have used polynomial approximation algorithm for solving this problem. This paper uses evolutionary algorithm. Especially, when an evolutionary algorithm is applied to tree network problem such as the OCST problem, representation and genetic operator should be considered simultaneously because they affect greatly the performance of algorithm. So, we introduce a new representation method to improve the weakness of previous representation which is proposed for solving the degree constrained minimum spanning tree problem. And we also propose a new decoding method to generate a reliable tree using the proposed representation. And then, for finding a suitable genetic operator which works well on the proposed representation, we tested three kinds of genetic operators using the information of network or the genetic information of parents. Consequently, we could confirm that the proposed method gives better results than the previous methods.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.1
• /
• pp.21-34
• /
• 2008

An improved optimum design method for reinforced concrete frames using integrated genetic algorithm(GA) with direct search method is presented. First, various sets of initially assumed sections are generated using GA, and then, for each resultant design member force condition optimum solutions are selected by regression analysis and direct search within pre-determined design section database. In advance, global optimum solutions are selected from accumulated results through several generations. Proposed algorithm makes up for the weak point in standard genetic algorithm(GA), that is, low efficiency in convergence causing the deterioration of quality of final solutions and shows fast convergence together with improved results. Moreover, for the purpose of elevating economic efficiency, optimum design based on the nonlinear structural analysis is performed and therefore makes all members resist against given loading condition with the nearest resisting capacity. The investigation for the effectiveness of the introduced design procedure is conducted through correlation study for example structures.

• Journal of Power System Engineering
• /
• v.18 no.5
• /
• pp.28-34
• /
• 2014

This paper deals with optimum PI controller design using genetic algorithm to improve control performance and robustness for an oil cooler system. The optimum PI gain was found to minimize an object function, integrated absolute error, and to satisfy control design specifications such as overshoot and settling time based on practical transfer function of the oil cooler system. The control performance and robustness were investigated by comparing indicial responses and Bode diagram analysis with respect to three kinds of PI gains obtained from different gain decision manners. Moreover, the robustness against to input disturbances, sinusoidal wave form and abrupt single pulse, was evaluated. The computer simulation results showed that the suggested optimum gain can establish desirable control performance and strong robustness with easy design process.

• Journal of the Korea Concrete Institute
• /
• v.12 no.4
• /
• pp.91-101
• /
• 2000

As the computer related technology evolves a study for a practical use of real structure as well as its hteory for optimum design has been greatly advanced. But the study on optimum design of pre-stressed concrete beam(PSC-beam) bridge for the construction of national roads and highways in Korea is not sufficient. Since a standard section for the PSC-beam is proposed, it is practically used in designing the PSC-beam. It is noticed that the section using the current standard PSC-beam design to be an over-designed with its surplus safety factor. Therefore, it is necessary to consider economical PSC-beam section which automatically satisfies all requirement of design specifications. Thus, in this study, the optimum design methods of PSC-beam are carried out using the gradient-based search method and global search method. As a result of the optimum design method, it was confirmed that the design of PSC-beam has a serious properties to non-linearity and discontinuity. And the section that in economical and efficinet design methods than the current standard design method is proposed.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.31-34
• /
• 2000

Genetic Algorithm is well known as the efficient algorithm which can solve a difficult optimization problem. Recently, there has been increasing interest in applying genetic algorithm to problem related to network design. In this paper, we propose a two-step genetic algorithm for designing a optimum virtual path network(VPN) for a given physical network and traffic demand. The first step is a routing step in which a route is found between every node pair in the network. In the second step, paths are assigned as VPs so as to minimize the total number of VPs configured, the number of VPs carried by a link, and the VP hopcount. We study the performance of the propose algorithm through simulation. The result shows that the VPN generated by the proposed algorithm is good in minimizing the number of VPs configured, the load on a link, and the VP hopcount.

• Steel and Composite Structures
• /
• v.4 no.6
• /
• pp.453-469
• /
• 2004

In this article, a genetic algorithm based optimum design method is presented for non-linear steel frames with semi-rigid connections. The design algorithm obtains the minimum weight frame by selecting suitable sections from a standard set of steel sections such as European wide flange beams (i.e., HE sections). A genetic algorithm is employed as optimization method which utilizes reproduction, crossover and mutation operators. Displacement and stress constraints of Turkish Building Code for Steel Structures (TS 648, 1980) are imposed on the frame. The algorithm requires a large number of non-linear analyses of frames. The analyses cover both the non-linear behaviour of beam-to-column connection and $P-{\Delta}$ effects of beam-column members. The Frye and Morris polynomial model is used for modelling of semi-rigid connections. Two design examples with various type of connections are presented to demonstrate the application of the algorithm. The semi-rigid connection modelling results in more economical solutions than rigid connection modelling, but it increases frame drift.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.188-191
• /
• 2011

Path finding and path planning is crucial in today's world where time is an extremely valuable element. It is easy to plan the optimum path to a destination if provided a map but the same cannot be said for an unknown and unexplored environment. It will surely be exhaustive to search and explore for paths to reach the destination, not to mention planning for the optimum path. This is very much similar to finding for an exit of a maze. A very popular competition designed to tackle the maze solving ability of autonomous called Micromouse will be used as a guideline for us to design our maze. There are numerous ways one can think of to solve a maze such as Dijkstra's algorithm, flood fill algorithm, modified flood fill algorithm, partition-central algorithm [1], and potential maze solving algorithm [2]. We will analyze these algorithms from various aspects such as maze solving ability, computational complexity, and also feasibility to be implemented.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.25-30
• /
• 2016

We consider energy efficient transmit and receive strategy for a delay sensitive data. More specifically, we investigate an energy optimum scheduling characteristics for the 2 user interference channel where each user interferes to each other. First, we determine the optimum transmission rate region each individual user may have for optimum transmission. Next, we consider the optimum transmission region of two users together. Shortest path algorithm can be used for further reduction of search space. Eventually, we can reduce computational complexity. We then examine the performance of the optimum transmission strategy for various system environments.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.146-151
• /
• 2001

This study is an investigation for the ADS optimum design by using FEM. We write out program which express ADS perfectly and reduce the required time for correcting of model to the minimum in solution and manufacture result. We complete algorithm which can plan optimum forming of model by feedback error information in CAE. For that, we draw up ADS program which modeling rachet wheel by using visual LISP and telegraph to ANSYS, structural solution program, we can solve stress solution. Then we correct model by feedback date obtaining in solution process, repeat course following stress solution again and do modeling rachet wheel for optimum forming. That is our aim. As a result of experience, we can develope automatic design program using Visual LISP and exhibit ADS as modeling third dimension CAD for optimum design. Also, we develop optimum design algorithm using ADS and FEM. In rachet wheel, greatest equivalence stress originates in key groove comer and KS standard is proved the design for security.