• Title/Summary/Keyword: genetic optimization

Search Result 2,146, Processing Time 0.026 seconds

Structural Optimization Using Micro-Genetic Algorithm (마이크로 유전자 알고리즘을 이용한 구조 최적설계)

  • 한석영;최성만
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2003.04a
    • /
    • pp.9-14
    • /
    • 2003
  • SGA (Single Genetic Algorithm) is a heuristic global optimization method based on the natural characteristics and uses many populations and stochastic rules. Therefore SGA needs many function evaluations and takes much time for convergence. In order to solve the demerits of SGA, $\mu$GA(Micro-Genetic Algorithm) has recently been developed. In this study, $\mu$GA which have small populations and fast convergence rate, was applied to structural optimization with discrete or integer variables such as 3, 10 and 25 bar trusses. The optimized results of $\mu$GA were compared with those of SGA. Solutions of $\mu$GA for structural optimization were very similar or superior to those of SGA, and faster convergence rate was obtained. From the results of examples, it is found that $\mu$GA is a suitable and very efficient optimization algorithm for structural design.

  • PDF

Optimization of Control Parameters for Hydraulic Systems Using Genetic Algorithms (유전알고리듬을 이용한 유압시스템의 제어파라메터 최적화)

  • Hyeon, Jang-Hwan
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.21 no.9
    • /
    • pp.1462-1469
    • /
    • 1997
  • This study presents a genetic algorithm-based method for optimizing control parameters in fluid power systems. Genetic algorithms are general-purpose optimization methods based on natural evolution and genetics. A genetic algorithm seeks control parameters maximizing a measure that evaluates system performance. Five control gains of the PID-PD cascade controller fr an electrohydraulic speed control system with a variable displacement hydraulic motor are optimized using a genetic algorithm in the experiment. Optimized gains are confirmed by inspecting the fitness distribution which represents system performance in gain spaces. It is shown that optimization of the five gains by manual tuning should be a task of great difficulty and that a genetic algorithm is an efficient scheme giving economy of time and in labor in optimizing control parameters of fluid power systems.

Optimum Design of Trusses Using Genetic Algorithms (유전자 알고리즘을 이용한 트러스의 최적설계)

  • 김봉익;권중현
    • Journal of Ocean Engineering and Technology
    • /
    • v.17 no.6
    • /
    • pp.53-57
    • /
    • 2003
  • Optimum design of most structural system requires that design variables are regarded as discrete quantities. This paper presents the use of Genetic Algorithm for determining the optimum design for truss with discrete variables. Genetic Algorithm are know as heuristic search algorithms, and are effective global search methods for discrete optimization. In this paper, Elitism and the method of conferring penalty parameters in the design variables, in order to achieve improved fitness in the reproduction process, is used in the Genetic Algorithm. A 10-Bar plane truss and a 25-Bar space truss are used for discrete optimization. These structures are designed for stress and displacement constraints, but buckling is not considered. In particular, we obtain continuous solution using Genetic Algorithms for a 10-bar truss, compared with other results. The effectiveness of Genetic Algorithms for global optimization is demonstrated through two truss examples.

Fast Optimization by Queen-bee Evolution and Derivative Evaluation in Genetic Algorithms

  • Jung, Sung-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.5 no.4
    • /
    • pp.310-315
    • /
    • 2005
  • This paper proposes a fast optimization method by combining queen-bee evolution and derivative evaluation in genetic algorithms. These two operations make it possible for genetic algorithms to focus on highly fitted individuals and rapidly evolved individuals, respectively. Even though the two operations can also increase the probability that genetic algorithms fall into premature convergence phenomenon, that can be controlled by strong mutation rates. That is, the two operations and the strong mutation strengthen exploitation and exploration of the genetic algorithms, respectively. As a result, the genetic algorithm employing queen-bee evolution and derivative evaluation finds optimum solutions more quickly than those employing one of them. This was proved by experiments with one pattern matching problem and two function optimization problems.

A Novel Hybrid Intelligence Algorithm for Solving Combinatorial Optimization Problems

  • Deng, Wu;Chen, Han;Li, He
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.4
    • /
    • pp.199-206
    • /
    • 2014
  • The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

Design and optimization of steel trusses using genetic algorithms, parallel computing, and human-computer interaction

  • Agarwal, Pranab;Raich, Anne M.
    • Structural Engineering and Mechanics
    • /
    • v.23 no.4
    • /
    • pp.325-337
    • /
    • 2006
  • A hybrid structural design and optimization methodology that combines the strengths of genetic algorithms, local search techniques, and parallel computing is developed to evolve optimal truss systems in this research effort. The primary objective that is met in evolving near-optimal or optimal structural systems using this approach is the capability of satisfying user-defined design criteria while minimizing the computational time required. The application of genetic algorithms to the design and optimization of truss systems supports conceptual design by facilitating the exploration of new design alternatives. In addition, final shape optimization of the evolved designs is supported through the refinement of member sizes using local search techniques for further improvement. The use of the hybrid approach, therefore, enhances the overall process of structural design. Parallel computing is implemented to reduce the total computation time required to obtain near-optimal designs. The support of human-computer interaction during layout optimization and local optimization is also discussed since it assists in evolving optimal truss systems that better satisfy a user's design requirements and design preferences.

