蚁群算法求解TSP问题 C++

C++代码：

//该程序是以蚁群系统为模型写的蚁群算法程序(强调：非蚂蚁周模型)，以TSP问题为测试对象

#include <iostream>
#include <math.h>
#include <time.h>
using namespace std;

#define N 75  //城市节点数目
//城市坐标
double C[N][2]={
   
{
   6,25}, {
   7,43}, {
   9,56}, {
   10,70}, {
   11,28},
{
   12,17}, {
   12,38}, {
   15,5}, {
   15,14}, {
   15,56},
{
   16,19}, {
   17,64}, {
   20,30}, {
   21,48}, {
   21,45},
{
   21,36}, {
   22,53}, {
   22,22}, {
   26,29}, {
   26,13},
{
   26,59}, {
   27,24}, {
   29,39}, {
   30,50}, {
   30,20},
{
   30,60}, {
   31,76}, {
   33,34}, {
   33,44}, {
   35,51},
{
   35,16}, {
   35,60}, {
   36,6}, {
   36,26}, {
   38,33},
{
   40,37}, {
   40,66}, {
   40,60}, {
   40,20}, {
   41,46},
{
   43,26}, {
   44,13}, {
   45,42}, {
   45,35}, {
   47,66},
{
   48,21}, {
   50,30}, {
   50,40}, {
   50,50}, {
   50,70},
{
   50,4}, {
   50,15}, {
   51,42}, {
   52,26}, {
   54,38},
{
   54,10}, {
   55,34}, {
   55,45}, {
   55,50}, {
   55,65},
{
   55,57}, {
   55,20}, {
   57,72}, {
   59,5}, {
   60,15},
{