搜索资源列表
GA-TSP
- 遗传算法求解货郎担问题 虽然有些简单 但是绝对适合初学者学习-Genetic algorithm to solve the traveling salesman problem is simple but absolutely suitable for beginners to learn
VRP
- 实现简单路径规划问题,也可以说是旅行商问题,货郎担问题 -Simple path planning problem is the traveling salesman problem, traveling salesman problem
TSPSA
- 模拟退火法的原理说明和基于模拟退火法的货郎担问题求解。-The principle of simulated annealing algorithm based on simulated annealing algorithm descr iption and the traveling salesman problem solving.
TSP
- 旅行商问题(Traveling Saleman Problem,TSP)又译为旅行推销员问题、货郎担问题,简称为TSP问题,是最基本的路线问题,该问题是在寻求单一旅行者由起点出发,通过所有给定的需求点之后,最后再回到原点的最小路径成本。采用回溯法,邻点法实现,有图形界面。-TSP (Traveling Saleman Problem, TSP) also translated as traveling salesman problem,
monituihuo
- TSP问题(货郎担问题,旅行商问题)的模拟退火算法通用malab源程序-The TSP (traveling salesman problem, traveling salesman problem) simulated annealing algorithm generic malab source
TSPS
- TSP问题(货郎担问题,旅行商问题)的模拟退火算法通用malab源程序-TSP (traveling salesman problem, traveling salesman problems) general malab source program of simulated annealing algorithm
Traveling-salesman-problem
- 货郎担问题,最短路径算法,使用c++实现-Traveling salesman problem using the shortest path algorithm data structure to achieve c++
geneticTSP
- TSP问题(又名:旅行商问题,货郎担问题)遗传算法通用matlab程序,数模专用- TSP problem (also known as: traveling salesman problem, traveling salesman problem) common genetic algorithm matlab program, special modulus
lxs
- TSP问题(又名:旅行商问题,货郎担问题)遗传算法通用matlab程序-The TSP problem (also known as: traveling salesman problem, traveling salesman problem) general matlab genetic algorithm
Hamilton-loop-algorithm
- 利用哈密尔顿圈算法解决旅行售货员问题和货郎担问题,从而使走过的路程最短。-By using Hamilton loop algorithm to solve traveling salesman problem and traveling salesman problem, so that through the path the shortest.
TSP
- 旅行商问题,即TSP问题(Travelling Salesman Problem)又译为旅行推销员问题、货郎担问题,是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路径的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。-Traveling Salesman Problem, or TSP problem (Travelling Sale
SA_TSPproblem
- TSP问题(货郎担问题,旅行商问题)的模拟退火算法通用malab源程序-TSP problem (traveling salesman problem, traveling salesman problem) simulated annealing algorithm malab common source
TSP
- 用遗传算法去解决TSP问题。TSP问题也叫旅行商问题或货郎担问题,是数学领域中著名的问题之一。-Using genetic algorithm to solve TSP problem. The TSP problem also called traveling salesman problem and traveling salesman problem, is one of the prominent problems in mat
Traveling-Salesman-Problem
- C语言解决旅行商问题(货郎担问题),使用的是遗传算法-C language to solve the traveling salesman problem (TSP), using a genetic algorithm
some-problems
- 一些实际的问题处理算法,例如网络最短路径Dijkstra算法、货郎担限界算法等-Some practical problems processing algorithms, such as Dijkstra Shortest Path algorithm, traveling salesman Bound algorithm
Astar-to-solve-TSP
- A* 算法的一个应用,货郎担(旅行商)问题。设有n个城市,城市之间均有道路,一个旅行商从某城市出发,经过其余n-1个城市一次且仅一次,最后回到出发的城市,他如何走才能使他所走的路程最短?-Traveling salesman problem and the optimal solution
salesman.problem
- 用C++语言解决经典的货郎担问题 货郎担问题代码 vs2013 -To solve the traveling salesman problem VS2013
基于遗传算法的 TSP 算法
- tsp问题(全称:TravellingSalesmanProblem),又称为旅行商问题、货郎担问题、TSP问题,是一个多局部最优的最优化问题,遗传算法是一种基于种群演变一种优化的算法,在此基础上的优化程序会自动寻找出最短路(TSP (full name: TravellingSalesmanProblem), also known as the traveling salesman problem, traveling salesma
86205569
- 分支限界法实现货郎担问题,开发工具eclipse()
ACATSP
- 旅行商问题(Traveling Saleman Problem,TSP)是车辆路径调度问题(VRP)的特例,由于数学家已证明TSP问题是NP难题,因此,VRP也属于NP难题。旅行商问题(TSP)又译为旅行推销员问题、货郎担问题,简称为TSP问题,是最基本的路线问题,该问题是在寻求单一旅行者由起点出发,通过所有给定的需求点之后,最后再回到原点的最小路径成本(Traveling salesman Problem ('ll Saleman P