• Title/Summary/Keyword: Hybrid-GA Algorithm

Search Result 168, Processing Time 0.035 seconds

Identification of Bearing Dynamic Coefficients Using Optimization Techniques (최적화기법에 의한 베어링 동특성 계수의 규명)

  • 김용한;양보석;안영공;김영찬
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.05a
    • /
    • pp.520-525
    • /
    • 2003
  • The determination of unknown parameters in rotating machinery is a difficult task and optimization techniques represent an alternative technique for parameter identification. The Simulated Annealing(SA) and Genetic Algorithm(GA) are powerful global optimization algorithm. This paper proposes new hybrid algorithm which combined GA with SA and local search algorithm for the purpose of parameter identification. Numerical examples are also presented to verify the efficiency of proposed algorithm. And, this paper presents the general methodology based on hybrid algorithm to identify unknown bearing parameters of flexible rotors using measured unbalance responses. Numerical examples are used to ilustrate the methodology used, which is then validated experimentally.

  • PDF

Development of multiclass traffic assignment algorithm (Focused on multi-vehicle) (다중계층 통행배분 알고리즘 개발 (다차종을 중심으로))

  • 강진구;류시균;이영인
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.6
    • /
    • pp.99-113
    • /
    • 2002
  • The multi-class traffic assignment problem is the most typical one of the multi-solution traffic assignment problems and, recently formulation of the models and the solution algorithm have been received a great deal of attention. The useful solution algorithm, however, has not been proposed while formulation of the multi-class traffic assignment could be performed by adopting the variational inequality problem or the fixed point problem. In this research, we developed a hybrid solution algorithm which combines GA algorithm, diagonal algorithm and clustering algorithm for the multi-class traffic assignment formulated as a variational inequality Problem. GA algorithm and clustering algorithm are introduced for the wide area and small cost. We also performed an experiment with toy network(2 link) and tested the characteristics of the suggested algorithm.

FE MODEL UPDATING OF ROTOR SHAFT USING OPTIMIZATION TECHNIQUES (최적화 기법을 이용한 로터 축 유한요소모델 개선)

  • Kim, Yong-Han;Feng, Fu-Zhou;Yang, Bo-Suk
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.11a
    • /
    • pp.104-108
    • /
    • 2003
  • Finite element (FE) model updating is a procedure to minimize the differences between analytical and experimental results, which can be usually posed as an optimization problem. This paper aims to introduce a hybrid optimization algorithm (GA-SA), which consists of a Genetic algorithm (GA) stage and an Adaptive Simulated Annealing (ASA) stage, to FE model updating for a shrunk shaft. A good agreement of the first four natural frequencies has been achieved obtained from GASA based updated model (FEgasa) and experiment. In order to prove the validity of GA-SA, comparisons of natural frequencies obtained from the initial FE model (FEinit), GA based updated model (FEga) and ASA based updated model (FEasa) are carried out. Simultaneously, the FRF comparisons obtained from different FE models and experiment are also shown. It is concluded that the GA, ASA, GA-SA are powerful optimization techniques which can be successfully applied to FE model updating, the natural frequencies and FRF obtained from all the updated models show much better agreement with experiment than that obtained from FEinit model. However, FEgasa is proved to be the most reasonable FE model, and also FEasa model is better than FEga model.

  • PDF

Performance Comparison of Discrete Particle Swarm Optimizations in Sequencing Problems (순서화 문제에서 01산적 Particle Swarm Optimization들의 성능 비교)

  • Yim, D.S.
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.4
    • /
    • pp.58-68
    • /
    • 2010
  • Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

Hybrid Genetic Algorithms for Feature Selection and Classification Performance Comparisons (특징 선택을 위한 혼합형 유전 알고리즘과 분류 성능 비교)

  • 오일석;이진선;문병로
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.8
    • /
    • pp.1113-1120
    • /
    • 2004
  • This paper proposes a novel hybrid genetic algorithm for the feature selection. Local search operations are devised and embedded in hybrid GAs to fine-tune the search. The operations are parameterized in terms of the fine-tuning power, and their effectiveness and timing requirement are analyzed and compared. Experimentations performed with various standard datasets revealed that the proposed hybrid GA is superior to a simple GA and sequential search algorithms.

