可拓层次分析法的JAVA实现.doc

package com.util;import java.util.ArrayList;/* * * author Ahua * */public class WZ private ArrayList minU = new ArrayList();/判断矩阵集合下限,每个数组对应一行private ArrayList maxU = new ArrayList();/判断矩阵集合上限,每个数组对应一行private ArrayList W = new ArrayList();/权重private ArrayList minapqs = new ArrayList();private ArrayList maxapqs = new ArrayList();private ArrayList minX = new ArrayList();private ArrayList maxX = new ArrayList();private ArrayList minaij = new ArrayList();private ArrayList maxaij = new ArrayList();private Double k;private Double m;private ArrayList mins;private ArrayList maxs;private ArrayList sub;/maxs-minsprivate ArrayList results;public ArrayList getW(ArrayList minu,ArrayList maxu)this.minU = minu;this.maxU = maxu;/for (int i = 0; i minU.size(); i+) /for (int j = 0; j minu.get(i).length; j+) /System.out.print(minU.get(i)j);/System.out.println();/minapqs = getApqs(minU);maxapqs = getApqs(maxU);/for (int i = 0; i minapqs.size(); i+) /System.out.print(minapqs.get(i)+,);/minapqs = getApqs2(minapqs);/得到apq开n次方maxapqs = getApqs2(maxapqs);/得到apq开n次方/for (int i = 0; i minapqs.size(); i+) /System.out.print(minapqs.get(i)+,);/minX = getX(minapqs);/归一化/for (int i = 0; i minX.size(); i+) /System.out.print(minX.get(i)+,);/maxX = getX(maxapqs);/归一化minaij = getAij(maxU);/得到1/aij的和maxaij = getAij(minU);/for (int i = 0; i minaij.size(); i+) /System.out.print(minaij.get(i)+,a);/k = getK(minaij);m = getK(maxaij);/System.out.println(k+,+m);if(0=k & k=1)if(1=m)mins = getS(k,minX);maxs = getS(m, maxX);/for (int i = 0; i minaij.size(); i+) /System.out.print(mins.get(i)+,a);/sub = getSub(maxs,mins);/for (int i = 0; i sub.size(); i+) /System.out.print(sub.get(i)+,a);/results = getResults(mins,maxs,sub);/for (int i = 0; i results.size(); i+) /System.out.print(results.get(i)+,a);/W = getWs(results);return W;elseSystem.out.println(不符合要求，m小于1:+m);return null;else System.out.println(不符合要求，k:+k);return null;private ArrayList getWs(ArrayList results2) Double sum = 0.0;ArrayList resul= new ArrayList();for (int i = 0; i results2.size(); i+) sum += results2.get(i); for (int i = 0; i results2.size(); i+) resul.add(results2.get(i)/sum);return resul;private ArrayList getResults(ArrayList mins2,ArrayList maxs2, ArrayList sub2) ArrayList result = new ArrayList();Double minlast = mins2.get(mins2.size()-1);/System.out.println(minlast+=);Double sublast = sub2.get(sub2.size()-1);/System.out.println(sublast+=);for (int i = 0; i mins2.size(); i+) result.add(2.0*(maxs2.get(i)-minlast)/(sub2.get(i)+sublast);return result;private ArrayList getSub(ArrayList maxs2,ArrayList mins2) ArrayList subs = new ArrayList();for(int i=0;imaxs2.size();i+)subs.add(maxs2.get(i)-mins2.get(i);return subs;private ArrayList getS(Double k2, ArrayList minX2) ArrayList S= new ArrayList();for(int i=0;iminX2.size();i+)S.add(minX2.get(i)*k2);return S;private Double getK(ArrayList aij) Double sum = 0.0;for(int i=0;iaij.size();i+)sum +=aij.get(i);return Math.pow(sum, 1.0/2);private ArrayList getAij(ArrayList minu) ArrayList aij = new ArrayList();for (int i=0; i minu.get(i).length; i+) /System.out.println(i);double sum = 0.0;for(int j = 0;jminu.size();j+)sum =sum + minu.get(j)i;/System.out.print(sum+,a);aij.add(1.0/sum);if(i=3)break;return aij;private ArrayList getX(ArrayList apqs2) ArrayList x = new ArrayList();double sum = 0.0;for(int i=0;iapqs2.size();i+)sum +=apqs2.get(i); for (int i = 0; i apqs2.size(); i+) x.add(apqs2.get(i)/sum);return x;private ArrayList getApqs2(ArrayList apqs2) ArrayList apqs= new ArrayList();int size = apqs2.size();/System.out.println(1.0/size);for(int i=0;isize;i+)apqs.add(Math.pow(apqs2.get(i),1.0/size);return apqs;privat