5 citations found. Retrieving documents...
J. Suzuki. A further result on the Markov chain model of genetic algorithm and its application to a simulated annealing-like theory, IEEE Trans. Systems, Man, and Cybernetics-B, 28,1 (1998), 95-102.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Monte Carlo Simulation and Population-Based Optimization - Cercueil, François (2001)   (1 citation)  (Correct)

....complex behaviors inspired from nature. Several attempts have been made in trying to relate statistical mechanics and evolutionary computation. Davis and Principe emphasized the relationship existing between the mutation probability and a temperature for the simple genetic algorithm [5] Suzuki [26, 27] analyzed Markov chain models of this algorithm using the analogy with simulated annealing. Rudolph [21] and Mahfoud and Goldberg [18] compared massively parallel simulated annealing and genetic algorithms. Van Nimwegen et al. 19] studied meta stability in the royal road genetic algorithm deeply ....

J. Suzuki. A further result on the Markov chain model of genetic algorithm and its application to a simulated annealing-like theory, IEEE Trans. Systems, Man, and Cybernetics-B, 28,1 (1998), 95-102.


Genetic Algorithms: bridging the convergence gap - Lozano, Larrañaga.. (1998)   (2 citations)  (Correct)

....conditions on the sequence of temperatures fc k g k=0;1; used. The use of a Boltzmann distribution is clearly inspired by the well known results obtained for the SA [17] There have been in the literature other attempts to bring the desirable convergence properties of SA into the GA realm [3,2,11,16]. All of them have failed to prove the convergence to the optimum of their respective instances of the GA, unless they introduce basic changes in the algorithm. Davis and Pr ncipe [3] tried to use the mutation probability as a temperature parameter. They proved that as the mutation probability ....

....distribution in which only states (i.e. populations) with all the individuals identical (i.e. uniform populations) have non zero probabilities. This result is far away from the desired convergence to the optimum. However, their work together with the work of Vose [18] Rudolph [13,14] and Suzuki [15,16] have set the analytical framework of the GA study, and we have made an extensive use of these ideas in this paper. Suzuki [16] using the Davis and Pr ncipe approximation designed a SA like GA. His algorithm is based not only in making the mutation probability go to zero, but also the crossover ....

[Article contains additional citation context not shown here]

J. Suzuki, A Further Result on the Markov Chain Model of Genetic Algorithms and Its Application to a Simulated Annealing-like Strategy, IEEE Transactions on Systems, Man, and Cybernetics, to appear.


An Indexed Bibliography of Genetic Algorithms in Japan - Jarmo T. Alander (2000)   (Correct)

.... on Industrial Electronics, 611] IEEE Transactions on Magnetics, 183, 576, 1177, 1206] IEEE Transactions on Neural Networks, 592] IEEE Transactions on Nuclear Science, 791] IEEE Transactions on Power Systems, 33, 481, 823, 1425] IEEE Transactions on Systems, Man, and Cybernetics, [254, 1097] IEICE Trans. Electron. Japan) 1065] IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Japan) 1053, 1124, 1133] IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Japan) 1290] IEICE Trans. Inf. Syst. Japan) 863, 1103] IEICE Transaction on Fund. Electron. Commun. Comput. ....

....[202, 322] Sumi, K. 1545] Sun, Xun, 919] Sunada, Hideaki, 1035] Surace, C. 716] Sutoh, T. 82] Suyama, A. 878] Suyama, Masanori Arita Akira, 933] Suzukake, Y. 1164] Suzuki, A. 993] Suzuki, Atsuyuki, 913] Suzuki, Hideaki, 826] Suzuki, H. 82, 329] Suzuki, Joe, [254, 522, 1097, 1371] Suzuki, J. 943, 1005, 1098] Suzuki, Keiji, 70, 249, 282, 377, 417, 1377, 1378, 1380, 1382] Suzuki, K. 925] Suzuki, Shinji, 1519] Suzuki, Takayuki, 601] Suzuki, Tatsuya, 255] Suzuki, Tetsuo, 1435] Suzuki, Toshihiro, 1193, 1231] Suzuki, T. 621, 730, 1542, 1026, 1173, 1180] ....

[Article contains additional citation context not shown here]

Joe Suzuki. A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy. IEEE Transactions on Systems, Man, and Cybernetics, 28(1):95-102, 1998. yA98-18043 ga98aJoeSuzuki.


An Indexed Bibliography of Genetic Algorithms and Simulated.. - Alander (2000)   (Correct)

....[232] IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 261, 264] IEEE Transactions on Magn. 102] IEEE Transactions on Magnetics, 201, 248] IEEE Transactions on Power Systems, 191, 98, 210, 217, 259] IEEE Transactions on Systems, Man, and Cybernetics, [164, 21, 60, 129, 130, 64] IEICE Transactions on Fundamentals of Electronics, Communcations and Computer Science, 51] Image and Vision Computing, 32] Ind. Eng. Chem. Res. 233] Informatica, 85] Int. J. Microwave Millimeter Wave Comput. Aided Eng. 23] Int. J. Prod. Res. UK) 189] Int. J. Syst. Sci. UK) ....

....Kwanghoon, 130] Souza, de Cursi J. E. 91] Spillane, Andrew R. 238] Stadler, W. 175] Standley, Daron M. 220] Steenstrup, Martha, 139] Stefanovic, Juraj, 89] Sto a, Paul L. 34] Stuckman, B. 40] Sugai, Y. 252, 143, 144] Sun, Ray Long, 88] Sun, Xun, 116] Suzuki, Joe, [193, 60] Suzuki, Keiji, 254] Takagi, K. 85] Talbi, El Ghazali, 266] Tan, B. G. T. 94] Tan, B. T. G. 95] Tan, K. C. 45] Tan, Kay C. 48] Tang, Anthony, 136] Tanigawa, Y. 172] Tayal, Manish C. 233] Taylor, C. J. 32] Terano, K. 99] Thangiah, Sam R. 234] Theil, D. 124] ....

[Article contains additional citation context not shown here]

Joe Suzuki. A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy. IEEE Transactions on Systems, Man, and Cybernetics, 28(1):95-102, 1998. yA98-18043 ga98aJoeSuzuki.


Finite Markov Chain Results in Evolutionary Computation: A Tour.. - Rudolph (1998)   (9 citations)  (Correct)

.... annealing like selection method yields the convergence of the sequence (ff k : k 0) Cerf employed the Freidlin Wentzel theory of dynamical perturbed systems to prove global convergence for time dependent schedules for recombination, mutation, and selection operators [19, 20] while Suzuki [21], Lozano et al. 22] as well as He and Kang [23] came to similar results via Markov chain theory. Since most of these results are specialized to certain combinations of variation and selection operators, it is refrained from reproducing all assumptions here. 3. Finite Time Behavior in Finite ....

J. Suzuki. A further result on the markov chain model of genetic algorithm and its application to a simulated annealing-like strategy. IEEE Transactions on Systems, Man, and Cybernetics---Part B, 28(1):95--102, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC