搜索资源列表
GATSP
- 用遗传算法写的求解TSP问题 四种情况 多旅行商单出发点 多旅行商多出发点 单旅行商以点的坐标计算及以距离矩阵计算-Written by using genetic algorithms for solving TSP problems, four cases: more than a single starting point for traveling salesman, multi-traveling salesman more than a starting point, a singl
pso_NEW_1
- 运用多目标蚁群算法求解旅行商问题，很好的一个程序。-The use of multi-objective Ant Colony Algorithm for Solving Traveling Salesman Problem, a good one.
PS0-TSP
- 多目标问题，粒子群优化算法，解决单旅行商问题-Multi-objective problem, particle swarm optimization algorithm to solve the traveling salesman problem alone
TSP
- 遗传算法在旅行商问题下的一种应用代码，一种能够解决多维背包问题的应用代码。-Genetic algorithm in the traveling salesman problem of a kind of application code, one can solve the multi-dimensional knapsack problem application code.
MDVRP
- 针对多车场vrp问题，使用遗传算法用matlab进行编码，同时加入了单线路局部优化-TSP problem for multi- traveling salesman problem of genetic algorithm matlab program
40961019Multi-travelingsalesmanproblem
- 本文件是一个于用求解多目标tsp的算法程序代码(An algorithm for solving multi-objective TSP algorithm code)
基于遗传算法的 TSP 算法
- tsp问题（全称：TravellingSalesmanProblem），又称为旅行商问题、货郎担问题、TSP问题，是一个多局部最优的最优化问题，遗传算法是一种基于种群演变一种优化的算法，在此基础上的优化程序会自动寻找出最短路(TSP (full name: TravellingSalesmanProblem), also known as the traveling salesman problem, traveling salesman problem, but TSP problem is