• Title/Summary/Keyword: Hybrid algorithms

Search Result 578, Processing Time 0.034 seconds

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.

Trend Analysis of High-Performance Distributed Consensus Algorithms (고성능 분산 합의 알고리즘 동향 분석)

  • Jin, H.S.;Kim, D.O.;Kim, Y.C.;Oh, J.T.;Kim, K.Y.
    • Electronics and Telecommunications Trends
    • /
    • v.37 no.1
    • /
    • pp.63-72
    • /
    • 2022
  • Recently, blockchain has been attracting attention as a high-reliability technology in various fields. However, the Proof-of-Work-based distributed consensus algorithm applied to representative blockchains, such as Bitcoin and Ethereum, has limitations in applications to various industries owing to its excessive resource consumption and performance limitations. To overcome these limitations, various distributed consensus algorithms have appeared, and recently, hybrid distributed consensus algorithms that use two or more consensus algorithms to achieve decentralization and scalability have emerged. This paper introduces the technological trends of the latest high-performance distributed consensus algorithms by analyzing representative hybrid distributed consensus algorithms.

A Study on Compressor Map Generation of a Gas Turbine Engine Using Hybrid Intelligent Method (하이브리드 기법을 이용한 가스터빈 엔진의 압축기 성능선도 생성에 관한 연구)

  • Kong, Chang-Duk;Kho, Seong-Hee;Ki, Ja-Young
    • Journal of the Korean Society of Propulsion Engineers
    • /
    • v.10 no.4
    • /
    • pp.54-60
    • /
    • 2006
  • A method for generating the compressor map from some performance measuring data using the hybrid intelligent technique was newly proposed. In order to improve accuracy of the traditional scaling method, a method to generate the compressor map using the GAs(Genetic Algorithms) was previously proposed, but the method has a drawback that it can not find correctly surge and choke points of the compressor map. However, the proposed hybrid intelligent method can determine obviously those points as well as improve the accuracy of the compressor map through complementarily using the GAs and the scaling method.

Rule-based Coordination Algorithms for Improving Energy Efficiency of PV-Battery Hybrid System (태양광-배터리 하이브리드 전원시스템의 에너지 효율개선을 위한 규칙기반 협조제어 원리)

  • Yoo, Cheol-Hee;Chung, Il-Yop;Hong, Sung-Soo;Jang, Byung-Jun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.61 no.12
    • /
    • pp.1791-1800
    • /
    • 2012
  • This paper presents effective design schemes for a photovoltaic (PV) and battery hybrid system that includes state-of-the-art technologies such as maximum power point tracking scheme for PV arrays, an effective charging/discharging circuit for batteries, and grid-interfacing power inverters. Compared to commonly-used PV systems, the proposed configuration has more flexibility and autonomy in controlling individual components of the PV-battery hybrid system. This paper also proposes an intelligent coordination scheme for the components of the PV-battery hybrid system to improve the efficiency of renewable energy resources and peak-load management. The proposed algorithm is based on a rule-based expert system that has excellent capability to optimize multi-objective functions. The proposed configuration and algorithms are investigated via switching-level simulation studies of the PV-battery hybrid system.

An Effective Anomaly Detection Approach based on Hybrid Unsupervised Learning Technologies in NIDS

  • Kangseok Kim
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.2
    • /
    • pp.494-510
    • /
    • 2024
  • Internet users are exposed to sophisticated cyberattacks that intrusion detection systems have difficulty detecting. Therefore, research is increasing on intrusion detection methods that use artificial intelligence technology for detecting novel cyberattacks. Unsupervised learning-based methods are being researched that learn only from normal data and detect abnormal behaviors by finding patterns. This study developed an anomaly-detection method based on unsupervised machines and deep learning for a network intrusion detection system (NIDS). We present a hybrid anomaly detection approach based on unsupervised learning techniques using the autoencoder (AE), Isolation Forest (IF), and Local Outlier Factor (LOF) algorithms. An oversampling approach that increased the detection rate was also examined. A hybrid approach that combined deep learning algorithms and traditional machine learning algorithms was highly effective in setting the thresholds for anomalies without subjective human judgment. It achieved precision and recall rates respectively of 88.2% and 92.8% when combining two AEs, IF, and LOF while using an oversampling approach to learn more unknown normal data improved the detection accuracy. This approach achieved precision and recall rates respectively of 88.2% and 94.6%, further improving the detection accuracy compared with the hybrid method. Therefore, in NIDS the proposed approach provides high reliability for detecting cyberattacks.

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.

