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

📄 2.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="3.htm">下一篇</a>]
<hr><p align="left"><small>发信人: coy (我爱美好哦), 信区: Algorithm <br>

标  题: 遗传算法（2） <br>

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

  <br>

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

void main(argc,argv) <br>

int argc; <br>

char *argv[]; <br>

{ <br>

  MATRIX equalities, <br>

         inequalities, <br>

         domains, <br>

         a1, <br>

         a2, <br>

         inv_a1, <br>

         c1, <br>

         c2, <br>

         new_in_eq, <br>

         org_ineq, <br>

         final_mat, <br>

         inva1_a2; <br>

  VECTOR inva1_b, <br>

         eq_rhs, <br>



         ineq_rhs, <br>

         ldomain, <br>

         udomain, <br>

         l1, <br>

         l2, <br>

         u1, <br>

         u2, <br>

         X; <br>

  IMATRIX var_order; <br>

  IVECTOR eq_co, <br>

          ineq_co, <br>

          x1, <br>

          x2, <br>

          cart; <br>

  FLAG _PROGEND; <br>

  INDEX fin, <br>

        newin, <br>

        a1a2; <br>

  int cart_count = 0, <br>

      tot_combi, <br>

      i, <br>

      org_col, <br>

      org_col, <br>

      tot_var, <br>

      tot_equ, <br>

      tot_ine, <br>

      tot_dom, <br>

      x2_vari, <br>

      tot_arr[4]; <br>

  <br>

  seed(); <br>

  <br>

  input = fopen(argv[1],"r"); <br>

  if(input == NULL) <br>

    { <br>

      printf("Open of %s for input failed",argv[1]); <br>

      exit(1); <br>

    } <br>

  output = fopen(argv[2],"w"); <br>

    if(output == NULL) <br>

    { <br>

      printf("Open of %s for input failed",argv[2]); <br>

      exit(1); <br>

    } <br>

  fscanf(input," %d",&tot_arr[0]); <br>



  fscanf(input," %d",&tot_arr[1]); <br>

  fscanf(input," %d",&tot_arr[2]); <br>

  fscanf(input," %d",&tot_arr[3]); <br>

  fin.r = tot_arr[2]+tot_arr[0]; <br>

  fin.c = tot_arr[0]-tot_arr[1]+2; <br>

  org_col = tot_arr[0]-tot_arr[1]+1; <br>

  tot_var = tot_arr[0]; <br>

  tot_equ = tot_arr[1]; <br>

  tot_ine = tot_arr[2]; <br>

  tot_dom = tot_arr[3]; <br>

  x2_vari = tot_arr[0] - tot_arr[1]; <br>

  newin.r = tot_equ; <br>

  newin.c = fin.c; <br>

  a1a2.r = tot_equ; <br>

  a1a2.c = org_col; <br>

  final_mat = matrix(1,fin.r,1,fin.c); <br>

  equalities = matrix(1,tot_equ,1,tot_var+1); <br>

  eq_co = ivector(1,tot_var); <br>

  eq_rhs = vector(1,tot_equ); <br>

  a1 = matrix(1,tot_equ,1,tot_equ); <br>

  a2 = matrix(1,tot_equ,1,x2_vari); <br>

  inv_a1 = matrix(1,tot_equ,1,tot_equ); <br>



  inva1_a2 = matrix(1,tot_equ,1,x2_vari); <br>

  inva1_b = vector(1,tot_equ); <br>

  new_in_eq = matrix(1,tot_equ,1,fin.c); <br>

  inequalities = matrix(1,tot_ine,1,tot_var+1); <br>

  ineq_co = ivector(1,tot_var); <br>

  ineq_rhs = vector(1,tot_ine); <br>

  c1 = matrix(1,tot_ine,1,tot_equ); <br>

  c2 = matrix(1,tot_ine,1,x2_vari); <br>

  org_ineq = matrix(1,tot_ine,1,org_col); <br>

  domains = matrix(1,tot_var,1,3); <br>

  ldomain = vector(1,tot_var); <br>

  udomain = vector(1,tot_var); <br>

  l1 = vector(1,tot_equ); <br>

  l2 = vector(1,x2_vari); <br>

  u1 = vector(1,tot_equ); <br>

  u2 = vector(1,x2_vari); <br>

  X = vector(1,tot_var); <br>

  x1 = ivector(1,tot_equ); <br>

  x2 = ivector(1,x2_vari); <br>

  var_order = imatrix(1,tot_var,1,2); <br>

  cart = ivector(1,tot_equ); <br>

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



  for(i=1; i<=tot_var; i++) <br>

    { <br>

      eq_co[i] = i; <br>

      ineq_co[i] = i; <br>

    } <br>

  for(i=1; i<=tot_equ; i++) <br>

    eq_rhs[i] = equalities[i][tot_var+1]; <br>

   for(i=1; i<=tot_ine; i++) <br>

    ineq_rhs[i] = inequalities[i][tot_var+1]; <br>

  print_equalities(equalities,tot_var,tot_equ,eq_co,eq_rhs); <br>

  print_inequalities(inequalities,tot_var,tot_ine,ineq_co,ineq_rhs); <br>

  print_domains(domains,tot_var); <br>

  free_ivector(eq_co,1,tot_var); <br>

  free_ivector(ineq_co,1,tot_var); <br>

  do <br>

    { <br>

      if(tot_equ != 0) <br>

 { <br>

   cart_count = p_equalities(equalities,tot_arr,cart,cart_count+1,&tot_combi); <br>

  <br>

   get_var_order(tot_arr,cart,var_order); <br>

  <br>

  <br>

   find_x1_x2(tot_var,var_order,x1,x2); <br>

  <br>

   find_ac1_ac2(tot_equ,tot_equ,x2_vari,x1,x2,equalities,a1,a2); <br>

  <br>

   inverse(a1,inv_a1,tot_equ); <br>

  <br>

   mmprod(tot_equ,tot_equ,x2_vari,inva1_a2,inv_a1,a2); <br>

  <br>

   mvprod(tot_equ,tot_equ,inva1_b,inv_a1,eq_rhs); <br>

  <br>

   find_ac1_ac2(tot_equ,tot_ine,x2_vari,x1,x2,inequalities,c1,c2); <br>

  <br>

   find_limits(tot_var,domains,ldomain,udomain); <br>

  <br>

   find_lu1_lu2(tot_arr,x1,x2,ldomain,l1,l2); <br>

   find_lu1_lu2(tot_arr,x1,x2,udomain,u1,u2); <br>

  <br>

   find_new_in_eq(inva1_b,inva1_a2,l1,u1,newin,new_in_eq); <br>

  <br>

   find_org_in_eq(inva1_b,inva1_a2,ineq_rhs,c1,c2,tot_ine,a1a2,org_ineq); <br>

  <br>

   initialize(final_mat,fin); <br>



  <br>

   find_final_mat1(x2,l2,u2,final_mat,x2_vari,fin.c); <br>

   find_final_mat2(new_in_eq,tot_equ,fin.c,org_col,final_mat); <br>

   find_final_mat3(org_ineq,tot_ine,org_col,tot_var+1,final_mat); <br>

 } <br>

      else <br>

 { <br>

   for (i=1; i<=tot_var; i++) <br>

     { <br>

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

       x2[i] = domains[i][2]; <br>

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

     } <br>

   initialize(final_mat,fin); <br>

   find_final_mat1(x2,l2,u2,final_mat,tot_var,fin.c); <br>

   if(tot_ine != 0) <br>

     find_final_mat3(inequalities,tot_ine,org_col,tot_var+1,final_mat); <br>

 } <br>

      _PROGEND = initialize_x2(final_mat,fin,x1,x2,tot_equ,X,inva1_b); <br>

    }while((!_PROGEND)&&(cart_count < tot_combi)); <br>

  free_vector(eq_rhs,1,tot_equ); <br>

  free_vector(ineq_rhs,1,tot_ine); <br>



  free_vector(ldomain,1,tot_var); <br>

  free_vector(udomain,1,tot_var); <br>

  free_vector(l1,1,tot_var); <br>

  free_vector(l2,1,x2_vari); <br>

  free_vector(u1,1,tot_equ); <br>

  free_vector(u2,1,x2_vari); <br>

  free_ivector(cart,1,tot_equ); <br>

  if(tot_equ != 0) <br>

    { <br>

      if(cart_count >= tot_combi) <br>

 { <br>

   fprintf(output,"Incorrect data"); <br>

   exit(1); <br>

 } <br>

  <br>

      optimization(X,x1,x2,final_mat,fin,tot_equ,inva1_b); <br>

    } <br>

  else <br>

    optimization(X,x2,x2,final_mat,fin,tot_equ,inva1_b); <br>

  fclose(output); <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="3.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 + -