Static Compliance Analysis & Multi-Objective Optimization of Machine Tool Structures Using Genetic Algorithm(I) (유전자 알고리듬을 이용한 공자기계구조물의 정강성 해석 및 다목적 함수 최적화(I))

  • 이영우;성활경
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2000.10a
    • /
    • pp.443-448
    • /
    • 2000
  • In this paper, multiphase optimization of machine structure is presented. The goal of first step is to obtain (i) light weight, (ii) rigidity statically. In this step, multiple optimization problem with two objective functions is treated using Pareto Genetic Algorithm. Where two objective functions are weight of the structure, and static compliance. The method is applied to a new machine structure design.

  • PDF

Genetic-Based Combinatorial Optimization Method for Design of Rolling Element Bearing (구름 베어링 설계를 위한 유전 알고리듬 기반 조합형 최적설계 방법)

  • 윤기찬;최동훈;박창남
    • Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
    • /
    • 2001.11a
    • /
    • pp.166-171
    • /
    • 2001
  • In order to improve the efficiency of the design process and the quality of the resulting design for the application-based exclusive rolling element bearings, this study propose design methodologies by using a genetic-based combinatorial optimization. By the presence of discrete variables such as the number of rolling element (standard component) and by the engineering point of views, the design problem of the rolling element bearing can be characterized by the combinatorial optimization problem as a fully discrete optimization. A genetic algorithm is used to efficiently find a set of the optimum discrete design values from the pre-defined variable sets. To effectively deal with the design constraints and the multi-objective problem, a ranking penalty method is suggested for constructing a fitness function in the genetic-based combinatorial optimization. To evaluate the proposed design method, a robust performance analyzer of ball bearing based on quasi-static analysis is developed and the computer program is applied to some design problems, 1) maximize fatigue life, 2) maximize stiffness, 3) maximize fatigue life and stiffness, of a angular contact ball bearing. Optimum design results are demonstrate the effectiveness of the design method suggested in this study. It believed that the proposed methodologies can be effectively applied to other multi-objective discrete optimization problems.

  • PDF

Comparative Study on Structural Optimal Design Using Micro-Genetic Algorithm (마이크로 유전자 알고리즘을 적용한 구조 최적설계에 관한 비교 연구)

  • 한석영;최성만
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.12 no.3
    • /
    • pp.82-88
    • /
    • 2003
  • SGA(Single Genetic Algorithm) is a heuristic global optimization method based on the natural characteristics and uses many populations and stochastic rules. Therefore SGA needs many function evaluations and takes much time for convergence. In order to solve the demerits of SGA, ${\mu}GA$(Micro-Genetic Algorithm) has recently been developed. In this study, ${\mu}GA$ which have small populations and fast convergence rate, was applied to structural optimization with discrete or integer variables such as 3, 10 and 25 bar trusses. The optimized results of ${\mu}GA$ were compared with those of SGA. Solutions of ${\mu}GA$ for structural optimization were very similar or superior to those of SGA, and faster convergence rate was obtained. From the results of examples, it is found that ${\mu}GA$ is a suitable and very efficient optimization algorithm for structural design.

Optimization Model for Sewer Rehabilitation Using Fast Messy Genetic Algorithm (fmGA를 이용한 하수관거정비 최적화 모델)

  • Ryu, Jae-Na;Ki, Beom-Joon;Rark, Kyoc-Hong;Lee, Cha-Don
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.18 no.2
    • /
    • pp.145-154
    • /
    • 2004
  • A long-term sewer rehabilitation project consuming an enormous budget needs to be conducted systematically using an optimization skill. The optimal budgeting and ordering of priority for sewer rehabilitation projects are very important with respect to the effectiveness of investment. In this study, the sewer rehabilitation optimization model using fast-messy genetic algorithm is developed to suggest a schedule for optimal sewer rehabilitation in a subcatchment area by modifying the existing GOOSER$^{(R)}$ model having been developed using simple genetic algorithm. The sewer rehabilitation optimization model using fast-messy genetic algorithm can improve the speed converging to the optimal solution relative to GOOSER$^{(R)}$, suggesting that it is more advantageous to the sewer rehabilitation in a larger-scale subcatchment area than GOOSER.