• Title/Summary/Keyword: Simple genetic algorithm

Search Result 299, Processing Time 0.023 seconds

Modeling of compressive strength of HPC mixes using a combined algorithm of genetic programming and orthogonal least squares

  • Mousavi, S.M.;Gandomi, A.H.;Alavi, A.H.;Vesalimahmood, M.
    • Structural Engineering and Mechanics
    • /
    • v.36 no.2
    • /
    • pp.225-241
    • /
    • 2010
  • In this study, a hybrid search algorithm combining genetic programming with orthogonal least squares (GP/OLS) is utilized to generate prediction models for compressive strength of high performance concrete (HPC) mixes. The GP/OLS models are developed based on a comprehensive database containing 1133 experimental test results obtained from previously published papers. A multiple least squares regression (LSR) analysis is performed to benchmark the GP/OLS models. A subsequent parametric study is carried out to verify the validity of the models. The results indicate that the proposed models are effectively capable of evaluating the compressive strength of HPC mixes. The derived formulas are very simple, straightforward and provide an analysis tool accessible to practicing engineers.

Genetic Algorithm based Hybrid Ensemble Model (유전자 알고리즘 기반 통합 앙상블 모형)

  • Min, Sung-Hwan
    • Journal of Information Technology Applications and Management
    • /
    • v.23 no.1
    • /
    • pp.45-59
    • /
    • 2016
  • An ensemble classifier is a method that combines output of multiple classifiers. It has been widely accepted that ensemble classifiers can improve the prediction accuracy. Recently, ensemble techniques have been successfully applied to the bankruptcy prediction. Bagging and random subspace are the most popular ensemble techniques. Bagging and random subspace have proved to be very effective in improving the generalization ability respectively. However, there are few studies which have focused on the integration of bagging and random subspace. In this study, we proposed a new hybrid ensemble model to integrate bagging and random subspace method using genetic algorithm for improving the performance of the model. The proposed model is applied to the bankruptcy prediction for Korean companies and compared with other models in this study. The experimental results showed that the proposed model performs better than the other models such as the single classifier, the original ensemble model and the simple hybrid model.

Parameter Identification of Induction Motors using Variable-weighted Cost Function of Genetic Algorithms

  • Megherbi, A.C.;Megherbi, H.;Benmahamed, K.;Aissaoui, A.G.;Tahour, A.
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.4
    • /
    • pp.597-605
    • /
    • 2010
  • This paper presents a contribution to parameter identification of a non-linear system using a new strategy to improve the genetic algorithm (GA) method. Since cost function plays an important role in GA-based parameter identification, we propose to improve the simple version of GA, where weights of the cost function are not taken as constant values, but varying along the procedure of parameter identification. This modified version of GA is applied to the induction motor (IM) as an example of nonlinear system. The GA cost function is the weighted sum of stator current and rotor speed errors between the plant and the model of induction motor. Simulation results show that the identification method based on improved GA is feasible and gives high precision.

Optimal Classifier Ensemble Design for Vehicle Detection Using GAVaPS (자동차 검출을 위한 GAVaPS를 이용한 최적 분류기 앙상블 설계)

  • Lee, Hee-Sung;Lee, Jae-Hung;Kim, Eun-Tai
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.1
    • /
    • pp.96-100
    • /
    • 2010
  • This paper proposes novel genetic design of optimal classifier ensemble for vehicle detection using Genetic Algorithm with Varying Population Size (GAVaPS). Recently, many classifiers are used in classifier ensemble to deal with tremendous amounts of data. However the problem has a exponential large search space due to the increasing the number of classifier pool. To solve this problem, we employ the GAVaPS which outperforms comparison with simple genetic algorithm (SGA). Experiments are performed to demonstrate the efficiency of the proposed method.

Determination of Optimal Excimer Laser Ablation Conditions Using Genetic Algorithm (유전자 알고리즘을 이용한 엑시머 레이저가공의 최적조건 선정)

  • 배창현;최경현;이석희
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.11 no.6
    • /
    • pp.17-23
    • /
    • 2002
  • A new 3D micromachining method called Hole Area Modulation(HAM), has been introduced to enhance the current micromachining technology. In this method, information on the depth of machining is converted to the sizes of small holes in the mask. The machining is carried out with a simple 2D movement of the workpiece. This method can be applied for machining various kinds of microcavities in various materials. In this paper, a machematical model for excimer laser micromachining based on HAM and also determination of optimal laser ablation conditions(width hole radius, step size, path, etc.) is performed by Genetic Algorithm(GA).

