• Title/Summary/Keyword: combined algorithm

Search Result 1,601, Processing Time 0.027 seconds

Ooptimum Design Damping Plate by Combined Method of Genetic Algorithm and Random Tabu Search Method (유전알고리즘과 Tabu탐색법에 의한 제진판의 최적설계)

  • 양보석;전상범;유영훈;최병근
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1997.10a
    • /
    • pp.184-189
    • /
    • 1997
  • This paper introduces a new combined method by genetic algorithm and random tabu search method as optimization algorithm. Genetic algorithm can search the global optimum and tabu search method is very fast in speed. The optimizing ability of new combined method is identified by comparing other optimizing algorithm and used for optimum design of damping plate.

  • PDF

Multi-Objective Optimization of Rotor-Bearing System with dynamic Constraints Using IGA

  • Choi, Byung-Gun;Yang, Bo-Suk;Jun, Yeo-Dong
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.10a
    • /
    • pp.403-410
    • /
    • 1998
  • An immune system has powerful abilities such as memory recognition and learning how to respond to invading antigens, and has been applied to many engineering algorithms in recent year. In this paper, the combined optimization algorithm (Immune-Genetic Algorithm: IGA) is proposed for multi-optimization problems by introduction the capability of the immune system that controls the proliferation of clones to the genetic algorithm. The new combined algorithm is applied to minimize the total weight of the rotor shaft and the transmitted forces at the bearings in order to demonstrate the merit of the combined algorithm. The inner diameter of the shaft and the bearing stiffness are chosen as the design variables. the results show that the combined algorithm can reduce both the weight of the shaft and the transmitted forces at the bearing with dynamic constraints.

  • PDF

Multi-Objective Optimum Shape Design of Rotor-Bearing System with Dynamic Constraints Using Immune-Genetic Algorithm (면역.유전 알고리듬을 이용한 로터 베어링시스템의 다목적 형상최적설계)

  • Choe, Byeong-Geun;Yang, Bo-Seok
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.7 s.178
    • /
    • pp.1661-1672
    • /
    • 2000
  • An immune system has powerful abilities such as memory, recognition and learning how to respond to invading antigens, and has been applied to many engineering algorithms in recent year. In this pap er, the combined optimization algorithm (Immune- Genetic Algorithm: IGA) is proposed for multi-optimization problems by introducing the capability of the immune system that controls the proliferation of clones to the genetic algorithm. The optimizing ability of the proposed combined algorithm is identified by comparing the result of optimization with simple genetic algorithm for two dimensional multi-peak function which have many local optimums. Also the new combined algorithm is applied to minimize the total weight of the shaft and the transmitted forces at the bearings. The inner diameter oil the shaft and the bearing stiffness are chosen as the design variables. The dynamic characteristics are determined by applying the generalized FEM. The results show that the combined algorithm and reduce both the weight of the shaft and the transmitted forces at the bearing with dynamic conatriants.

Probabilistic Analysis of JPV Prime Generation Algorithm and its Improvement (JPV 소수 생성 알고리즘의 확률적 분석 및 성능 개선)

  • Park, Hee-Jin;Jo, Ho-Sung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.2
    • /
    • pp.75-83
    • /
    • 2008
  • Joye et al. introduced a new prime generation algorithm (JPV algorithm hereafter), by removing the trial division from the previous combined prime generation algorithm (combined algorithm hereafter) and claimed that JPV algorithm is $30{\sim}40%$ faster than the combined algorithm. However, they only compared the number of Fermat-test calls, instead of comparing the total running times of two algorithms. The reason why the total running times could not be compared is that there was no probabilistic analysis on the running time of the JPV algorithm even though there was a probabilistic analysis for the combined algorithm. In this paper, we present a probabilistic analysis on the running time of the JPV algorithm. With this analytic model, we compare the running times of the JPV algorithm and the combined algorithm. Our model predicts that JPV algorithm is slower than the combined algorithm when a 512-bit prime is generated on a Pentium 4 system. Although our prediction is contrary to the previous prediction from comparing Fermat-test calls, our prediction corresponds to the experimental results more exactly. In addition, we propose a method to improve the JPV algorithm. With this method, the JPV algorithm can be comparable to the combined algorithm with the same space requirement.

A Study on a Fault Location Algorithm Using Wavelet Transform in Combined Transmission Systems (혼합송전계통에서 웨이브렛 변환을 이용한 고장점 탐색 알고리즘에 관한 연구)

  • Jeong, Chae-Gyun;Lee, Jong-Beom;Yun, Yang-Ung
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.5
    • /
    • pp.247-254
    • /
    • 2002
  • This paper describes a fault location algorithm in real combined transmission systems with underground power cable. The algorithm to calculate the fault location was developed using DWT wavelet transform and travelling wave occurred at fault point. And the proposed algorithm is also used the transient signal of one end in stead of the signal information of two ends. On the other hand, in this papers, the method to discriminate fault point between overhead line and cable section is also Proposed. Variety simulations were carried out to verify the accuracy and effectiveness of the proposed algorithm using EMTP/ATFDraw and Matlab. Simulation results show that the proposed method has the excellent ability for discrimination of fault section and fault location in combined transmission systems with power cables.

