• Title/Summary/Keyword: 조합 알고리듬

Search Result 81, Processing Time 0.025 seconds

Development of the New Hybrid Evolutionary Algorithm for Low Vibration of Ship Structures (선박 구조물의 저진동 설계를 위한 새로운 조합 유전 알고리듬 개발)

  • Kong, Young-Mo;Choi, Su-Hyun;Song, Jin-Dae;Yang, Bo-Suk
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.164-170
    • /
    • 2006
  • This paper proposes a RSM-based hybrid evolutionary algorithm (RHEA) which combines the merits of the popular programs such as genetic algorithm (GA), tabu search method, response surface methodology (RSM). This algorithm, for improving the convergent speed that is thought to be the demerit of genetic algorithm, uses response surface methodology and simplex method. The mutation of GA offers random variety to finding the optimum solution. In this study, however, systematic variety can be secured through the use of tabu list. Efficiency of this method has been proven by applying traditional test functions and comparing the results to GA. And it was also proved that the newly suggested algorithm is very effective to find the global optimum solution to minimize the weight for avoiding the resonance of fresh water tank that is placed in the rear of ship. According to the study, GA's convergent speed in initial stages is improved by using RSM method. An optimized solution is calculated without the evaluation of additional actual objective function. In a summary, it is concluded that RHEA is a very powerful global optimization algorithm from the view point of convergent speed and global search ability.

  • PDF

Development of the New Hybrid Evolutionary Algorithm for Low Vibration of Ship Structures (선박 구조물의 저진동 설계를 위한 새로운 조합 유전 알고리듬 개발)

  • Kong, Young-Mo;Choi, Su-Hyun;Song, Jin-Dae;Yang, Bo-Suk
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.16 no.6 s.111
    • /
    • pp.665-673
    • /
    • 2006
  • This paper proposes a RSM-based hybrid evolutionary Algorithm (RHEA) which combines the merits of the popular programs such as genetic algorithm (GA), tabu search method and response surface methodology (RSM). This algorithm, for improving the convergent speed that is thought to be the demerit of genetic algorithm, uses response surface methodology and simplex method. The mutation of GA offers random variety to finding the optimum solution. In this study, however, systematic variety can be secured through the use of tabu list. Efficiency of this method has been proven by applying traditional left functions and comparing the results to GA. It was also proved that the newly suggested algorithm is very effective to find the global optimum solution to minimize the weight for avoiding the resonance of fresh water tank that is placed in the after body area of ship. According to the study, GA's convergent speed in initial stages is improved by using RSM method. An optimized solution is calculated without the evaluation of additional actual objective function. In a summary, it is concluded that RHEA is a very powerful global optimization algorithm from the view point of convergent speed and global search ability.

Delay optimization algorithm for the high speed operation of FPGAs (FPGA를 고속으로 동작시키기 위한 지연시간 최적화 알고리듬)

  • 김남우;허창우;최익성;이범철
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.11a
    • /
    • pp.525-529
    • /
    • 1999
  • 본 논문에서는 고속 FPGA 설계를 위한 논리 수준의 조합회로 합성 알고리듬을 제안한다. 제안 된 알고리듬은 회로의 지연시간을 줄이기 위해 critical path를 분할한 후 분할된 회로를 동시에 수행하는 구조의 회로를 생성한다. MCNC 표준 테스트 회로에 대한 실험에서 제안된 지연시간 최적화 알고리듬이 기존 알고리듬에 비해 지연시간이 평균 33.3 % 감소된 회로를 생성함을 보였다.

  • PDF

A Physical Combined Attack and its Countermeasure on BNP Exponentiation Algorithm (BNP 멱승 알고리듬에 대한 물리적인 조합 공격 및 대응책)

  • Kim, Hyung-Dong;Ha, Jae-Cheol
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.4
    • /
    • pp.585-591
    • /
    • 2013
  • Recently, the combined attack which is a combination of side channel analysis and fault attack has been developed to extract the secret key during the cryptographic processes using a security device. Unfortunately, an attacker can find the private key of RSA cryptosystem through one time fault injection and power signal analysis. In this paper, we diagnosed SPA/FA resistant BNP(Boscher, Naciri, and Prouff) exponentiation algorithm as having threats to a similar combined attack. And we proposed a simple countermeasure to resist against this combined attack by randomizing the private key using error infective method.

Application of a Conventional Advanced Control for a Glass Furnace (유리 용해로를 위한 고전 고급제어의 적용)

  • Moon, Un-Chul
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2590-2592
    • /
    • 2000
  • 본 논문에서는 TV 브라운관 유리용해로의 온도 제어를 위한 고전 고급 제어 (Conventional Advanced Control) 알고리듬을 제시한다. 용해로의 특성에 맞도록 중요한 입출력 변수를 선정한 후, 공정 실험을 통하여 얻어진 데이터를 바탕으로 입출력 변수들간의 초보적인 FOPDT (First Order Plus Dead Time) 모델들의 조합으로 용해로를 모델링하였다. 수립된 모델을 바탕으로 주요 입출력을 PI (Proportional - Integral) 형태의 cascade 및 단일 궤환 루프(Single feedback loop)들의 조합으로 제어기를 구성하였다. 제시된 알고리듬은 기존 용해로에 설치되어 있는 DCS를 이용하여 구현되었고, 일 150톤 생산 규모의 용해로에 성공적으로 실적용되었다.

  • PDF

