Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram

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

Volumn 2439, Issue , 2002, Pages 224-233

  Tsutsui, Shigeyoshi ^a  

^a HANNAN UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GRAPHIC METHODS; LEARNING ALGORITHMS; POPULATION STATISTICS;

MUTATION OPERATORS; PERMUTATION REPRESENTATION; PROBABILISTIC MODEL-BUILDING GENETIC ALGORITHMS; PROBABILISTIC MODELING; PROBABILITY DENSITIES; RECOMBINATION OPERATORS; SAMPLING ALGORITHM; SMALL POPULATION;

MODEL BUILDINGS;

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

References (27)

1. Baluja, S.: Population-based incremental learning: A method for interacting genetic search based function optimization and co emptive learning, Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University (1994).
2. Baluja, S. and Davies: Using optimum dependency-trees for combinatorial optimization: learning the structure of the search space, Tech. Rep. No. CMU-CS-97-107, Carnegie Mellon University (1997)
3. Bosman, P. and Thierens, D.: An algorithmic framework for density estimation based evolutionary algorithms, Tech. Rep. No. UU-CS-1999-46, Utrecht University (1999).
4. Bosman, P. and Thierens, D.: Continuous iterated density estimation evolutionary algorithms within the IDEA framework, Proc. of the Optimization by Building and Using Probabilistic Models OBUPM Workshop at the Genetic and Evolutionary Computation Conference GECCO-2000, pp.197-200 (2000).
5. Bosman, P. and Thierens, D.: Mixed IDEAs, Tech. Rep. No. UU-CS-2000-45, Utrecht University (2000).
6. De Bonet, J. S., Isbell, C. L. and Viola, P.: MIMIC: Finding optima by estimating probability densities, In Mozer, M. C., Jordan, M. I., and Petsche, T. (Eds): Advances in neural information processing systems, Vol. 9, pp. 424-431. (1997).
7. Goldberg, D. E.: Genetic algorithms in search, optimization and machine learning, Addison-Wesley publishing company (1989).
8. Harik, G., Lobo, F. G., and Goldberg, D. E.: The compact genetic algorithm, Proc. of the Int. Conf. Evolutionary Computation 1998 (ICEC 98), pp. 523-528 (1998).
9. Harik, G: Linkage learning via probabilistic modeling in the ECGA, Tecnical Report IlliGALReport 99010, University of Illinois at Urbana-Champaign, Urbana, Illinois (1999).
10. Larranaga, P., Etxeberria, R., Lozano, J.A., and Pena, J.M.: Optimization by learning and simulation of Bayesian and gaussian networks, University of the Basque Country Technical Report EHU-KZAAIK-4/99 (1999).
11. Dorigo M., Maniezzo, V. and Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents, IEEE Trans. on Systems, Man, and Cybernetics-Part B, Vol. 26, No. 1, pp. 29-41 (1996).
12. Mhlenbein, H and Paa, G.: From recombination of genes to the estimation of distribution I. Binary parameters, Proc. of the Parallel Problem Solving from Nature - PPSN IV, pp. 178-187 (1996).
13. Pelikan, M., Goldberg, D. E., and Cantu-Paz, E.: BOA: The Bayesian optimization algorithm, Proc. of the Genetic and Evolutionary Computation Conference 1999 (GECCO- 99), Morgan Kaufmann, San Francisco, CA (1999).
14. Pelikan, M., Goldberg, D. E., and Lobo, F. G.: A survey of optimization by building and using probabilistic models, Technical Report IlliGAL Report 99018, University of Illinois at Urbana-Champaign (1999).
15. Pelikan, M., Goldberg, D. E., and Cantu-Paz, E.: Linkage problems, distribution estimate, and Bayesian network, Evolutionary Computation, Vol. 8, No. 3, pp. 311-340 (2000).
16. Sebag, M. and Ducoulombier, A.: Extending population-based incremental learning to continuous search spaces, Proc. of the Parallel Problem Solving from Nature - PPSN V, pp. 418-427 (1998).
17. Servet, I. L., Trave-Massuyes, L., and Stern, D.: Telephone network traffic overloading diagnosis and evolutionary computation techniques, Proc. of the Third European Conference on Artificial Evolution (AE 97), pp. 137-144 (1997).
18. Larranaga, P., Etxeberria, R., Lozano, J. A., and Pena, J. M.: Optimization in continuous domains by learning and simulation of Gaussian networks, Proc. of the 2000 Genetic and Evolutionary Computation Conference Workshop Program, pp. 201-204 (2000).
19. Robles, V., Miguel, P. D., and Larranaga, P.: Solving the traveling salesman problem with EDAs, Estimation of Distribution Algorithms, Larranaga, P. and Lozano, J. A. (eds), Kluwer Academic Publishers, Chapter 10, pp. 211-229 (2002).
20. Larranaga, P. and Lozano, J. A. (eds): Estimation of distribution algorithms, Kluwer Academic Publishers (2002).
21. Tsutsui, S., Pelikan, M., and Goldberg, D. E.: Evolutionary Algorithm using Marginal Histogram Models in Continuous Domain, Proc. of the 2001 Genetic and Evolutionary Computation Conference Workshop Program, pp. 230-233 (2001).
22. Nagata, Y. and Kobayashi, S.: Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem, Proc. of the 7th Int. Conf. on Genetic Algorithms, Morgan Kaufmann, pp. 450-457 (1997).
23. Johnson, D. S, and McGeoch, L. A.: Experimental analysis of heuristics for the STSP, The Traveling Salesman Problem and its Variations, Gutin and Punnen (eds), Kluwer Academic Publishers, Chapter 1 (to appear).
24. Oliver, I., Smith, D., and Holland, J.: A study of permutation crossover operators on the travel salesman problem, Proc. of the 2nd Int. Conf. on Genetic Algorithms, pp. 224-230 (1987).
25. Stark weather, T., McDaniel, S., Mathias, K, Whitley, D, and Whitley, C.: A comparison of genetic sequence operators, Proc. of the 4th Int. Conf. on Genetic Algorithms, Morgan Kaufmann, pp. 69-76 (1991).
26. Whitley, D., Starkweather, T., and Fuquay, D.: Scheduling problems and traveling salesman problem: The genetic edge recombination operator, Proc. of the 3rd Int. Conf. on Genetic Algorithms, Morgan Kaufmann (1989).
27. Ulder, N., Pesch, E., van Laarhoven, P., Bandelt, and Aarts, E.: Improving TSP exchange heuristics by population genetics, Proc. of the Parallel Problem Solving from Nature - PPSN (1990).