Bankruptcy predictions for Korea medium-sized firms using neural networks and case based reasoning

  • Han, Ingoo;Park, Cheolsoo;Kim, Chulhong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.10a
    • /
    • pp.203-206
    • /
    • 1996
  • Prediction of firm bankruptcy have been extensively studied in accounting, as all stockholders in a firm have a vested interest in monitoring its financial performance. The objective of this paper is to develop the hybrid models for bankruptcy prediction. The proposed hybrid models are two phase. Phase one are (a) DA-assisted neural network, (b) Logit-assisted neural network, and (c) Genetic-assisted neural network. And, phase two are (a) DA-assisted Case based reasoning, and (b) Genetic-assisted Case based reasoning. In the variables selection, We are focusing on three alternative methods - linear discriminant analysis, logit analysis and genetic algorithms - that can be used empirically select predictors for hybrid model in bankruptcy prediction. Empirical results using Korean medium-sized firms data show that hybrid models are very promising neural network models and case based reasoning for bankruptcy prediction in terms of predictive accuracy and adaptability.

  • PDF

A hybrid CSS and PSO algorithm for optimal design of structures

  • Kaveh, A.;Talatahari, S.
    • Structural Engineering and Mechanics
    • /
    • v.42 no.6
    • /
    • pp.783-797
    • /
    • 2012
  • A new hybrid meta-heuristic optimization algorithm is presented for design of structures. The algorithm is based on the concepts of the charged system search (CSS) and the particle swarm optimization (PSO) algorithms. The CSS is inspired by the Coulomb and Gauss's laws of electrostatics in physics, the governing laws of motion from the Newtonian mechanics, and the PSO is based on the swarm intelligence and utilizes the information of the best fitness historically achieved by the particles (local best) and by the best among all the particles (global best). In the new hybrid algorithm, each agent is affected by local and global best positions stored in the charged memory considering the governing laws of electrical physics. Three different types of structures are optimized as the numerical examples with the new algorithm. Comparison of the results of the hybrid algorithm with those of other meta-heuristic algorithms proves the robustness of the new algorithm.

Hybrid Multi-layer Perceptron with Fuzzy Set-based PNs with the Aid of Symbolic Coding Genetic Algorithms

  • Roh, Seok-Beom;Oh, Sung-Kwun;Ahn, Tae-Chon
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.155-157
    • /
    • 2005
  • We propose a new category of hybrid multi-layer neural networks with hetero nodes such as Fuzzy Set based Polynomial Neurons (FSPNs) and Polynomial Neurons (PNs). These networks are based on a genetically optimized multi-layer perceptron. We develop a comprehensive design methodology involving mechanisms of genetic optimization and genetic algorithms, in particular. The augmented genetically optimized HFPNN (namely gHFPNN) results in a structurally optimized structure and comes with a higher level of flexibility in comparison to the one we encounter in the conventional HFPNN. The GA-based design procedure being applied at each layer of HFPNN leads to the selection of preferred nodes (FPNs or PNs) available within the HFPNN. In the sequel, two general optimization mechanisms are explored. First, the structural optimization is realized via GAs whereas the ensuing detailed parametric optimization is carried out in the setting of a standard least square method-based learning. The performance of the gHFPNNs quantified through experimentation where we use a number of modeling benchmarks-synthetic and experimental data already experimented with in fuzzy or neurofuzzy modeling.

  • PDF

An efficient iterative improvement technique for VLSI circuit partitioning using hybrid bucket structures (하이브리드 버켓을 이용한 대규모 집적회로에서의 효율적인 분할 개선 방법)

  • 임창경;정정화
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.3
    • /
    • pp.16-23
    • /
    • 1998
  • In this paper, we present a fast and efficient Iterative Improvement Partitioning(IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. The IIP algorithms are very widely used in VLSI circuit partition due to their time efficiency. As the performance of these algorithms depends on choices of moving cell, various methods have been proposed. Specially, Cluster-Removal algorithm by S. Dutt significantly improved partition quality. We indicate the weakness of previous algorithms wjere they used a uniform method for choice of cells during for choice of cells during the improvement. To solve the problem, we propose a new IIP technique that selects the method for choice of cells according to the improvement status and present hybrid bucket structures for easy implementation. The time complexity of proposed algorithm is the same with FM method and the experimental results on ACM/SIGDA benchmark circuits show improvment up to 33-44%, 45%-50% and 10-12% in cutsize over FM, LA-3 and CLIP respectively. Also with less CUP tiem, it outperforms Paraboli and MELO represented constructive-partition methods by about 12% and 24%, respectively.

  • PDF