Real-Time Power-Saving Scheduling Based on Genetic Algorithms in Multi-core Hybrid Memory Environments (멀티코어 이기종메모리 환경에서의 유전 알고리즘 기반 실시간 전력 절감 스케줄링)

  • Yoo, Suhyeon;Jo, Yewon;Cho, Kyung-Woon;Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.1
    • /
    • pp.135-140
    • /
    • 2020
  • Recently, due to the rapid diffusion of intelligent systems and IoT technologies, power saving techniques in real-time embedded systems has become important. In this paper, we propose P-GA (Parallel Genetic Algorithm), a scheduling algorithm aims at reducing the power consumption of real-time systems in multi-core hybrid memory environments. P-GA improves the Proportional-Fairness (PF) algorithm devised for multi-core environments by combining the dynamic voltage/frequency scaling of the processor with the nonvolatile memory technologies. Specifically, P-GA applies genetic algorithms for optimizing the voltage and frequency modes of processors and the memory types, thereby minimizing the power consumptions of the task set. Simulation experiments show that the power consumption of P-GA is reduced by 2.85 times compared to the conventional schemes.

Hybrid Genetic Algorithm Reinforced by Fuzzy Logic Controller (퍼지로직제어에 의해 강화된 혼합유전 알고리듬)

  • Yun, Young-Su
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.1
    • /
    • pp.76-86
    • /
    • 2002
  • In this paper, we suggest a hybrid genetic algorithm reinforced by a fuzzy logic controller (flc-HGA) to overcome weaknesses of conventional genetic algorithms: the problem of parameter fine-tuning, the lack of local search ability, and the convergence speed in searching process. In the proposed flc-HGA, a fuzzy logic controller is used to adaptively regulate the fine-tuning structure of genetic algorithm (GA) parameters and a local search technique is applied to find a better solution in GA loop. In numerical examples, we apply the proposed algorithm to a simple test problem and two complex combinatorial optimization problems. Experiment results show that the proposed algorithm outperforms conventional GAs and heuristics.

An evolutionary hybrid optimization of MARS model in predicting settlement of shallow foundations on sandy soils

  • Luat, Nguyen-Vu;Nguyen, Van-Quang;Lee, Seunghye;Woo, Sungwoo;Lee, Kihak
    • Geomechanics and Engineering
    • /
    • v.21 no.6
    • /
    • pp.583-598
    • /
    • 2020
  • This study is attempted to propose a new hybrid artificial intelligence model called integrative genetic algorithm with multivariate adaptive regression splines (GA-MARS) for settlement prediction of shallow foundations on sandy soils. In this hybrid model, the evolution algorithm - Genetic Algorithm (GA) was used to search and optimize the hyperparameters of multivariate adaptive regression splines (MARS). For this purpose, a total of 180 experimental data were collected and analyzed from available researches with five-input variables including the bread of foundation (B), length to width (L/B), embedment ratio (Df/B), foundation net applied pressure (qnet), and average SPT blow count (NSPT). In further analysis, a new explicit formulation was derived from MARS and its accuracy was compared with four available formulae. The attained results indicated that the proposed GA-MARS model exhibited a more robust and better performance than the available methods.

Nonlinear Identification of Electronic Brake Pedal Behavior Using Hybrid GMDH and Genetic Algorithm in Brake-By-Wire System

  • Bae, Junhyung;Lee, Seonghun;Shin, Dong-Hwan;Hong, Jaeseung;Lee, Jaeseong;Kim, Jong-Hae
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.3
    • /
    • pp.1292-1298
    • /
    • 2017
  • In this paper, we represent a nonlinear identification of electronic brake pedal behavior in the brake-by-wire (BBW) system based on hybrid group method of data handling (GMDH) and genetic algorithm (GA). A GMDH is a kind of multi-layer network with a structure that is determined through training and which can express nonlinear dynamics as a mathematical model. The GA is used in the GMDH, enabling each neuron to search for its optimal set of connections with the preceding layer. The results obtained with this hybrid approach were compared with different nonlinear system identification methods. The experimental results showed that the hybrid approach performs better than the other methods in terms of root mean square error (RMSE) and correlation coefficients. The hybrid GMDH/GA approach was effective for modeling and predicting the brake pedal system under random braking conditions.

Direction Vector for Efficient Structural Optimization with Genetic Algorithm (효율적 구조최적화를 위한 유전자 알고리즘의 방향벡터)

  • Lee, Hong-Woo
    • Journal of Korean Association for Spatial Structures
    • /
    • v.8 no.3
    • /
    • pp.75-82
    • /
    • 2008
  • In this study, the modified genetic algorithm, D-GA, is proposed. D-GA is a hybrid genetic algorithm combined a simple genetic algorithm and the local search algorithm using direction vectors. Also, two types of direction vectors, learning direction vector and random direction vector, are defined without the sensitivity analysis. The accuracy of D-GA is compared with that of simple genetic algorithm. It is demonstrated that the proposed approach can be an effective optimization technique through a minimum weight structural optimization of ten bar truss.

  • PDF