function [bestpath,minpathlong]=GATSP(TSPMatrix,Popsize,MaxGeneration,Pc,Pm)
%遺傳算法解決旅行商問題
path=Initialize(Popsize,TSPMatrix);%初始化路徑
for i=1:MaxGeneration
    FP=Fitness(path,TSPMatrix);%計算適應度
    path=Select(path,FP);%輪盤賭選擇
    for j=1:2:Popsize
        [path(j,:),path(j+1,:)]=Crossover(path(j,:),path(j+1,:),Pc);%交叉,可選共四種交叉方式可供選擇CX,OX,EX
    end
    path=Mutation(path,Pm);%變異,有兩種方式可供選擇
    avgpathlong(i)=sum(pathlong(path,TSPMatrix))/Popsize;%平均長度;
    bestpathlong(i)=min(pathlong(path,TSPMatrix));%最短長度
end
[bestpath,minpathlong]=Output(path,TSPMatrix);%輸出結果
%繪圖
plot(avgpathlong);
hold on
plot(bestpathlong,'r');