Description: MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance needed for three salesmen to travel the start location to individual cities
and back to the original starting place)
To Search:
File list (Check if you may need any files):
遗传算法计算多旅行商问题\mtspf_ga_improving.m
........................\uavtravel.m
遗传算法计算多旅行商问题
Download