文件名称:mtspv_ga
介绍说明－－下载内容均来自于网络，请自行研究使用
基于遗传算法(GA)的多变量旅行商问题(TSP) ，MTSPV_GA Variable Multiple Traveling Salesman Problem (M-TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to a variation of the M-TSP (that has a
variable number of salesmen) by setting up a GA to search for the
shortest route (least distance needed for the salesmen to travel to
each city exactly once and return to their starting locations)
-Based on genetic algorithm (GA) multivariate traveling salesman problem (TSP), MTSPV_GA Variable Multiple Traveling Salesman Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations)
Finds a (near) optimal solution to a variation of the M-TSP (that has a
variable number of salesmen) by setting up a GA to search for the
shortest route (least distance needed for the salesmen to travel to
each city exactly once and return to their starting locations)
-Based on genetic algorithm (GA) multivariate traveling salesman problem (TSP), MTSPV_GA Variable Multiple Traveling Salesman Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly once and return to their starting locations)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
mtspv_ga.m