Permutation optimization by iterated estimation of random keys marginal product factorizations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2439, Issue , 2002, Pages 331-340

  Bosman, Peter A N ^a   Thierens, Dirk ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); SIGNAL ENCODING;

NEW SOLUTIONS; PERMUTATION PROBLEMS; RANDOM KEYS;

PROBABILITY DISTRIBUTIONS;

EID: 84944329532     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45712-7_32     Document Type: Conference Paper

References (18)

1. J. C. Bean. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing, 6:154–160, 1994.
2. P. A. N. Bosman and D. Thierens. Advancing continuous IDEAs with mixture distributions and factorization selection metrics. In M. Pelikan and K. Sastry, editors, Proceedings of the Optimization by Building and Using Probabilistic Models OBUPM Workshop at the Genetic and Evolutionary Computation Conference GECCO–2001, pages 208–212. Morgan Kaufmann, 2001.
3. P. A. N. Bosman and D. Thierens. Crossing the road to efficient IDEAs for permutation problems. In L. Spector et al., editor, Proc. of the Genetic and Evolutionary Computation Conf. – GECCO–2001, pages 219–226. Morgan Kaufmann, 2001.
4. P. A. N. Bosman and D. Thierens. Random keys on ICE: Marginal product factorized probability distributions in permutation optimization. Utrecht University Technical Report UU–CS–2002–xx., 2002.
5. K. Deb and D. E. Goldberg. Sufficient conditions for deception in arbitrary binary functions. Annals of Mathematics and Artificial Intelligence, 10(4):385–408, 1994.
6. N. Friedman and M. Goldszmidt. Learning Bayesian networks with local structure. In E. Horvitz and F. Jensen, editors, Proc. of the 12th Conference on Uncertainty in Artificial Intelligence (UAI-96), pages 252–262. Morgan Kaufmann, 1996.
7. G. Harik, E. Cantú-Paz, D. E. Goldberg, and B. L. Miller. The gambler’s ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3):231–253, 1999.
8. G. Harik and D. E. Goldberg. Linkage learning through probabilistic expression. Comp. methods in applied mechanics and engineering, 186:295–310, 2000.
9. John H. Holland. Adaptation in Natural and Artifical Systems. University of Michigan Press, Ann Arbor, Michigan, 1975.
10. H. Kargupta, K. Deb, and D. E. Goldberg. Ordering genetic algorithms and deception. In R. Männer and B. Manderick, editors, Parallel Problem Solving from Nature – PPSN II, pages 47–56. Springer Verlag, 1992.
11. D. Knjazew. Application of the fast messy genetic algorithm to permutation and scheduling problems. IlliGAL Technical Report 2000022, 2000.
12. H. Mühlenbein and T. Mahnig. FDA – a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evol. Comp., 7(4):353–376, 1999.
13. A. Ochoa, H. Mühlenbein, and M. Soto. A factorized distribution algorithm using single connected bayesian networks. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature – PPSN 6, pages 787–796. Springer Verlag, 2000.
14. M. Pelikan and D. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. In L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, and E. Burke, editors, Proceedings of the GECCO–2001 Genetic and Evolutionary Computation Conference, pages 511–518. Morgan Kaufmann, 2001.
15. V. Robles, P. de Miguel, and P. Larrañaga. Solving the traveling salesman problem with EDAs. In P. Larrañaga and J.A. Lozano, editors, Estimation of Distribution Algorithms. A new tool for Evolutionary Computation. Kluwer Academic, 2001.
16. R. Santana, A. Ochoa, and M. R. Soto. The mixture of trees factorized distribution algorithm. In L. Spector et al., editor, Proc. of the GECCO–2001 Genetic and Evolutionary Computation Conference, pages 543–550. Morgan Kaufmann, 2001.
17. S.-Y. Shin and B.-T. Zhang. Bayesian evolutionary algorithms for continuous function optimization. In Proceedings of the 2001 Congress on Evolutionary Computation – CEC2001, pages 508–515. IEEE Press, 2001.
18. D. Thierens and D.E. Goldberg. Mixing in genetic algorithms. In S. Forrest, editor, Proceedings of the fifth conference on Genetic Algorithms, pages 38–45. Morgan Kaufmann, 1993.