TSP问题及蚁群算法理解与实现

/**
 * Created by coco on 17-10-20.
 */
import java.io.*;
import java.util.logging.Logger;

import static java.util.logging.Logger.getLogger;

public class ACO {

    private Ant[] ants; // 蚂蚁
    private int antNum; // 蚂蚁数量
    private int cityNum; // 城市数量
    private int MAX_GEN; // 运行代数
    private float[][] pheromone; // 信息素矩阵
    private int[][] distance; // 距离矩阵
    private int bestLength; // 最佳长度
    private int[] bestTour; // 最佳路径

    // 三个参数
    private float alpha;
    private float beta;
    private float rho;

    public ACO() {

    }

    /**
     * constructor of ACO
     *
     * @param n
     *            城市数量
     * @param m
     *            蚂蚁数量
     * @param g
     *            运行代数
     * @param a
     *            alpha
     * @param b
     *            beta
     * @param r
     *            rho
     *
     **/
    public ACO(int n, int m, int g, float a, float b, float r) {
        cityNum = n;
        antNum = m;
        ants = new Ant[antNum];
        MAX_GEN = g;
        alpha = a;
        beta = b;
        rho = r;
    }

    /**
     * 初始化ACO算法类
     * @param filename 数据文件名，该文件存储所有城市节点坐标数据
     * @throws IOException
     */
    private void init(String filename,int firstCity,int lastCity) throws IOException {
        // 读取数据
        int[] x;
        int[] y;
        String strbuff;
        BufferedReader data = new BufferedReader(new InputStreamReader(
                new FileInputStream(filename)));
        distance = new int[cityNum][cityNum];
        x = new int[cityNum];
        y = new int[cityNum];
        for (int i = 0; i < cityNum; i++) {
            // 读取一行数据，数据格式1 6734 1453
            strbuff = data.readLine();
            // 字符分割
            String[] strcol = strbuff.split(" ");
            x[i] = Integer.valueOf(strcol[0]);// x坐标
            y[i] = Integer.valueOf(strcol[1]);// y坐标
        }
        // 计算距离矩阵
        // 针对具体问题，距离计算方法也不一样，此处用的是att48作为案例，它有48个城市，距离计算方法为伪欧氏距离，最优值为10628
        for (int i = 0; i < cityNum - 1; i++) {
            distance[i][i] = 0; // 对角线为0
            for (int j = i + 1; j < cityNum; j++) {
                double rij = Math
                        .sqrt(((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j])
                                * (y[i] - y[j])) / 10.0);
                // 四舍五入，取整
                int tij = (int) Math.round(rij);
                if (tij < rij) {
                    distance[i][j] = tij + 1;
                    distance[j][i] = distance[i][j];
                } else {
                    distance[i][j] = tij;
                    distance[j][i] = distance[i][j];
                }
            }
        }
        distance[cityNum - 1][cityNum - 1] = 0;
        // 初始化信息素矩阵
        pheromone = new float[cityNum][cityNum];
        for (int i = 0; i < cityNum; i++) {
            for (int j = 0; j < cityNum; j++) {
                pheromone[i][j] = 0.1f; // 初始化为0.1
            }
        }
        bestLength = Integer.MAX_VALUE;
        bestTour = new int[cityNum + 1];

        // 随机放置蚂蚁
        for (int i = 0; i < antNum; i++) {
            ants[i] = new Ant(cityNum);
            ants[i].init(distance, alpha, beta,firstCity,lastCity);
        }
    }

    public void solve() {
        // 迭代MAX_GEN次
        for (int g = 0; g < MAX_GEN; g++) {
//            if(g%100 == 0)
//                System.out.println("正在进行第 "+g+" 次迭代……");
            // antNum只蚂蚁
            for (int i = 0; i < antNum; i++) {
                // i这只蚂蚁走cityNum步，完整一个TSP
                for (int j = 1; j < cityNum; j++) {
                    ants[i].selectNextCity(pheromone);
                }

                // 把这只蚂蚁起始城市加入其禁忌表中
                // 禁忌表最终形式：起始城市,城市1,城市2...城市n,终点城市
      
                // 查看这只蚂蚁行走路径距离是否比当前距离优秀
                if (ants[i].getTourLength() < bestLength) {
                    // 比当前优秀则拷贝优秀TSP路径
                    bestLength = ants[i].getTourLength();

                 for (int k = 0; k < ants[i].getTabu().size() ; k++) {
                        bestTour[k] = ants[i].getTabu().get(k).intValue();
                    }
              }
                // 更新这只蚂蚁的信息数变化矩阵，对称矩阵
                for (int j = 0; j < ants[i].getTabu().size() - 1; j++) {
                    ants[i].getDelta()[ants[i].getTabu().get(j).intValue()][ants[i]
                            .getTabu().get(j + 1).intValue()] = (float) (1. / ants[i]
                            .getTourLength());
                    ants[i].getDelta()[ants[i].getTabu().get(j + 1).intValue()][ants[i]
                            .getTabu().get(j).intValue()] = (float) (1. / ants[i]
                            .getTourLength());
                }
            }
            // 更新信息素
            updatePheromone();

            for (int i = 0; i < antNum; i++) {
                ants[i].init(distance, alpha, beta,ants[i].getFirstCity(),ants[i].getLastCity());
            }
        }

        // 打印最佳结果
         writeToFile();
         System.out.flush();
    }

    // 更新信息素
    private void updatePheromone() {
        // 信息素挥发
        for (int i = 0; i < cityNum; i++)
            for (int j = 0; j < cityNum; j++)
//                pheromone[i][j] = pheromone[i][j] * (1 - rho);
                pheromone[i][j] = pheromone[i][j] * rho ;
        // 信息素更新
        for (int i = 0; i < cityNum; i++) {
            for (int j = 0; j < cityNum; j++) {
                for (int k = 0; k < antNum; k++) {
                    pheromone[i][j] += ants[k].getDelta()[i][j];
                }
            }
        }
    }

    //输出到文件
    private void writeToFile(){
        File of = new File("/home/coco/Downloads/result.txt");
        try {
            FileWriter fw = new FileWriter(of,true);
            fw.append("The optimal length is: " + bestLength + "\r\n");
            fw.append("The optimal tour is:");
            for (int i = 0; i < cityNum; i++) {
                fw.append(bestTour[i] + " ");
            }
            fw.append("\r\n");
            fw.close();
        }catch(Exception e){e.printStackTrace();}
    }


    /**
     * @param args
     * @throws IOException
     */
    public static void main(String[] args) throws Exception {
        System.out.println("Start....");
        ACO aco = new ACO(48, 100, 300, 1.f, 5.f, 0.5f);

        for (int i = 0; i < 40; i++) {
            int firstCity = (int)(Math.random()*48);
            int lastCity = (int)(Math.random()*48);
                        System.out.println("第"+ i+ "对起点终点\tfirstCity:"+firstCity + "\tlastCity:"+lastCity);
            System.err.flush();
            aco.init("/home/coco/Downloads/data.txt",firstCity,lastCity);
            aco.solve();
        }

    }

}