没有合适的资源?快使用搜索试试~ 我知道了~
资源推荐
资源详情
资源评论
[cpp] view plaincopyprint?
01.#include<iostream>
02.#include<math.h>
03.#include<time.h>
04.using namespace std;
05.
06.//该程序是以蚁群系统为模型写的蚁群算法程序(强调:非蚂蚁周模型),以三个著名的TSP问题为测试对象
07.//通过微调参数,都可以获得较好的解
08.
09./*
10.//----------(1)问题一:Oliver 30 城市 TSP 问题 best_length = 423.7406; ------------------------
11.//该程序最好的结果是423.741,可运行多次获得
12.//城市节点数目
13.#define N 30
14.//城市坐标
15.double C[N][2]={
16. {2,99},{4,50},{7,64},{13,40},{18,54},{18,40},{22,60},{24,42},{25,62},{25,38},
17. {37,84},{41,94},{41,26},{44,35},{45,21},{54,67},{54,62},{58,35},{58,69},{62,32},
18. {64,60},{68,58},{71,44},{71,71},{74,78},{82,7},{83,46},{83,69},{87,76},{91,38}
19.};
20.//----------上面参数是固定的,下面的参数是可变的-----------
21.//蚂蚁数量
22.#define M 30
23.//最大循环次数NcMax
24.int NcMax = 500;
25.//信息启发因子,期望启发式因子,全局信息素挥发参数,局部信息素挥发参数, 状态转移公式中的q0
26.double alpha = 2, beta = 3, rou = 0.1, alpha1 = 0.1, qzero = 0.01;
27.//-----------问题一结束------------------------------------------------------------------------
28.*/
29.
01.#include<iostream>
02.#include<math.h>
03.#include<time.h>
04.using namespace std;
05.
06.//该程序是以蚁群系统为模型写的蚁群算法程序(强调:非蚂蚁周模型),以三个著名的TSP问题为测试对象
07.//通过微调参数,都可以获得较好的解
08.
09./*
10.//----------(1)问题一:Oliver 30 城市 TSP 问题 best_length = 423.7406; ------------------------
11.//该程序最好的结果是423.741,可运行多次获得
12.//城市节点数目
13.#define N 30
14.//城市坐标
15.double C[N][2]={
16. {2,99},{4,50},{7,64},{13,40},{18,54},{18,40},{22,60},{24,42},{25,62},{25,38},
17. {37,84},{41,94},{41,26},{44,35},{45,21},{54,67},{54,62},{58,35},{58,69},{62,32},
18. {64,60},{68,58},{71,44},{71,71},{74,78},{82,7},{83,46},{83,69},{87,76},{91,38}
19.};
20.//----------上面参数是固定的,下面的参数是可变的-----------
21.//蚂蚁数量
22.#define M 30
23.//最大循环次数NcMax
24.int NcMax = 500;
25.//信息启发因子,期望启发式因子,全局信息素挥发参数,局部信息素挥发参数, 状态转移公式中的q0
26.double alpha = 2, beta = 3, rou = 0.1, alpha1 = 0.1, qzero = 0.01;
27.//-----------问题一结束------------------------------------------------------------------------
28.*/
29.
30./*
31.//----------(2)问题二:Elion50 城市 TSP 问题 best_length = 427.96; ----------------------------
32.//该程序最好的结果是428.468,可运行多次获得
33.//城市节点数目
34.#define N 50
35.//城市坐标
36.double C[N][2]={
37. {5,64}, {5,25}, {5,6}, {7,38}, {8,52}, {10,17},
38. {12,42}, {13,13}, {16,57}, {17,33}, {17,63},
39. {20,26}, {21,47}, {21,10}, {25,32}, {25,55},
40. {27,68}, {27,23}, {30,48}, {30,15}, {31,62},
41. {31,32}, {32,22}, {32,39}, {36,16}, {37,69},
42. {37,52}, {38,46}, {39,10}, {40,30}, {42,57},
43. {42,41}, {43,67}, {45,35}, {46,10}, {48,28},
44. {49,49}, {51,21}, {52,33}, {52,41}, {52,64},
45. {56,37}, {57,58}, {58,27}, {58,48}, {59,15},
46. {61,33}, {62,42}, {62,63}, {63,69}
47.};
48.//----------上面参数是固定的,下面的参数是可变的-----------
49.//蚂蚁数量
50.#define M 50
51.//最大循环次数NcMax
52.int NcMax = 1000;
53.//信息启发因子,期望启发式因子,全局信息素挥发参数,局部信息素挥发参数, 状态转移公式中的q0
54.double alpha = 2, beta = 4, rou = 0.1, alpha1 = 0.1, qzero = 0.01;
55.//-----------问题二结束------------------------------------------------------------------------
56.*/
57.
58.//----------(3)问题三:Elion75 城市 TSP 问题 best_length = 542.31;
59.//该程序最好的结果是542.309,可运行多次获得
31.//----------(2)问题二:Elion50 城市 TSP 问题 best_length = 427.96; ----------------------------
32.//该程序最好的结果是428.468,可运行多次获得
33.//城市节点数目
34.#define N 50
35.//城市坐标
36.double C[N][2]={
37. {5,64}, {5,25}, {5,6}, {7,38}, {8,52}, {10,17},
38. {12,42}, {13,13}, {16,57}, {17,33}, {17,63},
39. {20,26}, {21,47}, {21,10}, {25,32}, {25,55},
40. {27,68}, {27,23}, {30,48}, {30,15}, {31,62},
41. {31,32}, {32,22}, {32,39}, {36,16}, {37,69},
42. {37,52}, {38,46}, {39,10}, {40,30}, {42,57},
43. {42,41}, {43,67}, {45,35}, {46,10}, {48,28},
44. {49,49}, {51,21}, {52,33}, {52,41}, {52,64},
45. {56,37}, {57,58}, {58,27}, {58,48}, {59,15},
46. {61,33}, {62,42}, {62,63}, {63,69}
47.};
48.//----------上面参数是固定的,下面的参数是可变的-----------
49.//蚂蚁数量
50.#define M 50
51.//最大循环次数NcMax
52.int NcMax = 1000;
53.//信息启发因子,期望启发式因子,全局信息素挥发参数,局部信息素挥发参数, 状态转移公式中的q0
54.double alpha = 2, beta = 4, rou = 0.1, alpha1 = 0.1, qzero = 0.01;
55.//-----------问题二结束------------------------------------------------------------------------
56.*/
57.
58.//----------(3)问题三:Elion75 城市 TSP 问题 best_length = 542.31;
59.//该程序最好的结果是542.309,可运行多次获得
剩余15页未读,继续阅读
资源评论
- database_zbye2012-10-01很好的蚁群算法实现,注释代码很规范。 能运行
dayu5_10
- 粉丝: 0
- 资源: 4
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功