• Structural Engineering and Mechanics
• /
• 제46권3호
• /
• pp.403-416
• /
• 2013

This paper describes new optimization strategy that offers significant improvements in performance over existing methods for geometry design of frame structures. In this study, an imperialist competitive algorithm (ICA) and ant colony optimization (ACO) are combined to reach to an efficient algorithm, called Imperialist Competitive Ant Colony Optimization (ICACO). The ICACO applies the ICA for global optimization and the ACO for local search. The results of optimal geometry for three benchmark examples of frame structures, demonstrate the effectiveness and robustness of the new method presented in this work. The results indicate that the new technique has a powerful search strategies due to the modifications made in search module of ICACO. Higher rate of convergence is the superiority of the presented algorithm in comparison with the conventional mathematical methods and non hybrid heuristic methods such as ICA and particle swarm optimization (PSO).

• 한국미생물·생명공학회지
• /
• 제47권2호
• /
• pp.278-288
• /
• 2019

In the present investigation, we attempted to design a protocol to develop a hybrid protein with better bioremediation capacity. Using in silico approaches, a Hybrid Open Reading Frame (Hybrid ORF) is developed targeting the genes of microorganisms known for degradation of organophosphates. Out of 21 genes identified through BLAST search, 8 structurally similar genes (opdA, opd, opaA, pte RO, pdeA, parC, mpd and phnE) involved in biodegradation were screened. Gene conservational analysis categorizes these organophosphates degrading 8 genes into 4 super families i.e., Metallo-dependent hydrolases, Lactamase B, MPP and TM_PBP2 superfamily. Hybrid protein structure was modeled using multi-template homology modeling (3S07_A; 99%, 1P9E_A; 98%, 2ZO9_B; 33%, 2DXL_A; 33%) by $Schr{\ddot{o}}dinger$ software suit version 10.4.018. Structural verification of protein models was done using Ramachandran plot, it was showing 96.0% residue in the favored region, which was verified using RAMPAGE. The phosphotriesterase protein was showing the highest structural similarity with hybrid protein having raw score 984. The 5 binding sites of hybrid protein were identified through binding site prediction. The docking study shows that hybrid protein potentially interacts with 10 different organophosphates. The study results indicate that the hybrid protein designed has the capability of degrading a wide range of organophosphate compounds.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.183-186
• /
• 2003

Hybrid genetic algorithms (HGAs) have been studied as various ways. These HGAs usually use both the global search property of genetic algorithm (GA) and the local search one of local search techniques. One of the general types, when constructing HGAs, is to incorporate a local search technique into GA loop, and then the local search technique is repeated as many iteration number as the loop. This paper proposes a new HGA with a conditional local search technique (c-HGA) that does not be repeated as many iteration number as GA loop. For effectiveness of the proposed c-HGA, a conventional HGA and GA are also suggested, and then these algorithms are compared with each other in numerical examples,

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제13권7호
• /
• pp.535-539
• /
• 2007

이동 ad-hoc 전술통신망에서 대체경로 라우팅 알고리즘의 적합성 및 생존성(survivability) 연구를 수행하였다. 이 통신망의 신호 방식은 공통선 신호 방식을 사용하며, 경로선정 방식은 Flood search routing을 사용하였으며, Restricted flooding과 Hybrid routing 에 대해 연결 성능을 분석하였다. 분석 결과 대체경로 라우팅을 함으로써 좀 더 낮은 차단확률(Blocking Probability)을 기대할 수 있었으며, 기존의 Flood search routing 의 연결 성능이 우수하여 생존성이 높은 것으로 판단되었다.

• 해양환경안전학회지
• /
• 제5권2호
• /
• pp.87-97
• /
• 1999

This study is concerned with developing a hybrid heuristic algorithm for solving the redundancy optimization problem which is very important in system safety, This study develops a HH(Hybrid Heuristic) method combined with two strategies to alleviate the risks of being trapped at a local optimum. One of them is to construct the populations of the initial solutions randomly. The other is the additional search with SA(Simulated Annealing) method in final step. Computational results indicate that HH performs consistently better than the KY method proposed in Kim[8]. Therefore, the proposed HH is believed to an attractive to other heuristic methods.

• Journal of Advanced Marine Engineering and Technology
• /
• 제35권3호
• /
• pp.341-347
• /
• 2011

