Improved comparative partner selection with brood recombination for genetic programming

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

@InProceedings{Aslam:2013:MLSP,
  author =       "Muhammad Waqar Aslam and Zhechen Zhu and 
                 Asoke Kumar Nandi",
  booktitle =    "IEEE International Workshop on Machine Learning for
                 Signal Processing (MLSP 2013)",
  title =        "Improved comparative partner selection with brood
                 recombination for genetic programming",
  year =         "2013",
  month =        "22-25 " # sep,
  keywords =     "genetic algorithms, genetic programming, brood
                 recombination, improved comparative partner selection",
  DOI =          "doi:10.1109/MLSP.2013.6661901",
  ISSN =         "1551-2541",
  size =         "5 pages",
  abstract =     "The aim of all evolutionary methods is to find the
                 best solution from search space without testing every
                 solution in search space. This study employs strengths
                 and weaknesses of solutions for finding the best
                 solution of any problem in genetic programming. The
                 strengths and weaknesses are used to assist in finding
                 the right partners (solutions) during crossover
                 operation. The probability of crossover between two
                 solutions is evaluated using relative strengths and
                 weaknesses as well as overall strengths of solutions
                 (Improved Comparative Partner Selection (ICPS)). The
                 solutions qualifying for crossover through ICPS
                 criteria are supposed to produce better solutions and
                 are allowed to produce more children through brood
                 recombination. The brood recombination helps to exploit
                 the search space close to the optimum solution more
                 efficiently. The proposed method is applied on
                 different benchmarking problems and results demonstrate
                 that the method is highly efficient in exploring the
                 search space.",
  notes =        "Also known as \cite{6661901}",
}

Genetic Programming entries for Muhammad Waqar Aslam Zhechen Zhu Asoke K Nandi

Citations