📄 7.htm
字号:
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
<title>CTerm非常精华下载</title>
</head>
<body bgcolor="#FFFFFF">
<table border="0" width="100%" cellspacing="0" cellpadding="0" height="577">
<tr><td width="32%" rowspan="3" height="123"><img src="DDl_back.jpg" width="300" height="129" alt="DDl_back.jpg"></td><td width="30%" background="DDl_back2.jpg" height="35"><p align="center"><a href="http://202.112.20.132"><font face="黑体"><big><big>白云黄鹤★</big></big></font></a></td></tr>
<tr>
<td width="68%" background="DDl_back2.jpg" height="44"><big><big><font face="黑体"><p align="center"> 遗传算法 </font></big></big></td></tr>
<tr>
<td width="68%" height="44" bgcolor="#000000"><font face="黑体"><big><big><p align="center"></big></big><a href="http://cterm.163.net"><img src="banner.gif" width="400" height="60" alt="banner.gif"border="0"></a></font></td>
</tr>
<tr><td width="100%" colspan="2" height="100" align="center" valign="top"><br><p align="center">[<a href="index.htm">回到开始</a>][<a href="index.htm">上一层</a>][<a href="8.htm">下一篇</a>]
<hr><p align="left"><small>发信人: coy (我爱美好哦), 信区: Algorithm <br>
标 题: 遗传算法（7） <br>
发信站: 武汉白云黄鹤站 (Wed May 31 21:43:53 2000), 站内信件 <br>
<br>
#include "f:\coy\mywork\lunwen\gaopc\thesis.h" <br>
void optimization(X,x1,x2,fin_mat,rc,tot_eq,a1_b) <br>
MATRIX fin_mat; <br>
VECTOR X,a1_b; <br>
IVECTOR x1,x2; <br>
INDEX rc; <br>
int tot_eq; <br>
{ <br>
MATRIX new_genera, <br>
population, <br>
print_pop, <br>
temp; <br>
VECTOR probab, <br>
cum_probab, <br>
t_vec, <br>
eval; <br>
IVECTOR live, <br>
die; <br>
int pop_size, <br>
generations, <br>
count_gener= 1, <br>
NGcount=1, <br>
MinMax, <br>
P, <br>
P1, <br>
P2, <br>
P3, <br>
P4, <br>
P5, <br>
P6, <br>
B, <br>
STEP, <br>
x2_vari = rc.c-2, <br>
first, <br>
second, <br>
tot, <br>
i, <br>
j, <br>
k; <br>
float Q, <br>
A, <br>
A, <br>
Teval; <br>
fscanf(input,"%d %d %d %d %d %d %d %d ",&pop_size,&generations,&P1,&P2,&P3 <br>
,&P4,&P5, &P6); <br>
fscanf(input,"%f ",&Q); <br>
fscanf(input,"%d ",&MinMax); <br>
fscanf(input,"%d ",&B); <br>
fscanf(input,"%f ",&A); <br>
fscanf(input,"%d ",&STEP); <br>
fclose(input); <br>
fprintf(output,"\n\nValues for operators: %d %d %d %d %d %d\n", P1, P <br>
2, P3, P4, P5, P6); <br>
fprintf(output,"\nOther parameters: Pop-size = %d\n Gener <br>
ations = %d\n B = %d\n A = %f\n", pop_size <br>
,generations,B,A); <br>
P = P1 + P2 + P3 + P4 + P5 + P6; <br>
if(P > pop_size) <br>
{ <br>
fprintf(output,"The total number of operators greater than population" <br>
); <br>
fclose(output); <br>
exit(1); <br>
} <br>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -