• DocumentCode
    2814746
  • Title

    Evolving radial basis function networks via GP for estimating fitness values using surrogate models

  • Author

    Kattan, Ahmed ; Galvan, Edgar

  • Author_Institution
    Comput. Sci. Dept., Um Al-Qura Univ., Makkah, Saudi Arabia
  • fYear
    2012
  • fDate
    10-15 June 2012
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    In real-world problems with candidate solutions that are very expensive to evaluate, Surrogate Models (SMs) mimic the behaviour of the simulation model as closely as possible while being computationally cheaper to evaluate. Due to their nature, SMs can be seen as heuristics that can help to estimate the fitness of a candidate solution without having to evaluate it. In this paper, we propose a new SM based on Genetic Programming (GP) and Radial Basis Function Networks (RBFN), called GP-RBFN Surrogate. More specifically, we use GP to evolve both: the structure of a RBF and its parameters. The SM evolved by our algorithm is tested in one of the most studied NP-complete problem (MAX-SAT) and its performance is compared against RBFN Surrogate, GAs, Random Search and (1+1) ES. The results obtained by performing extensive empirical experiments indicate that our proposed approach outperforms the other four methods in terms of finding better solutions without the need of evaluating a large portion of candidate solutions.
  • Keywords
    computability; computational complexity; genetic algorithms; radial basis function networks; response surface methodology; search problems; GA; GP-RBFN surrogate; MAX-SAT; NP-complete problem; SM; fitness value estimation; genetic programming; radial basis function network; random search; response surface model; surrogate model; Approximation methods; Computational modeling; Mathematical model; Optimization; Search problems; Standards; Training;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation (CEC), 2012 IEEE Congress on
  • Conference_Location
    Brisbane, QLD
  • Print_ISBN
    978-1-4673-1510-4
  • Electronic_ISBN
    978-1-4673-1508-1
  • Type

    conf

  • DOI
    10.1109/CEC.2012.6256108
  • Filename
    6256108