• Title/Summary/Keyword: genetic programming

Search Result 384, Processing Time 0.034 seconds

Modelling the performance of self-compacting SIFCON of cement slurries using genetic programming technique

  • Cevik, Abdulkadir;Sonebi, Mohammed
    • Computers and Concrete
    • /
    • v.5 no.5
    • /
    • pp.475-490
    • /
    • 2008
  • The paper explores the potential of applicability of Genetic programming approach (GP), adopted in this investigation, to model the combined effects of five independent variables to predict the mini-slump, the plate cohesion meter, the induced bleeding test, the J-fiber penetration value, and the compressive strength at 7 and 28 days of self-compacting slurry infiltrated fiber concrete (SIFCON). The variables investigated were the proportions of limestone powder (LSP) and sand, the dosage rates of superplasticiser (SP) and viscosity modifying agent (VMA), and water-to-binder ratio (W/B). Twenty eight mixtures were made with 10-50% LSP as replacement of cement, 0.02-0.06% VMA by mass of cement, 0.6-1.2% SP and 50-150% sand (% mass of binder) and 0.42-0.48 W/B. The proposed genetic models of the self-compacting SIFCON offer useful modelling approach regarding the mix optimisation in predicting the fluidity, the cohesion, the bleeding, the penetration, and the compressive strength.

Hardware Evolution Based on Genetic Programming (유전자 프로그래밍 기반의 하드웨어 진화 기법)

  • Seok, Ho-Sik;Yi, Kang;Zhang, Byoung-Tak
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.452-455
    • /
    • 1999
  • We introduce an evolutionary approach to on-line learning for mobile robot control using reconfigurable hardware. We use genetic programming as an evolutionary engine. Control programs are encoded in tree structure. Genetic operators, such as node mutation, adapt the program trees based on a set of training cases. This paper discusses the advantages and constraints of the evolvable hardware approach to robot learning and describes a FPGA implementation of the presented genetic programming method.

  • PDF

A Decision Tree Induction using Genetic Programming with Sequentially Selected Features (순차적으로 선택된 특성과 유전 프로그래밍을 이용한 결정나무)

  • Kim Hyo-Jung;Park Chong-Sun
    • Korean Management Science Review
    • /
    • v.23 no.1
    • /
    • pp.63-74
    • /
    • 2006
  • Decision tree induction algorithm is one of the most widely used methods in classification problems. However, they could be trapped into a local minimum and have no reasonable means to escape from it if tree algorithm uses top-down search algorithm. Further, if irrelevant or redundant features are included in the data set, tree algorithms produces trees that are less accurate than those from the data set with only relevant features. We propose a hybrid algorithm to generate decision tree that uses genetic programming with sequentially selected features. Correlation-based Feature Selection (CFS) method is adopted to find relevant features which are fed to genetic programming sequentially to find optimal trees at each iteration. The new proposed algorithm produce simpler and more understandable decision trees as compared with other decision trees and it is also effective in producing similar or better trees with relatively smaller set of features in the view of cross-validation accuracy.

Automatic Gait Generation for Quadruped Robot Using a GP Based Evolutionary Method in Joint Space (관절 공간에서의 GP 기반 진화기법을 이용한 4족 보행로봇의 걸음새 자동생성)

  • Seo, Ki-Sung;Hyun, Soo-Hwan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.6
    • /
    • pp.573-579
    • /
    • 2008
  • This paper introduces a new approach to develop a fast gait for quadruped robot using GP(genetic programming). Planning gaits for legged robots is a challenging task that requires optimizing parameters in a highly irregular and multidimensional space. Several recent approaches have focused on using GA(genetic algorithm) to generate gait automatically and shown significant improvement over previous results. Most of current GA based approaches used pre-selected parameters, but it is difficult to select the appropriate parameters for the optimization of gait. To overcome these problems, we proposed an efficient approach which optimizes joint angle trajectories using genetic programming. Our GP based method has obtained much better results than GA based approaches for experiments of Sony AIBO ERS-7 in Webots environment.

A Comparative Study of Genetic Algorithm and Mathematical Programming Technique applied in Design Optimization of Geodesic Dome (지오데식 돔의 설계최적화에서 유전알고리즘과 수학적계획법의 비교연구)

  • Lee, Sang-Jin;Lee, Hyeon-Jin
    • Proceeding of KASS Symposium
    • /
    • 2008.05a
    • /
    • pp.101-106
    • /
    • 2008
  • This paper describes a comparative study of genetic algorithm and mathematical programming technique applied in the design optimization of geodesic dome. In particular, the genetic algorithm adopted in this study uses the so-called re-birthing technique together with the standard GA operations such as fitness, selection, crossover and mutation to accelerate the searching process. The finite difference method is used to calculate the design sensitivity required in mathematical programming techniques and three different techniques such as sequential linear programming (SLP), sequential quadratic programming(SQP) and modified feasible direction method(MFDM) are consistently used in the design optimization of geodesic dome. The optimum member sizes of geodesic dome against several external loads is evaluated by the codes $ISADO-GA{\alpha}$ and ISADO-OPT. From a numerical example, we found that both optimization techniques such as GA and mathematical programming technique are very effective to calculate the optimum member sizes of three dimensional discrete structures and it can provide a very useful information on the existing structural system and it also has a great potential to produce new structural system for large spatial structures.

  • PDF

