//75個節(jié)點的TSP問題，其最好的結果是523.082，可運行多次獲得?
#include
#include
#include
using?namespace?std;
#define?N?75//城市節(jié)點數(shù)目
//城市坐標
double?C[N][2]={
	{625}?{743}?{956}?{1070}?{1128}
	{1217}?{1238}?{155}?{1514}?{1556}
	{1619}?{1764}?{2030}?{2148}?{2145}
	{2136}?{2253}?{2222}?{2629}?{2613}
	{2659}?{2724}?{2939}?{3050}?{3020}
	{3060}?{3176}?{3334}?{3344}?{3551}
	{3516}?{3560}?{366}?{3626}?{3833}
	{4037}?{4066}?{4060}?{4020}?{4146}
	{4326}?{4413}?{4542}?{4535}?{4766}
	{4821}?{5030}?{5040}?{5050}?{5070}
	{504}?{5015}?{5142}?{5226}?{5438}
	{5410}?{5534}?{5545}?{5550}?{5565}
	{5557}?{5520}?{5772}?{595}?{6015}
	{6257}?{6248}?{6235}?{62