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

This paper presents an application of parallel hybrid Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution system. In parallel hybrid GA-TS, after GA operations, strings 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 f 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 practical distribution system in Korea.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2002년도 춘계학술대회 논문집 센서 박막재료 반도체재료 기술교육
• /
• pp.35-38
• /
• 2002

In this paper, for digital x-ray conversion receptor development studied by hybrid technology of based on CdZnTe. For this study, First searched fabricate method of CdZnTe x-ray receptor. Second, search the phosphor material & fabricate method for scintillator layer. Fabricated sample is analyzed with physical & electric measurement. This result is showed good SNR ratio hybrid thechnology with direct method & indirect method. In this paper offer the method can reduce the dark-current in the hybrid X-ray detector.

• Journal of Computing Science and Engineering
• /
• 제8권4호
• /
• pp.199-206
• /
• 2014

The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

• Journal of Life Science
• /
• 제9권2호
• /
• pp.52-56
• /
• 1999

The Raf, a cytoplasmic serine/thereonine protein kinase, acts as an important mediator of signals involving cell proliferation, differentiation and development. Multiple regulatory elements should participate in the expression of D-raf, Drosophila homolog of human c-raf-1. In order to search regulatory factors involved in the D-raf promoter activation, we accomplished the yeast one-hybrid screening using D-raf promoter region from bp-330 to -309 with respect to the transcription initiation site as bait. After screening, sixteen independent positive clones of ${\beta}$-galactosidase activties were identified and sequenced. Two clones having 94-98% identity with daughterless and one clone having 93% identity with escargot by Blast search among these clones were screened.

• 산업공학
• /
• 제8권1호
• /
• pp.23-30
• /
• 1995

Optimization in the engineering design is to select the best of many possible design alternatives in a complex design space. One major problem of local minimization algorithm is that they often result in local optima. In this paper, a hybrid method was developed by coupling the genetic algorithm and a traditional direct search method. The proposed method first finds a region for possible global optimum using the genetic algorithm and then searchs for a global optimum using the direct search method. To evaluate the performance of the hybrid method, it was applied to three test problems and a problem of designing corrugate bulkhead of a ship.

• 대한안전경영과학회지
• /
• 제13권3호
• /
• pp.107-114
• /
• 2011

Traveling salesman problem is to minimize the total cost for a traveling salesman who wants to make a tour given finite number of cities along with the cost of travel between each pair them, visiting each cities exactly once before returning home. Traveling salesman problem is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study suggests a hybrid parallel genetic algorithm(HPGA) for traveling salesman problem The suggested algorithm combines parallel genetic algorithm, nearest neighbor search, and 2-opt. The suggested algorithm has been tested on 7 problems in TSPLIB and compared the results of existing methods(heuristics, meta-heuristics, hybrid, and parallel). Experimental results shows that HPGA could obtain good solution in total travel distance minimization.

• Geomechanics and Engineering
• /
• 제36권1호
• /
• pp.83-97
• /
• 2024

It is important to make reasonable prediction about the long-term deformation of high rockfill geostructures. However, the deformation is usually underestimated using the rockfill parameters obtained from laboratory tests due to different size effects, which make it necessary to identify parameters from in-situ monitoring data. This paper proposes a novel hybrid back-analysis method with a modified objective function defined for the time-dependent back-analysis problem. The method consists of two stages. In the first stage, an improved weighted average method is proposed to quickly narrow the search region; while in the second stage, an adaptive response surface method is proposed to iteratively search for the satisfactory solution, with a technique that can adaptively consider the translation, contraction or expansion of the exploration region. The accuracy and computational efficiency of the proposed hybrid back-analysis method is demonstrated by back-analyzing the long-term deformation of two high embankments constructed for airport runways, with the rockfills being modeled by a rheological model considering the influence of stress states on the creep behavior.

• 산업경영시스템학회지
• /
• 제29권3호
• /
• pp.62-69
• /
• 2006

Vehicle routing problem with time windows is determined each vehicle route in order to minimize the transportation costs. All delivery points in geography have various time restriction in camparision with the basic vehicle routing problem. Vechicle routing problem with time windows is known to be NP-hard, and it needs a lot of computing time to get the optimal solution, so that heuristics are more frequently developed than optimal algorithms. This study aims to develop a heuristic method which combines guided local search with a tabu search in order to minimize the transportation costs for the vehicle routing assignment and uses ILOG programming library to solve. The computational tests were performed using the benchmark problems.

• 한국통신학회논문지
• /
• 제21권3호
• /
• pp.684-691
• /
• 1996

Since the period of a spreading code in DS/SS communication systems is generally long, it is necessary to make the code acquisition as fast as possible. The code acquisition time can be sued as a measure to evaluate the performance of code acquisition systems. The search rate of serial search codee acquisition system used in the coventional CDMA cellular system is lower than that of the matched filter technique. In order to reduce the code acquisition time, this paper proposes hybrid code acquisition system composed filters combined with serial search blocks. In the proposed system, the matched filter sweeps possible code phases fast and the acquired phase information is verified by the serial search block. The mean and the variance of its acquisition time are calculated and compared with those of double dwell serial search system. The results indicate better performance of the proposed system by yielding its small vaues of the mean and the variance of code acquisition time.

• International journal of advanced smart convergence
• /
• 제12권1호
• /
• pp.1-8
• /
• 2023

Smart IoT over high speed network and high performance smart devices explodes the ubiquitous services and applications. Nearest Neighbor(NN) query is one of the important type of queries that have to be supported for ubiquitous information services. In order to process efficiently NN queries in the wireless broadcast environment, it is important that the clients determine quickly the search space and filter out NN from the candidates containing the search space. In this paper, we propose a hybrid index of Voronoi and grid partition to provide quick search space decision and rapid filtering out NN from the candidates. Grid partition plays the role of helping quick search space decision and Voronoi partition providing the rapid filtering. We show the effectiveness of the proposed index by comparing the existing indexing schemes in the access time and tuning time. The evaluation shows the proposed index scheme makes the two performance parameters improved than the existing schemes.