The redundancy allocation problem (RAP) is a famous NP.complete problem that has beenstudied in the system reliability area of ships and airplanes. Recently meta-heuristic techniques have been applied in this topic, for example, genetic algorithms, simulated annealing and tabu search. In particular, tabu search (TS) has emerged as an efficient algorithmic approach for the series-parallel RAP. However, the quality of solutions found by TS depends on the initial solution. As a robust and efficient methodology for the series-parallel RAP, the hybrid metaheuristic (TSA) that is a interactive procedure between the TS and SA (simulated annealing) is developed in this paper. In the proposed algorithm, SA is used to find the diversified promising solutions so that TS can re-intensify search for the solutions obtained by the SA. We test the proposed TSA by the existing problems and compare it with the SA and TS algorithm. Computational results show that the TSA algorithm finds the global optimal solutions for all cases and outperforms the existing TS and SA in cases of 42 and 56 subsystems.

• 지능정보연구
• /
• 제13권3호
• /
• pp.63-82
• /
• 2007

본 논문에서는 유연제조시스템(FMS)에서 다단계스케줄링 문제를 효율적으로 해결하기 위한 적응형 혼합유전 알고리즘(ahGA) 접근법을 제안한다. 제안된 ahGA는 FMS의 해를 개선시키기 위하여 이웃탐색기법을 사용하며, 유전탐색과정에서의 수행도를 향상시키기 위해 유전알고리즘(GA)의 파라메터들을 조정하기 위한 적응형 구조를 사용한다. 수치실험에서는 제안된 ahGA와 기존의 알고리즘들 간의 수행도를 비교하기 위하여 두가지형태의 다단계스케줄링문제를 제시한다. 실험결과는 제안된 ahGA가 기존의 알고리즘들 보나 더 뛰어난 수행도를 보여주고 있다.

• 한국해양공학회지
• /
• 제17권6호
• /
• pp.38-46
• /
• 2003

Aim of this article is to propose Micro-Genetic Simulated Annealing (${\mu}GSA$) as a hybrid metaheuristics approach to find the global optimum of nonlinear optimisation problems. This approach combines the features of modern metaheuristics such as micro-genetic algorithm (${\mu}GAs$) and simulated annealing (SA) with the general robustness of parallel exploration and asymptotic convergence, respectively. Therefore, ${\mu}GSA$ approach can help in avoiding the premature convergence and can search for better global solution, because of its wide spread applicability, global perspective and inherent parallelism. For the superior performance of the ${\mu}GSA$, the five well-know benchmark test functions that were tested and compared with the two global optimisation approaches: scatter search (SS) and hybrid scatter genetic tabu (HSGT) approach. A practical application to structural sandwich panel is also examined by optimism the weight function. From the simulation results, it has been concluded that the proposed ${\mu}GSA$ approach is an effective optimisation tool for soloing continuous nonlinear global optimisation problems in suitable computational time frame.

• 한국통신학회논문지
• /
• 제31권7A호
• /
• pp.682-688
• /
• 2006

본 논문에서는 파일롯 채널(pilot channel)이 존재하는 직접확산 코드분할 다중접속 방식(DS-CDMA)에서 PN 코드의 초기 동기획득 성능을 개선하기 위해 연판정 기법을 사용하는 방법을 제안한다. 본 논문에서 제안하는 연판정 기법을 하이브리드 동기획득 알고리듬에 적용하고, 평균 동기획득 시간 측면에서 분석한다. 분석을 위해, 제안된 방식의 수학적 모델을 제시하고, IMT-2000 채널모델에서 시뮬레이션을 수행한다. 수식적인 분석 결과, 제안된 방식이 한 쌍의 임계치를 사용하는 기존 방식에 비해 평균 동기획득 시간에서 약 0.2초 내지 0.4초 정도의 성능향상을 가져오는 것을 보여준다. 이것은 연판정 기법이 기존의 경판정 기법의 사용으로 인한 성능열화를 보상함으로써 생기는 이득이라고 볼 수 있다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 하계학술대회 논문집 A
• /
• pp.36-38
• /
• 2004

This paper presents an application of parallel hybrid Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a recokiguration in distribution system. In parallel hybrid CA-TS, after CA operations, stings which are not emerged in the past population are selected in the reproduction procedure. After reproduction operation, if there are many strings which are in the past population, we add new random strings into the population, if there's no improvement for the predetermined iteration, local search procedure is executed by TS for the strings with high fitness function value. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a distribution system in the reference paper.