Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram

  • Authors:
  • Shigeyoshi Tsutsui

  • Affiliations:
  • -

  • Venue:
  • PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, there has been a growing interest in developing evolutionary algorithms based on probabilistic modeling. In this scheme, the offspring population is generated according to the estimated probability density model of the parent instead of using recombination and mutation operators. In this paper, we have proposed probabilistic model-building genetic algorithms (PMBGAs) in permutation representation domain using edge histogram based sampling algorithms (EHBSAs). Two types of sampling algorithms, without template (EHBSA/WO) and with template (EHBSA/WT), are presented. The results were tested in the TSP and showed EHBSA/WT worked fairly well with a small population size in the test problems used. It also worked better than well-known traditional two-parent recombination operators.