Adaptive discretization for probabilistic model building genetic algorithms

  • Authors:
  • Chao-Hong Chen;Wei-Nan Liu;Ying-Ping Chen

  • Affiliations:
  • National Chiao Tung University, HsinChu City, Taiwan;National Chiao Tung University, HsinChu City, Taiwan;National Chiao Tung University, HsinChu City, Taiwan

  • Venue:
  • Proceedings of the 8th annual conference on Genetic and evolutionary computation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization problems in the continuous domain. The procedure, effect, and usage of SoD are described in detail. As an example, the integration of SoD and the extended compact genetic algorithm (ECGA), named real-coded ECGA (rECGA), is presented and numerically examined. The experimental results indicate that rECGA works well and SoD is effective. The behavior of SoD is analyzed and discussed, followed by the potential future work for SoD.