C#实现的蚁群算法示例与详解

蚁群算法

using System;
using System.Collections.Generic;
using System.Text;

namespace AntSystem
{
    public class AA
    {
        /**//// <summary>
        /// 对信息量的重视程度
        /// </summary>
        private int alpha;
        /**//// <summary>
        /// 启发式信息的受重视程度
        /// </summary>
        private int beta;
        /**//// <summary>
        /// 信息素的挥发速度
        /// </summary>
        private double lo;
        /**//// <summary>
        /// 城市距离矩阵
        /// </summary>
        private double[,] City;
        /**//// <summary>
        /// 信息素矩阵
        /// </summary>
        private double[,] Message;

        /**//// <summary>
        /// opneList用于存放下一步可行城市
        /// </summary>
        private Queue<int> openList=new Queue<int> ();
        /**//// <summary>
        /// closedList用于存放已经访问过的城市
        /// </summary>
        private Queue<int> closedList=new Queue<int> ();
        /**//// <summary>
        /// 储存较好的路径
        /// </summary>
        private Queue <int> BestList=new Queue<int> ();
        private int Pro_time = 0;
        /**//////////////////////////////////////////////////////////
        /// <summary>
        /// 构造函数：形成城市距离和信息素矩阵
        /// </summary>
        /// <param name="city">城市距离矩阵</param>
        /// <param name="Lo"> 信息素的挥发速度</param>
        public AA(double[,] city,double Lo,int Alpha,int Beta)
        {
            alpha = Alpha;
            beta = Beta;
            lo=Lo;
            int temp = Convert.ToInt32( Math.Sqrt(city.Length));
            City=new double [temp,temp];
            Message=new double [temp,temp];
            for (int i = 0; i < temp; i++)
            {
                for (int j = 0; j < temp; j++)