简单的遗传算法(国外英语资料).docVIP

简单的遗传算法(国外英语资料) # include stdio.h # include stdlib.h # include string.h # include time.h # include windows.h # include process.h # define maxsize 100 typedef struct { int * base; int * top; int stacksize; } sqstack; int initstack (sqstack ); int push (sqstack s, int e); int pop (sqstack s, int e); void main () { sqstack s1; int e [8] [5] n [8]; [5] int a, b, c, d, f, g, h1, h2, i, j, k, l, m1, m2, m3, m4, m5, m6, m7, m8, flag, flag1, flag2, flag3, p = 1, q, r1 = 0, r2 = 0, r3 = 0, v, w, x, y, z; printf (初级遗传算法实例 ------ 从32到0的趋近演示.by -- 宋健豪 \ n); printf (* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *); fu (unsigned), tim (null)); printf (请输入交叉率x和变异率y, 如交叉率为千分之600, 则输入600, 变异率为千分之1, 则输入1 \ n注意: x + y不能大于1000! ); scanf (% d% d v w); system (cls); printf (初始化染色体, 请稍等:); for (h1 = 0; h1 8; h1 + +) for (h2 = 0 6; h2; h2 + +) e [h1] [h2] = 0; for (i = 0; i 8; i + +) { flag = 1, d = 0; initstack (s1); while (flag = = 1) { a = rand ()% 31; q = a; if (! = 0) flag = 0; } while (! = 0) { c = and% 2; push (s1, (c); a = a / 2; d + +; } for (c = d - 1; c = 0; c - -) { pop (s1 (g); e [i] [c] = g; } for (c = 4; c = 0; c - -) printf (% d, e [i] [c]); printf (----------% d, q); sleep (200); } printf (\ n); printf (下面开始进化:); flag = 1; while (flag = = 1) { x = rand ()% 5; y = rand ()% 5; flag3 = 1; z = rand (999)%; if (z = 0 v) { printf (第% d次进化, 进化方式为交叉: \ n, p); p + + r1 + +; for (h1 = 0; h1 8; h1 + +) for (h2 = 0 6; h2; h2 + +) n [h1] [h2] = 0; i = rand ()% 8; o = rand ()% 8; while (flag3 = = 1) { f = rand ()% 8; k = rand ()% 8; if (f! = i f! = a k! = i k! = on) flag3 = 0; } m1 = 0, m2 = 0, m = 0, the m4 = 0 = 0 = 0 m5, m6, m7 = 0, m8 = 0; printf (第一组交换行为第% d行和第% d行, 第一组交换行为第% d行和第% d行: \ n, i + 1, + 1, f + 1, k + 1); printf (交叉前为 交叉后为 \ n); for (j = 4; j 1; j - -) { n [a] [j] = e [i] [j]. n [i] [j] = e [about] [j]. n [to] [j] = e [f] [j]. n [f] [j] = e [k] [j]. } for (j = 1; j = 0; i --) { n [i] [j] =