• Title/Summary/Keyword: Hybrid search

Search Result 409, Processing Time 0.028 seconds

An Efficient Center-Biased Hybrid Search Algorithm (효율적인 Center-Biased Hybrid 탐색 알고리즘)

  • Su-Bong Hong;Soo-Mok Jung
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.12
    • /
    • pp.1075-1082
    • /
    • 2003
  • In this paper, we propose an Efficient Center-Biased Hybrid Seearch (ECBHS) for motion estimation based on Center-Biased Hybrid Search(CBHS). This proposed algorithm employ hybrid of a compact plus shaped search, X shaped search, and diamond search to reduce the search point for motion vectors which distributed within 3pels radius of center of search window. ECBHS reduces the computations for motion estimation of CBHS with similar accuracy The efficiency of the proposed algorithm was verified by experimental results.

  • PDF

A Hybrid of Evolutionary Search and Local Heuristic Search for Combinatorial Optimization Problems

  • Park, Lae-Jeong;Park, Cheol-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.1 no.1
    • /
    • pp.6-12
    • /
    • 2001
  • Evolutionary algorithms(EAs) have been successfully applied to many combinatorial optimization problems of various engineering fields. Recently, some comparative studies of EAs with other stochastic search algorithms have, however, shown that they are similar to, or even are not comparable to other heuristic search. In this paper, a new hybrid evolutionary algorithm utilizing a new local heuristic search, for combinatorial optimization problems, is presented. The new intelligent local heuristic search is described, and the behavior of the hybrid search algorithm is investigated on two well-known problems: traveling salesman problems (TSPs), and quadratic assignment problems(QAPs). The results indicate that the proposed hybrid is able to produce solutions of high quality compared with some of evolutionary and simulated annealing.

  • PDF

A Study on the Retrieval Effectiveness Based on Image Query Types (이미지 인지 유형 및 검색질의 방식에 따른 검색 효율성에 관한 연구)

  • Kim, Seonghee;Yi, Keunyoung
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.47 no.3
    • /
    • pp.321-342
    • /
    • 2013
  • The purpose of this study was to compare and evaluate retrieval effectiveness of three types of image perception using different retrieval methods. Image types included specific, general, and abstract topics. The retrieval method included text only search, query by example (QBE) search, and a hybrid/hybrid search. Thirty-two college students were recruited for searching topics using Google image search system. The search results were compared with One-Way and Two-Way ANOVA. As a result, text search and hybrid search showed advantage when searching for specific and general topics. On the other hand, the QBE search performed better than both the text-only and hybrid search for abstract topics. The results have implications for the implementation of image retrieval systems.

Hybrid Genetic and Local Search (HGLS) Algorithm for Channel Assignment in FDMA Wireless Communication Network (FDMA 무선통신 네트워크에서 채널할당을 위한 HGLS 알고리듬)

  • Kim, Sung-Soo;Min, Seung-Ki
    • IE interfaces
    • /
    • v.18 no.4
    • /
    • pp.504-511
    • /
    • 2005
  • The NP-hard channel assignment problem becomes more and more important to use channels as efficiently as possible because there is a rapidly growing demand and the number of usable channel is very limited. The hybrid genetic and local search (HGLS) method in this paper is a hybrid method of genetic algorithm with no interference channel assignment (NICA) in clustering stage for diversified search and local search in tuning stage when the step of search is near convergence for minimizing blocking calls. The new representation of solution is also proposed for effective search and computation for channel assignment.

Hybrid Genetic Algorithms for Feature Selection and Classification Performance Comparisons (특징 선택을 위한 혼합형 유전 알고리즘과 분류 성능 비교)

  • 오일석;이진선;문병로
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.8
    • /
    • pp.1113-1120
    • /
    • 2004
  • This paper proposes a novel hybrid genetic algorithm for the feature selection. Local search operations are devised and embedded in hybrid GAs to fine-tune the search. The operations are parameterized in terms of the fine-tuning power, and their effectiveness and timing requirement are analyzed and compared. Experimentations performed with various standard datasets revealed that the proposed hybrid GA is superior to a simple GA and sequential search algorithms.

