A Comparative Study of Sampling Methods in Node Histogram Models with Probabilistic Model-Building Genetic Algorithms

In a previous paper we proposed a node histogram based sampling algorithm (NHBSA) and compared it with edge histogram based sampling algorithm (EHBSA). The results showed NHBSA outperforms EHBSA on the permutation problems where absolute position of each node in a string is related to its performance. However, we used only a limited variation of sampling methods for NHBSA. In this paper, we propose several variations of sampling methods for NHBSA and explore conditions for them to work well with NHBSA.

[1]  Shigeyoshi Tsutsui,et al.  Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram , 2002, PPSN.

[2]  Pedro Larrañaga,et al.  Solving the Traveling Salesman Problem with EDAs , 2002, Estimation of Distribution Algorithms.

[3]  Shigeyoshi Tsutsui,et al.  Node Histogram vs. Edge Histogram: A Comparison of Probabilistic Model-Building Genetic Algorithms in Permutation Domains , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[4]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[5]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[6]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[7]  Dirk Thierens,et al.  Permutation Optimization by Iterated Estimation of Random Keys Marginal Product Factorizations , 2002, PPSN.

[8]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[9]  S. Tsutsui,et al.  Solving capacitated vehicle routing problems using edge histogram based sampling algorithms , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[10]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[11]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[12]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[13]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[14]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[15]  Mitsunori Miki,et al.  Using Edge Histogram Models to solve Flow shop Scheduling Problems with Probabilistic Model-Building Genetic Algorithms , 2002, SEAL.

[16]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[17]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[18]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..