Entropy-boltzmann selection in the genetic algorithms

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 33, Issue 1, 2003, Pages 138-142

  Lee, Chang Yong ^a  

^a Kongju National University   (South Korea)

Author keywords

Entropy Boltzmann selection; Genetic algorithms (GAs); N K model; Premature convergence problem

Indexed keywords

COMPUTER SIMULATION; ENTROPY; MONTE CARLO METHODS; SIMULATED ANNEALING;

METROPOLIS ALGORITHMS;

GENETIC ALGORITHMS;

EID: 0037278030     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2003.808184     Document Type: Article

References (19)

1. D. Goldberg, Genetic Algorithm in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
2. J. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press, 1992.
3. D. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. Piscataway, NJ: IEEE Press, 1995.
4. T. Bäck and H.-P. Schwefel, "An overview of evolutionary algorithms for parameter optimization," Evol. Comput., vol. 1, no. 1, pp. 1-23, 1993.
5. J. Lee, "New Monte Carlo algorithm: Entropic sampling," Phys. Rev. Lett., vol. 71, pp. 211-214, 1993.
6. K. Binder and D. Heermann, Monte Carlo Simulation in Statistical Physics. New York: Springer-Verlag, 1988.
7. C.-Y. Lee and S. Han, "Genetic-entropic algorithm: An application to N K-model and the statistical analysis," in Proc. 7th Int. Conf. Genetic Algorithms, 1997, pp. 254-259.
8. _, "Evolutionary optimization algorithm by entropic sampling," Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 57, no. 3-B, pp. 3611-3617, 1998.
9. J. Lee and M. Y. Choi, "Optimization by multicanonical annealing and the traveling salesman problem," Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 50, pp. R651-R654, 1994.
10. K. K. Lee and S. K. Han, "Entropic and Boltzmann selection in the genetic algorithm and the traveling salesman problem," in Proc. Int. Conf. Neural Information Processing, 1994, pp. 162-167.
11. L. Qu and R. Sun, "A synergetic approach to genetic algorithms for solving traveling salesman problem," Inf. Sci., vol. 117, pp. 267-283, 1999.
12. J. Lozano, P. Larrañaga, M. Granña, and F. Albizuri, "Genetic algorithms: Bridging the convergence gap," Theor. Comput. Sci., vol. 229, pp. 11-22, 1999.
13. S. Kauffman, "Adaptation on rugged fitness landscapes," in Lectures in the Science of Complexity, D. Stein, Ed. Reading, MA: Addison-Wesley, 1989, vol. 1, Santa Fe Institute Studies in the Science of Complexity, Lect., pp. 527-618.
14. M. Mitchell, An Introduction to Genetic Algorithms. Cambridge, MA: MIT Press, 1999.
15. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, "Equation of state calculations for fast computing landscape," J. Chem. Phys., vol. 2, pp. 1087-1093, 1953.
16. M. Thill. (1997) On the free energy Monte Carlo algorithm. [Online]. Available: http://arXiv:cond-matt/9703234
17. S. Kauffman, At Home in the Universe. London, U.K.: Oxford Univ. Press, 1995, For the ruggedness of the K-dependence, p. 175.
18. X. Yao, Y. Liu, and G. Lin, "Evolutionary programming made faster," IEEE Trans. Evol. Comput., vol. 3, no. 2, pp. 82-102, 1999.
19. Z. Michalewicz, Genetic Algorithms + Data Structure = Evolution Programs. New York: Springer-Verlag, 1992.