Optimization of Random Subspace Ensemble for Bankruptcy Prediction (재무부실화 예측을 위한 랜덤 서브스페이스 앙상블 모형의 최적화)

  • Min, Sung-Hwan
    • Journal of Information Technology Services
    • /
    • v.14 no.4
    • /
    • pp.121-135
    • /
    • 2015
  • Ensemble classification is to utilize multiple classifiers instead of using a single classifier. Recently ensemble classifiers have attracted much attention in data mining community. Ensemble learning techniques has been proved to be very useful for improving the prediction accuracy. Bagging, boosting and random subspace are the most popular ensemble methods. In random subspace, each base classifier is trained on a randomly chosen feature subspace of the original feature space. The outputs of different base classifiers are aggregated together usually by a simple majority vote. In this study, we applied the random subspace method to the bankruptcy problem. Moreover, we proposed a method for optimizing the random subspace ensemble. The genetic algorithm was used to optimize classifier subset of random subspace ensemble for bankruptcy prediction. This paper applied the proposed genetic algorithm based random subspace ensemble model to the bankruptcy prediction problem using a real data set and compared it with other models. Experimental results showed the proposed model outperformed the other models.

A robust genetic algorithm for structural optimization

  • Chen, S.Y.;Rajan, S.D.
    • Structural Engineering and Mechanics
    • /
    • v.10 no.4
    • /
    • pp.313-336
    • /
    • 2000
  • The focus of this paper is on the development and implementation of a methodology for automated design of discrete structural systems. The research is aimed at utilizing Genetic Algorithms (GA) as an automated design tool. Several key enhancements are made to the simple GA in order to increase the efficiency, reliability and accuracy of the methodology for code-based design of structures. The AISC-ASD design code is used to illustrate the design methodology. Small as well as large-scale problems are solved. Simultaneous sizing, shape and topology optimal designs of structural framed systems subjected to static and dynamic loads are considered. Comparisons with results from prior publications and solution to new problems show that the enhancements made to the GA do indeed make the design system more efficient and robust.

Development of a Personalized Similarity Measure using Genetic Algorithms for Collaborative Filtering

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.12
    • /
    • pp.219-226
    • /
    • 2018
  • Collaborative filtering has been most popular approach to recommend items in online recommender systems. However, collaborative filtering is known to suffer from data sparsity problem. As a simple way to overcome this problem in literature, Jaccard index has been adopted to combine with the existing similarity measures. We analyze performance of such combination in various data environments. We also find optimal weights of factors in the combination using a genetic algorithm to formulate a similarity measure. Furthermore, optimal weights are searched for each user independently, in order to reflect each user's different rating behavior. Performance of the resulting personalized similarity measure is examined using two datasets with different data characteristics. It presents overall superiority to previous measures in terms of recommendation and prediction qualities regardless of the characteristics of the data environment.

Slope Stability Analysis Using the Genetic Algorithm (유전자 알고리즘을 이용한 사면안정 해석)

  • 신방웅;백승철;김홍택;황정순
    • Journal of the Korean Geotechnical Society
    • /
    • v.18 no.6
    • /
    • pp.117-127
    • /
    • 2002
  • A deterministic approach of slope stability, which is generally corresponding to the model of a simple non-linear function for slopes, is problematic in that it does not account the versatile characteristics of ground layers in an effective way. To resolve this problem, this study proposes a new way of analyzing slope stability, so-called “genetic algorithm method, ” so as to reflect some particular conditions pertaining to the grounds under concern. Similarities and differences in slope stability that may exist between homogeneous and multiple ground layers are examined in a competitive manner, Overall, though similarities deemed a little bit salient, the algorithm method turned out to be very applicable to estimating the validity of slope stability. Furthermore, an additional effort to consider long-standing sequential and dynamic changes in both the amount of rainfall and the underground water level is made in order to improve the results.

An Automatic Rhythm and Melody Composition System Considering User Parameters and Chord Progression Based on a Genetic Algorithm (유전알고리즘 기반의 사용자 파라미터 설정과 코드 진행을 고려한 리듬과 멜로디 자동 작곡 시스템)

  • Jeong, Jaehun;Ahn, Chang Wook
    • Journal of KIISE
    • /
    • v.43 no.2
    • /
    • pp.204-211
    • /
    • 2016
  • In this paper, we propose an automatic melody composition system that can generate a sophisticated melody by adding non-harmony tone in the given chord progression. An overall procedure consists of two steps, which are the rhythm generation and melody generation parts. In the rhythm generation part, we designed new fitness functions for rhythm that can be controlled by a user setting parameters. In the melody generation part, we designed new fitness functions for melody based on harmony theory. We also designed evolutionary operators that are conducted by considering a musical context to improve computational efficiency. In the experiments, we compared four metaheuristics to optimize the rhythm fitness functions: Simple Genetic Algorithm (SGA), Elitism Genetic Algorithm (EGA), Differential Evolution (DE), and Particle Swarm Optimization (PSO). Furthermore, we compared proposed genetic algorithm for melody with the four algorithms for verifying performance. In addition, composition results are introduced and analyzed with respect to musical correctness.