A Crash Prediction Model for Expressways Using Genetic Programming (유전자 프로그래밍을 이용한 고속도로 사고예측모형)

  • Kwak, Ho-Chan;Kim, Dong-Kyu;Kho, Seung-Young;Lee, Chungwon
    • Journal of Korean Society of Transportation
    • /
    • v.32 no.4
    • /
    • pp.369-379
    • /
    • 2014
  • The Statistical regression model has been used to construct crash prediction models, despite its limitations in assuming data distribution and functional form. In response to the limitations associated with the statistical regression models, a few studies based on non-parametric methods such as neural networks have been proposed to develop crash prediction models. However, these models have a major limitation in that they work as black boxes, and therefore cannot be directly used to identify the relationships between crash frequency and crash factors. A genetic programming model can find a solution to a problem without any specified assumptions and remove the black box effect. Hence, this paper investigates the application of the genetic programming technique to develope the crash prediction model. The data collected from the Gyeongbu expressway during the past three years (2010-2012), were separated into straight and curve sections. The random forest technique was applied to select the important variables that affect crash occurrence. The genetic programming model was developed based on the variables that were selected by the random forest. To test the goodness of fit of the genetic programming model, the RMSE of each model was compared to that of the negative binomial regression model. The test results indicate that the goodness of fit of the genetic programming models is superior to that of the negative binomial models.

An evolutionary system for the prediction of high performance concrete strength based on semantic genetic programming

  • Castelli, Mauro;Trujillo, Leonardo;Goncalves, Ivo;Popovic, Ales
    • Computers and Concrete
    • /
    • v.19 no.6
    • /
    • pp.651-658
    • /
    • 2017
  • High-performance concrete, besides aggregate, cement, and water, incorporates supplementary cementitious materials, such as fly ash and blast furnace slag, and chemical admixture, such as superplasticizer. Hence, it is a highly complex material and modeling its behavior represents a difficult task. This paper presents an evolutionary system for the prediction of high performance concrete strength. The proposed framework blends a recently developed version of genetic programming with a local search method. The resulting system enables us to build a model that produces an accurate estimation of the considered parameter. Experimental results show the suitability of the proposed system for the prediction of concrete strength. The proposed method produces a lower error with respect to the state-of-the art technique. The paper provides two contributions: from the point of view of the high performance concrete strength prediction, a system able to outperform existing state-of-the-art techniques is defined; from the machine learning perspective, this case study shows that including a local searcher in the geometric semantic genetic programming system can speed up the convergence of the search process.

Performance Comparison between Neural Network and Genetic Programming Using Gas Furnace Data

  • Bae, Hyeon;Jeon, Tae-Ryong;Kim, Sung-Shin
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.4
    • /
    • pp.448-453
    • /
    • 2008
  • This study describes design and development techniques of estimation models for process modeling. One case study is undertaken to design a model using standard gas furnace data. Neural networks (NN) and genetic programming (GP) are each employed to model the crucial relationships between input factors and output responses. In the case study, two models were generated by using 70% training data and evaluated by using 30% testing data for genetic programming and neural network modeling. The model performance was compared by using RMSE values, which were calculated based on the model outputs. The average RMSE for training and testing were 0.8925 (training) and 0.9951 (testing) for the NN model, and 0.707227 (training) and 0.673150 (testing) for the GP model, respectively. As concern the results, the NN model has a strong advantage in model training (using the all data for training), and the GP model appears to have an advantage in model testing (using the separated data for training and testing). The performance reproducibility of the GP model is good, so this approach appears suitable for modeling physical fabrication processes.

Rule Discovery for Cancer Classification using Genetic Programming based on Arithmetic Operators (산술 연산자 기반 유전자 프로그래밍을 이용한 암 분류 규칙 발견)

  • 홍진혁;조성배
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.8
    • /
    • pp.999-1009
    • /
    • 2004
  • As a new approach to the diagnosis of cancers, bioinformatics attracts great interest these days. Machine teaming techniques have produced valuable results, but the field of medicine requires not only highly accurate classifiers but also the effective analysis and interpretation of them. Since gene expression data in bioinformatics consist of tens of thousands of features, it is nearly impossible to represent their relations directly. In this paper, we propose a method composed of a feature selection method and genetic programming. Rank-based feature selection is adopted to select useful features and genetic programming based arithmetic operators is used to generate classification rules with features selected. Experimental results on Lymphoma cancer dataset, in which the proposed method obtained 96.6% test accuracy as well as useful classification rules, have shown the validity of the proposed method.