• Journal of Korean Association for Spatial Structures
• /
• v.2 no.3 s.5
• /
• pp.61-70
• /
• 2002

The objective of this study is the development of a size and shape discrete optimum design algorithms, which is based on the genetic algorithms and the fuzzy theory. This algorithms can perform both size and shape optimum designs of plane and space trusses. The developed fuzzy shape-GAs (FS-GAs) was implemented in a computer program. For the optimum design, the objective function is the weight of structures and the constraints are limits on loads and serviceability. This study solves the problem by introducing the FS-GAs operators into the genetic.

• International Journal of Aeronautical and Space Sciences
• /
• v.18 no.4
• /
• pp.729-739
• /
• 2017

The objective of this study was to optimize minimum-energy impulsive spacecraft intercept using genetic algorithms. A mathematical model was established on two-body system based on f and g solution and universal variable to address spacecraft intercept problem for non-coplanar elliptical orbits. This nonlinear problem includes many local optima due to discontinuity and strong nonlinearity. In addition, since it does not provide a closed-form solution, it must be solved using a numerical method. Therefore, the initial guess is that a very sensitive factor is needed to obtain globally optimal values. Genetic algorithms are effective for solving these kinds of optimization problems due to inherent properties of random search algorithms. The main goal of this paper was to find minimum energy solution for orbit transfer problem. The numerical solution using initial values evaluated by the genetic algorithm matched with results of Hohmann transfer. Such optimal solution for unrestricted arbitrary elliptic orbits using universal variables provides flexibility to solve orbit transfer problems.

• Structural Engineering and Mechanics
• /
• v.64 no.5
• /
• pp.579-589
• /
• 2017

This paper deals with the optimum cost design of partially prestressed concrete I crosssectioned beams by using Genetic Algorithms. For this purpose, the optimum cost design of two selected example problems that have different characteristics in behavior are performed via Genetic Algorithms by determining their objective functions, design variables and constraints. The results obtained from the technical literature are compared with the ones obtained from this study. The interpretation of the results show that the design of partially prestressed concrete I crossectioned beams from cost point of view by using Genetic Algorithms is 35~50 % more economical than the traditional ones (technical literature) without conceding safety.

• Journal of Advanced Marine Engineering and Technology
• /
• v.20 no.2
• /
• pp.108-108
• /
• 1996

This paper describes a new approach to solve balancing of a rigid rotor. In this paper, the balancing of the rigid rotor using genetic algorithms, which are search algorithms based on the mechanics of natural selection and natural genetics is proposed. Under the assumption that the initial vibration values used to calculate correction masses contain errors, the influence coefficient method, the least squares method and a genetic algorithm are compared. The results show that the vibration amplitude obtained with the least squares method and the genetic algorithm is smaller than that obtained with the influence coefficient method.

• Journal of Advanced Marine Engineering and Technology
• /
• v.20 no.2
• /
• pp.40-47
• /
• 1996

This paper describes a new approach to solve balancing of a rigid rotor. In this paper, the balancing of the rigid rotor using genetic algorithms, which are search algorithms based on the mechanics of natural selection and natural genetics is proposed. Under the assumption that the initial vibration values used to calculate correction masses contain errors, the influence coefficient method, the least squares method and a genetic algorithm are compared. The results show that the vibration amplitude obtained with the least squares method and the genetic algorithm is smaller than that obtained with the influence coefficient method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.140-140
• /
• 2000

Traditional genetic algorithms, though robust, are generally not the most successful optimization algorithm on any particular domain. Hybridizing a genetic algorithm with other algorithms can produce better performance than both the genetic algorithm and the other algorithms. In this paper, we use random process and simulated annealing instead of mutation operator in order to get well tuned fuzzy rules. The key of this approach is to adjust both the width and the center of membership functions so that the tuned rule-based fuzzy controller can generate the desired performance. The effectiveness of the proposed algorithm is verified by computer simulation.

• Journal of international Conference on Electrical Machines and Systems
• /
• v.1 no.1
• /
• pp.135-142
• /
• 2012

In this paper, optimal selection of the unified power flow controller (UPFC) damping controller parameters in order to improve the power system dynamic response and its stability based on two modified intelligent algorithms have been proposed. These algorithms are based on a modified intelligent particle swarm optimization (PSO) and continuous genetic algorithm (GA). After extraction of UPFC dynamic model, intelligent PSO and genetic algorithms are used to select the effective feedback signal of the damping controller; then, to compare the performance of the proposed UPFC controller in damping the critical modes of a single-machine infinite-bus (SMIB) power system, the simulation results are presented. The comparison shows the good performance of both presented PSO and genetic algorithms in an optimal selection of UPFC damping controller parameters and damping oscillations.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.43-54
• /
• 2004

This study analyzes characteristics and applicability of genetic algorithms and genetic operators to optimize highway alignments. Genetic algorithms, one of artificial intelligence techniques, are fast and efficient search algorithms for generating, evaluation and finding optimal highway alignment alternatives. The performance of genetic algorithms as an optimal search tool highly depends on genetic operators that are designed as a problem-specific. This study adopts low mutation operators(uniform mutation operator, straight mutation operator, non-uniform mutation operator whole non-uniform mutation operator) to explore whole search spaces, and four crossover operators(simple crossover operator, two-point crossover operator, arithmetic crossover operator, heuristic crossover operator) to exploit food characteristics of the best chromosome in previous generations. A case study and a sensitivity analysis have shown that the eight problem-specific operators developed for optimizing highway alignments enhance the search performance of genetic algorithms, and find good solutions(highway alignment alternatives). It has been also found that a mixed and well-combined use of mutation and crossover operators is very important to balance between pre-matured solutions when employing more crossover operators and more computation time when adopting more mutation operators.

• Journal of KIISE:Software and Applications
• /
• v.34 no.11
• /
• pp.971-983
• /
• 2007

Cellular Genetic Algorithms(CGAs) are a subclass of Genetic Algorithms(GAs) in which each individuals are placed in a given geographical distribution. In general, CGAs# population space is a regular network that has relatively long characteristic path length and high clustering coefficient in the view of the Networks Theory. Long average path length makes the genetic interaction of remote nodes slow. If we have the population#s path length shorter with keeping the high clustering coefficient value, CGAs# population space will converge faster without loss of diversity. In this paper, we propose Smallest-Small-World Cellular Genetic Algorithms(SSWCGAs). In SSWCGAs, each individual lives in a population space that is highly clustered but having shorter characteristic path length, so that the SSWCGAs promote exploration of the search space with no loss of exploitation tendency that comes from being clustered. Some experiments along with four real variable functions and two GA-hard problems show that the SSWCGAs are more effective than SGAs and CGAs.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.7
• /
• pp.619-624
• /
• 2011

This paper presents a controller design method for a robust control problem with multiple constraints using genetic algorithms and LMI design method. A robust $H_{\infty}$ constraint with loop shaping and pole placement is used to address disturbance attenuation with error limits and desired transient specifications, in spite of the plant uncertainties and disturbances. In addition, a loop gain constraint is considered so as not to enlarge the loop gain unnecessarily. The robust $H_{\infty}$ constraint and pole placement constraint can be expressed in terms of two matrix inequalities and the loop gain constraint can be considered as an objective function so that genetic algorithms can be applied. Accordingly, a robust controller can be obtained by integrating genetic algorithms with LMI approach. The proposed controller design method is applied to a track-following system of an optical disk drive and is evaluated through simulation results.