Delay optimization algorithm on FPGAs (FPGA 에 대한 지연시간 최적화 알고리듬)

  • Hur Chang-Wu;Kim Nam-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.7
    • /
    • pp.1259-1265
    • /
    • 2006
  • In this paper, we propose a combined synthetic algorithm of the logic level for high speed FPGA design. The algorithm divides critical path to reduce delay time and generates a circuit which the divided circuits execute simultaneously. This kernel selection algorithm is made by C-langage of SUN UNIX. We compare this with the existing FlowMap algorithm. This proposed algorithm shows result on 33.3% reduction of delay time by comparison with the existing algorithm.

A Two-Stage Heuristic for Period Vehicle Routing : Minimizing the Fleet Size (소요차량을 최소화하는 기간차량경로 문제에 관한 2단계 발견적 기법)

  • Cho, Byeong-Min;Kim, Jun-Gyu;Lee, Dong-Ho
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.31 no.3
    • /
    • pp.90-100
    • /
    • 2008
  • 기간차량경로 문제는 차량용량제약을 고려한 차량경로문제를 다 기간으로 확장한 형태의 문제로 역방향 로지스틱스의 폐기물 혹은 재활용품 수거에 관련된 주요한 운영 문제들 중의 하나로 각 고객에 대해서는 계획기간 중에 방문해야 하는 횟수가 정해져 있어 방문날짜 조합을 결정해야 하며 주어진 방문날짜 조합 하에 각 기간의 차량경로도 결정해야 한다. 주요한 제약조건으로는 차량의 용량제약과 각 기간의 가용 시간제약이 있으며 소요차량의 대수를 최소화하는 것을 목적으로 한다. 본 연구에서는 대상 문제의 복잡도로 인하여 초기해를 구하고 그 해를 개선하는 2 단계 발견적 알고리듬을 제안하였으며 다양한 문제들에 대한 계산실험 결과 본 연구에서 제안하고 있는 발견적 알고리듬이 기존 알고리듬보다 우수함을 보였다.

Design of optimal BPCGH using combination of GA and SA Algorithm (GA와 SA 알고리듬의 조합을 이용한 최적의 BPCGH의 설계)

  • 조창섭;김철수;김수중
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5C
    • /
    • pp.468-475
    • /
    • 2003
  • In this Paper, we design an optimal binary phase computer generated hologram for Pattern generation using combined genetic algorithm and simulated annealing algorithm together. To design an optimal binary phase computer generated hologram, in searching process of the proposed method, the simple genetic algorithm is used to get an initial random transmittance function of simulated annealing algorithm. Computer simulation shows that the proposed algorithm has better performance than the genetic algorithm or simulated annealing algorithm of terms of diffraction efficiency

Development of Efficient Parallel Tiled Display Algorithms by Combining the Sort-first and the Sort-last Sorting Methods (전 분류 기법과 후 분류 기법의 조합을 통한 효율적 병렬 타일 가시화 알고리듬 개발)

  • Choi, Yun-Hyuk;Kim, Il-Ho;Kim, Hong-Seong;Cho, Jin-Yeon
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.36 no.2
    • /
    • pp.146-155
    • /
    • 2008
  • To improve the performance of tiled display system, two parallel tiled display algorithms are proposed by combining the sort-first and the sort-last sorting methods. In the proposed algorithms, the view frustum culling is employed along with the OpenGL display list for the sort-first sorting, and the pre-detection sort-last sparse sorting method is used for sort-last sorting. Through the benchmarking tests, the performances of two proposed algorithms are investigated. Based on the observations, it is suggested how to select an optimal algorithm among the two proposed parallel tiled display algorithms for the given visualization model.

A Study on the Algorithm for Automatic Generation of Optimal Waypoint with Terrain Avoidance (지형 회피를 위한 최적 경로점 자동 생성 알고리듬 연구)

  • Park, Jung-Jin;Park, Sang-Hyuk;Ryoo, Chang-Kyung;Shin, Sung-Sik
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.37 no.11
    • /
    • pp.1104-1111
    • /
    • 2009
  • In the low altitude, mission of the aircraft is restricted by a variety of threats such as anti-air missiles and terrain obstacles. Especially, aircraft have always a risk of ground collision near terrain. In this study, to effectively solve this problem, we developed the flight path generation algorithm that is considered the terrain avoidance. In this flight path generation algorithm, waypoints that should be passed by the UAV are selected first. The waypoints are located in the middle of the terrain obstacles. Then, physically meaningful waypoints sets are classified by Dijkstra algorithm. The optimal waypoint guidance law based on the optimal control theory is applied to produce trajectory candidates. And finally the minimum control energy trajectory is determined.