⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 16.htm

📁 遗传算法的详细描述文档,文档中附带一定的代码解释
💻 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="17.htm">下一篇</a>]
<hr><p align="left"><small>发信人: coy (我爱美好哦), 信区: Algorithm <br>

标  题: 遗传算法(16) <br>

发信站: 武汉白云黄鹤站 (Wed May 31 21:52:38 2000), 站内信件 <br>

  <br>

//read_write.c <br>

  <br>

#include "f:\coy\mywork\lunwen\gaopc\thesis.h" <br>

void read_file(equalities,inequalities,domains,tot_arr) <br>

MATRIX equalities,inequalities,domains; <br>

IVECTOR tot_arr; <br>

{ <br>

  int t2,i,j,total_variables; <br>

  float t1,t3; <br>

  if(tot_arr[1] != 0) <br>

    for(i=1; i<=tot_arr[1]; i++) <br>

      for(j=1; j<=tot_arr[0] + 1; j++) <br>

 fscanf(input," %f",&equalities[i][j]); <br>

  if(tot_arr[2] != 0) <br>

    for(i=1; i<=tot_arr[2]; i++) <br>

      for(j=1; j<=tot_arr[0]+1; j++) <br>

 fscanf(input," %f",&inequalities[i][j]); <br>

  for(i=1; i<=tot_arr[0]; i++) <br>

    { <br>

    { <br>

      domains[i][1] = MIN; <br>

      domains[i][2] = (float) i; <br>

      domains[i][3] = MAX; <br>

    } <br>

  if(tot_arr[3] != 0) <br>

    for(i=1; i<=tot_arr[3]; i++) <br>

      { <br>

 fscanf(input," %f %d %f",&t1,&t2,&t3); <br>

 domains[t2][1] = t1; <br>

 domains[t2][3] = t3; <br>

      } <br>

} <br>

void write_file(final_mat,fin,a1_b,x1,x2,x1_row,x2_row,in) <br>

MATRIX final_mat; <br>

VECTOR a1_b; <br>

IVECTOR x1,x2; <br>

INDEX fin; <br>

int x1_row,x2_row,in; <br>

{ <br>

  int i,j,k=1; <br>

  fprintf(output,"Left\t\t"); <br>

  for(j=1; j<=fin.c-2; j++) <br>



    fprintf(output," X%d\t",x2[j]); <br>

  fprintf(output,"\tRight\n"); <br>

  for(i=1; i<=fin.r; i++) <br>

    { <br>

      for(j=1; j<=fin.c; j++) <br>

 { <br>

   if (((j==2)&&(i<in))||(j==fin.c)) <br>

     fprintf(output,"\t"); <br>

   fprintf(output,"%5.2f\t",final_mat[i][j]); <br>

 } <br>

      fprintf(output,"\n"); <br>

    } <br>

  fprintf(output,"\n\n\n\n\t"); <br>

  <br>

  for(j=1; j<=fin.c-2; j++) <br>

    fprintf(output," X%d\t",x2[j]); <br>

  fprintf(output,"const\n\n"); <br>

  <br>

  for(i=x2_row+1; i<=x2_row+x1_row; i++) <br>

    { <br>

      fprintf(output,"X%d\t",x1[k]); <br>

      for(j=2; j<fin.c; j++) <br>



 fprintf(output,"%5.2f\t",final_mat[i][j]); <br>

      fprintf(output,"%5.2f\n",a1_b[k++]); <br>

    } <br>

} <br>

  <br>

-- <br>

                            \○/ <br>

                              ┃ <br>

                             /\ <br>

                    脖子扭扭,屁股扭扭,大家一起来跳舞 <br>

  <br>

※ 来源:.武汉白云黄鹤站 bbs.whnet.edu.cn.[FROM: 211.69.196.11] <br>

[阅读精华区资料]  结束Q, ← │ 上一项资料 U,↑│ 下一项资料 <Enter>,<Space>,↓ <br>

  <br>

</small><hr>
<p align="center">[<a href="index.htm">回到开始</a>][<a href="index.htm">上一层</a>][<a href="17.htm">下一篇</a>]
<p align="center"><a href="http://cterm.163.net">欢迎访问Cterm主页</a></p>
</table>
</body>
</html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -