• 제목/요약/키워드: combined algorithm

검색결과 1,601건 처리시간 0.022초

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

  • 양보석;전상범;유영훈;최병근
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 1997년도 추계학술대회논문집; 한국과학기술회관; 6 Nov. 1997
    • /
    • 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
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1998년도 추계학술대회 학술발표 논문집
    • /
    • 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)

  • 최병근;양보석
    • 대한기계학회논문집A
    • /
    • 제24권7호
    • /
    • 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.

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

  • 박희진;조호성
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제35권2호
    • /
    • pp.75-83
    • /
    • 2008
  • Joye와 연구자들은 기존의 조합 소수 판단 검사에서 trial division 과정을 제거한 새로운 소수 생성 알고리즘 (이하 JPV 알고리즘)을 제시하였으며, 이 알고리즘이 기존의 조합 소수 생성 알고리즘에 비해 $30{\sim}40%$ 정도 빠르다고 주장하였다. 하지만 이 비교는 전체 수행시간이 아닌 Fermat 검사의 호출 횟수만을 비교한 것으로 정확한 비교와는 거리가 있다. 기존의 조합 소수 생성 알고리즘에 대해 이론적인 수행시간 예측 방법이 있음에도 불구하고 두 알고리즘의 전체 수행시간을 비교할 수 없었던 이유는 JPV 알고리즘에 대한 이론적인 수행 시간 예측 모델이 없었기 때문이다. 본 논문에서는 먼저 JPV 알고리즘을 확률적으로 분석하여 수행시간 예측 모델을 제시하고, 이 모델을 이용하여 JPV 알고리즘과 기존의 조차 소수 생성 알고리즘의 전체 수행시간을 비교한다. 이 모델을 이용하여 펜티엄4 시스템에서 512비트 소수의 생성 시간을 예측해 본 결과 Fermat 검사의 호출 횟수를 이용한 비교와는 달리 JPV 알고리즘이 기존의 조합 소수 생성 알고리즘보다 느리다는 결론을 얻었다. 이러한 이론적인 분석을 통한 비교는 실제 동일한 환경에서 실험을 통해서 검증되었다. 또한, 본 논문에서는 JPV 알고리즘의 성능 개선 방법을 제시한다. 이 방법을 사용하여 JPV 알고리즘을 개선하면 동일한 공간을 사용할 경우에 JPV 알고리즘이 기존의 조합 소수 생성 알고리즘과 비슷한 성능을 보인다.

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

  • 정채균;이종범;윤양웅
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제51권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.

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

  • 양보석;최병근;전상범;김동조
    • 한국지능시스템학회논문지
    • /
    • 제8권3호
    • /
    • pp.71-79
    • /
    • 1998
  • 본 논문은 유전알고리즘과 random tabu 탐색법을 조합한 새로운 최적화 알고리즘을 제안한다. 유전알고리즘과 전역적인 최적해에 대한 탐색능력이 우수하고, random tabu 탐색법은 최적해에의 수렴속도가 매우 빠른 알고리즘이다. 본 논문에서는 이 두 알고리즘의 장점을 이용해서 수렴정도와 수렴속도가 더욱 향상된 최적알고리즘을 제안하여 알고리즘의 수렴성능을 조사하고, 실제 최적화문제로서 지진응답을 최소로 하기위한 배관지지대의 최적배치문제에 적용하여 기존의 방법과 비교를 통하여 유용성을 검토하였다.

  • PDF

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

  • 김철수
    • 한국산업정보학회논문지
    • /
    • 제10권4호
    • /
    • pp.16-25
    • /
    • 2005
  • 본 논문에서는 최적의 이진 위상 컴퓨터형성홀로그램을 설계하기 위해 SA 및 GA를 합성한 새로운 방법을 제안하였다. 블럭단위 탐색을 하는 GA의 교배연산 및 돌연변이 연산과정 후에 화소단위의 면밀한 탐색을 하는 SA 알고리듬을 삽입하므로써 BPCGH의 성능을 개선시켰다. 컴퓨터 시뮬레이션에서 제안된 합성 반복 알고리듬이 기존의 SA 알고리듬보다 회절효율이 향상됨을 보였다.

  • PDF

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

  • 노석범;오성권;안태천
    • 전기학회논문지
    • /
    • 제56권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
    • /
    • 제66권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)

  • 송석현;이상헌
    • 대한산업공학회지
    • /
    • 제37권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.