Optimum Allocation of Pipe Support Using Combined Optimization Algorithm by Genetic Algorithm and Random Tabu Search Method (유전알고리즘과 Random Tabu 탐색법을 조합한 최적화 알고리즘에 의한 배관지지대의 최적배치)

  • 양보석;최병근;전상범;김동조
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.3
    • /
    • pp.71-79
    • /
    • 1998
  • This paper introduces a new optimization algorithm which is combined with genetic algorithm and random tabu search method. Genetic algorithm is a random search algorithm which can find the global optimum without converging local optimum. And tabu search method is a very fast search method in convergent speed. The optimizing ability and convergent characteristics of a new combined optimization algorithm is identified by using a test function which have many local optimums and an optimum allocation of pipe support. The caculation results are compared with the existing genetic algorithm.

  • PDF

A Proposal of Combined Iterative Algorithm for Optimal Design of Binary Phase Computer Generated Hologram (최적의 BPCGH 설계를 위한 합성 반복 알고리듬 제안)

  • Kim Cheol-Su
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.10 no.4
    • /
    • pp.16-25
    • /
    • 2005
  • In this paper, we proposed a novel algorithm combined simulated annealing and genetic algorithms for designing optimal binary phase computer generated hologram. In the process of genetic algorithm searching by block units, after the crossover and mutation operations, simulated annealing algorithm searching by pixel units is inserted. So, the performance of BPCGH was improved. Computer simulations show that the proposed combined iterative algorithm has better performance than the simulated annealing algorithm in terms of diffraction efficiency

  • PDF

Fuzzy Combined Polynomial Neural Networks (퍼지 결합 다항식 뉴럴 네트워크)

  • Roh, Seok-Beom;Oh, Sung-Kwun;Ahn, Tae-Chon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.7
    • /
    • pp.1315-1320
    • /
    • 2007
  • In this paper, we introduce a new fuzzy model called fuzzy combined polynomial neural networks, which are based on the representative fuzzy model named polynomial fuzzy model. In the design procedure of the proposed fuzzy model, the coefficients on consequent parts are estimated by using not general least square estimation algorithm that is a sort of global learning algorithm but weighted least square estimation algorithm, a sort of local learning algorithm. We are able to adopt various type of structures as the consequent part of fuzzy model when using a local learning algorithm. Among various structures, we select Polynomial Neural Networks which have nonlinear characteristic and the final result of which is a complex mathematical polynomial. The approximation ability of the proposed model can be improved using Polynomial Neural Networks as the consequent part.

An algorithm to simulate the nonlinear behavior of RC 1D structural members under monotonic or cyclic combined loading

  • Nouban, Fatemeh;Sadeghi, Kabir
    • Structural Engineering and Mechanics
    • /
    • v.66 no.3
    • /
    • pp.305-315
    • /
    • 2018
  • Interaction of lateral loading, combined with axial force needs to be determined with care in reinforced concrete (RC) one-dimensional structural members (1D SMs) such as beam-columns (BCs) and columns. RC 1D SMs under heavy axial loading are known to fail by brittle mode and small lateral displacements. In this paper, a macro element-based algorithm is proposed to analyze the RC 1D SMs under monotonic or cyclic combined loading. The 1D SMs are discretized into macro-elements (MEs) located between the critical sections and the inflection points. The critical sections are discretized into fixed rectangular finite elements (FRFE). The nonlinear behavior of confined and unconfined concretes and steel elements are considered in the proposed algorithm. The proposed algorithm has been validated by the results of experimental tests carried out on full-scale RC structural members. The evolution of ultimate strain at extreme compression fiber of a rectangular RC section for different orientations of lateral loading shows that the ultimate strain decreases with increasing the axial force. In the examined cases, this ultimate strain ranges from 0.0024 to 0.0038. Therefore, the 0.003 value given by ACI-318 code for ultimate strain, is not conservative and valid for the combined load cases with significant values of axial force (i.e. for the axial forces heavier than 70% of the ultimate axial force).

Endosymbiotic Evolutionary Algorithm for the Combined Location Routing and Inventory Problem with Budget Constrained (초기투자비 제약을 고려한 입지..경로..재고문제의 내공생진화 알고리듬 해법)

  • Song, Seok-Hyun;Lee, Sang-Heon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.1
    • /
    • pp.1-9
    • /
    • 2011
  • This paper presents a new method that can solve the integrated problem of combined location routing and inventory problem (CLRIP) efficiently. The CLRIP is used to establish facilities from several candidate depots, to find the optimal set of vehicle routes, and to determine the inventory policy in order to minimize the total system cost. We propose a mathematical model for the CLRIP with budget constrained. Because this model is a nonpolynomial (NP) problem, we propose a endosymbiotic evolutionary algorithm (EEA) which is a kind of symbiotic evolutionary algorithm (SEA). The heuristic method is used to obtaining the initial solutions for the EEA. The experimental results show that EEA perform very well compared to the existing heuristic methods with considering inventory control decisions.