Hybrid Approach for Solving Manufacturing Optimization Problems (제조최적화문제 해결을 위한 혼합형 접근법)

  • Yun, YoungSu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.20 no.6
    • /
    • pp.57-65
    • /
    • 2015
  • Manufacturing optimization problem is to find the optimal solution under satisfying various and complicated constraints with the design variables of nonlinear types. To achieve the objective, this paper proposes a hybrid approach. The proposed hybrid approach is consist of genetic algorithm(GA), cuckoo search(CS) and hill climbing method(HCM). First, the GA is used for global search. Secondly, the CS is adapted to overcome the weakness of GA search. Lastly, the HCM is applied to search precisely the convergence space after the GA and CS search. In experimental comparison, various types of manufacturing optimization problems are used for comparing the efficiency between the proposed hybrid approach and other conventional competing approaches using various measures of performance. The experimental result shows that the proposed hybrid approach outperforms the other conventional competing approaches.

Optimal Environmental and Economic Operation using Evolutionary Computation and Neural Networks (진화연산과 신경망이론을 이용한 전력계통의 최적환경 및 경제운용)

  • Rhee, Sang-Bong;Kim, Kyu-Ho;You, Seok-Ku
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.12
    • /
    • pp.1498-1506
    • /
    • 1999
  • In this paper, a hybridization of Evolutionary Strategy (ES) and a Two-Phase Neural Network(TPNN) is applied to the optimal environmental and economic operation. As the evolutionary computation, ES is to search for the global optimum based on natural selection and genetics but it shows a defect of reducing the convergence rate in the latter part of search, and often does not search the exact solution. Also, neural network theory as a local search technique can be used to search a more exact solution. But it also has the defect that a solution frequently sticks to the local region. So, new algorithm is presented as hybrid methods by combining merits of two methods. The hybrid algorithm has been tested on Emission Constrained Economic Dispatch (ECED) problem and Weighted Emission Economic Dispatch (WEED) problem for optimal environmental and economic operation. The result indicated that the hybrid approach can outperform the other computational efficiency and accuracy.

  • PDF

Classification of Web Search Engines and Necessity of a Hybrid Search Engine (웹 검색엔진 분류 및 하이브리드 검색엔진의 필요성)

  • Paik, Juryon
    • Journal of Digital Contents Society
    • /
    • v.19 no.4
    • /
    • pp.719-729
    • /
    • 2018
  • Abstract In 2017, it has been reported that Google had more than 90% of the market share in search-engines of desktops and mobiles. Most people may consider that Google surely searches the entire web area. However, according to many researches for web data, Google only searches less than 10%, surprisingly. The most region is called the Deep Web, and it is indexable by special search engines, which are different from Google because they focus on a specific segment of interest. Those engines build their own deep-web databases and run particular algorithms to provide accurate and professional search results. There is no search engine that indexes the entire Web, currently. The best way is to use several search engines together for broad and efficient searches as best as possible. This paper defines that kind of search engine as Hybrid Search Engine and provides characteristics and differences compared to conventional search engines, along with a frame of hybrid search engine.

A hybrid tabu-simulated annealing heuristic algorithm for optimum design of steel frames

  • Degertekin, S.O.;Hayalioglu, M.S.;Ulker, M.
    • Steel and Composite Structures
    • /
    • v.8 no.6
    • /
    • pp.475-490
    • /
    • 2008
  • A hybrid tabu-simulated annealing algorithm is proposed for the optimum design of steel frames. The special character of the hybrid algorithm is that it exploits both tabu search and simulated annealing algorithms simultaneously to obtain near optimum. The objective of optimum design problem is to minimize the weight of steel frames under the actual design constraints of AISC-LRFD specification. The performance and reliability of the hybrid algorithm were compared with other algorithms such as tabu search, simulated annealing and genetic algorithm using benchmark examples. The comparisons showed that the hybrid algorithm results in lighter structures for the presented examples.

Hybrid PSO-Complex Algorithm Based Parameter Identification for a Composite Load Model

  • Del Castillo, Manuelito Y. Jr.;Song, Hwachang;Lee, Byongjun
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.3
    • /
    • pp.464-471
    • /
    • 2013
  • This paper proposes a hybrid searching algorithm based on parameter identification for power system load models. Hybrid searching was performed by the combination of particle swarm optimization (PSO) and a complex method, which enhances the convergence of solutions closer to minima and takes advantage of global searching with PSO. In this paper, the load model of interest is composed of a ZIP model and a third-order model for induction motors for stability analysis, and parameter sets are obtained that best-fit the output measurement data using the hybrid search. The origin of the hybrid method is to further apply the complex method as a local search for finding better solutions using the selected particles from the performed PSO procedure.