資源簡(jiǎn)介
java實(shí)現(xiàn)AHP算法,包括文檔說明,算法介紹等ppt文檔
歡迎使用

代碼片段和文件信息
package?Ahp;
public?class?ahp
{
???int?colwidth;
???int?rowhigth;
???double?x1[]=new?double[20];
???double?x2[]=new?double[20];
???double?s1[]=new?double[20];
???double?standval[][]=new?double[20][20];
???double?input[][]=new?double[20][20];
???double?rollput[][]=new?double[20][20];
???double[][]?myrollput;
???double[]?verifyput=new?double[20];
???double?RI[]={000.520.891.121.261.361.411.461.491.521.541.561.581.59};
//RI數(shù)據(jù)不夠,至少需要20個(gè)數(shù)
??public?void?setValue(int?v1double[][]?v2){
???????? colwidth=v1;
???????? rowhigth=v1;
???????? input=v2;
????????}
??public?double?getcolsum(int?coliddouble[]?inputval)//求數(shù)組中各列值之和
??{
???????double?x;
???????int?i;
???????for(i=0;i
?? x1[colid]=x1[colid]+inputval[i];
?? //System.out.println(x1[colid]);
?? }
?? x=x1[colid];
???????return?x;
??}
??public?double[]?standardvalue(double?genedouble[]?inputval)//標(biāo)準(zhǔn)化
??{??
???????int?i;????
???????for(i=0;i ?????????s1[i]=inputval[i]/gene;
?????????//System.out.println(s1[i]+“&“);
???????}
???????return?s1;
??}
?public?double?eigenvector(int?rowiddouble[]?inputval)//計(jì)算特征向量
?{
???????double?x;
???????int?i;
???????for(i=0;i ?? //System.out.println(rowid);
?? x1[rowid]=x1[rowid]+inputval[i];
??
?? }
?? x=x1[rowid];
?? //System.out.println(x);
???????return?x/colwidth;?
??}
?public?double[][]?rollput()//轉(zhuǎn)置
?{
????????int?ij;
????????for(i=0;i ??????????for(j=0;j
????????????rollput[j][i]=input[i][j];
????????????//System.out.println(rollput[j][i]+“&“+i+“&“+j);
??????????}
????????}
???????return?rollput;?
?}
??public?double[]?getValue(){
?? int?ijk;
????????myrollput=rollput();//數(shù)組轉(zhuǎn)置????
??????????
????????for(i=0;i ???????????????x1[i]=getcolsum(imyrollput[i]);
???????????????//System.out.println(x1[i]);
????????}
?????????
????????//求和
???????????for(i=0;i ???????????????standval[i]=standardvalue(x1[i]myrollput[i]);
??????????????for(j=0;j ???????????????
?????????????????//System.out.println(standval[i][j]+“&“+i+“&“+j);
????????????????for(k=0;k ??????????????????if(k==j){
???????????????????x2[k]=x2[k]+standval[i][j];
???????????????????//System.out.println(x2[k]+“&“+standval[i][j]+k);
??????
??????????????????}
??????????????}?
???????????}
????????}
????????
????????//標(biāo)準(zhǔn)化
???????????for(i=0;i ???????????????x2[i]=x2[i]/colwidth;
???????????}
????????//計(jì)算特征向量
????????return?x2;
?????????//for(i=0;i ???????????//????System.out.println(x2[i]);
??????????//}
???}??
?
??public?boolean?getVerify(){
?????int?ij;
?????double[]?xver;
?????double?CICR=0;
?????double?MIN_VALUE=0.1;
?????double?myverify=0;
?????xver=getValue();
?????for(i=0;i ?????
????????for(j=0;j
???????????verifyput[i]=verifyput[i]+input[i][j
?屬性????????????大小?????日期????時(shí)間???名稱
-----------?---------??----------?-----??----
?????目錄??????????0??2004-08-20?13:44??nss_to_clg
?????文件???????3637??2002-06-20?18:01??nss_to_clg\ahp.java
?????文件???????3821??2002-07-18?14:03??nss_to_clg\ahp.jsp
?????文件???????3051??2002-06-24?20:21??nss_to_clg\ahpSub.jsp
?????文件???????3587??2004-04-23?19:56??nss_to_clg\ahptemp.java
?????文件???????3703??2002-06-25?18:54??nss_to_clg\ahptest.java
?????文件?????157184??2004-09-24?07:34??nss_to_clg\AHP計(jì)算方法.ppt
?????文件???????3875??2002-06-24?20:52??nss_to_clg\enum_ahp.jsp
?????文件???????3140??2002-06-24?21:08??nss_to_clg\enum_ahpSub.jsp
?????文件??????65536??2004-09-24?08:05??nss_to_clg\AHP算法流程.ppt
?????文件??????41472??2004-09-24?19:40??nss_to_clg\ahp.doc
-----------?---------??----------?-----??----
???????????????289006????????????????????11
評(píng)論
共有 條評(píng)論