A comparative study of sampling methods in node histogram models with probabilistic model-building genetic algorithms

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn 4, Issue , 2006, Pages 3132-3137

  Tsutsui, Shigeyoshi ^a,b  

^a IEEE   (Japan)

^b HANNAN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS;

HISTOGRAM MODELS; NODE HISTOGRAM BASED SAMPLING ALGORITHM; PERMUTATION PROBLEMS;

SAMPLING;

EID: 34548125786     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2006.384597     Document Type: Conference Paper

References (19)

1. P. A. N. Bosman and D. Thierens, "Permutation Optimization by Iterated Estimation of Random Keys Marginal Product Factorizations", Proc of the Parallel Problem Solving From Nature, 2002, pp. 331-340.
2. D. T. Connolly, An improved annealing scheme for the QAP", European Journal of Operations Research, 1990, Vol. 46, pp. 93-100.
3. C. Fleurent and J. A. Ferland, "Genetic hybrids for the quadratic assignment problem", in Quadratic assignment and related problems, P.M. Pardalos and H.Wolkowicz (Eds), Vol. 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 1994, American Mathematical Society, pp. 173-187.
4. L.-M. Gambardella, É D. Taillard, and M. Dorigo, "Ant Colonies for the Quadratic Assignment Problems", Journal of the Operational Research Society, 1999, Vol. 50, pp. 167-176.
5. D. E. Goldberg, Genetic algorithms in search, optimization and machine learning, Reading, MA: Addison-Wesley, 1989.
6. P. Larrañaga and J. A. Lozano (Eds.), Estimation of distribution algorithms, 2002, Boston, Kluwer.
7. H. Muehlenbein and G. Paass, "From recombination of genes to the estimation of distributions I. Binary parameters", Proc of the Parallel Problem Solving from Nature, 1996, pp. 178-187.
8. M. Pelikan, D. E. Goldberg, and F. Lobo, "A survey of optimization by building and using probabilistic models", Computational Optimization and Applications, 2002, Vol. 21, No. 1, pp. 5-20. Also IlliGAL Report No. 99018.
9. V. Robles, P. D. Miguel, and P. Larrañaga, "Solving the traveling salesman problem with EDAs", in P. Larranaga and J. A. Lozano (Eds.), Estimation of Distribution Algorithms, 2002, pp. 211-229, Kluwer.
10. T. Stutzle and H. Hoos, "Max-Min Ant System, Future Generation Computer Systems", 2000, Vol.16, No. 9, pp.889-914.
11. T. Stutzle, "An ant approach to the flow shop problem", Proc. of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT'98), 1998, Vol. 3, pp. 1560-1564.
12. É D. Taillard, "Some efficient heuristic methods for the flow shop sequencing problem", European Journal of Operational Research, 1990, Vol. 47, No. 1, pp. 65-74.
13. É D. Taillard, "Robust taboo search for the quadratic assignment problem", Parallel Computing, 1991, Vol. 17, pp. 443-455.
14. É D. Taillard, "Comparison of iterative searches for the quadratic assignment problem", Location Science, 1995, Vol. 3, pp. 87-105.
15. S. Tsutsui, "Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram", Proc. of the 7th Int. Conf. on Parallel Problem Solving from Nature (PPSN VII), 2002, pp. 224-233, Springer-Velag.
16. S. Tsutsui, M. Pelikan, and D. E. Goldberg, "Using Edge Histogram Models to Solve Permutation Problems with Probabilistic Model-Building Genetic Algorithms", IlliGAL Report No. 2003022, 2003, University of Illinois.
17. S. Tsutsui and G. Wilson, "Solving Capacitated Vehicle Routing Problems Using Edge Histogram Based Sampling Algorithms", Proc. of the 2004 Congress on Evolutionary Computation, pp. 1150-1157.
18. S. Tsutsui and M. Miki, "Using Edge Histogram Models to Solve Flow Shop Scheduling Problems with Probabilistic Model-Building Genetic Algorithms", in Recent Advances in Simulated Evolution and Learning, K. C. Tan, M. H. Lim, X. Yao, and L. Wang (Eds), Advances in Natural Computation Series, Chapter 13, 2004, World Scientific.
19. S. Tsutsui, "Node Histogram vs. Edge Histogram: A Comparison of Probabilistic Model-Building Genetic Algorithms in Permutation Domains", Proc. of the 2006 Congress on Evolutionary Computation, (submitted).