搜索资源列表
matlog
- 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Sho
TravelingSalesmanProblemGeneticAlgorithm
- Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
MainAneal
- 求最短路径 tsp matlab M文件-The shortest path tsp matlab
aco
- 利用蚁群算法求解tsp（旅行商）问题，给出遍历方案，最后求出最短路径。-Ant colony algorithm for tsp (TSP) problem, given traversal solutions, and finally find the shortest path.
YIQun
- Matlab实现蚁群寻找最短路径的TSP问题，有图像描述。-Matlab to find the shortest path to achieve ant TSP problem, there is the image descr iption.
Matlab_tsp
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序 D是距离矩阵，n为种群个数 参数a是中国31个城市的坐标 C为停止代数，遗传到第 C代时程序停止,C的具体取值视问题的规模和耗费的时间而定 m为适应值归一化淘汰加速指数,最好取为1,2,3,4,不宜太大 alpha为淘汰保护指数,可取为0~1之间任意小数,取1时关闭保护功能,建议取0.8~1.0之间的值 R为最短路径,Rlength为路径长度- TSP problem (also known as: traveling
lujing
- 蚁群算法 TSP商旅问题 最优路径 最短路问题-Ant colony algorithm TSP business problems The optimal path The shortest path problem The application of graph theory
ant
- ant colony algorithm for tsp calculate the shortest path between differnt cities. traveler pass from any city onr time
TSP(matlab)
- 用蚁群算法来求解最短路径问题，在matlab下运行-Ant colony algorithm to solve the shortest path problem, run in matlab
ACO_TSP
- 研究蚁群算法的经典论文和解决TSP问题的源程序。绘制最短路径图和收敛图。-classic papers and problem solving TSP source program. Draw the shortest path map and convergence graph.
GA_BP
- 用遗传算法解决最短路径优化TSP问题(附matlab源程序.txt)-The solvelution of the shortest path optimization problem TSP by using genetic algorithms
AOCpro
- 基于蚁群算法的TSP实现，可计算数模运输问题中的最短路径问题-TSP based on ant colony algorithm to achieve, can calculate the shortest path problem of the d/a transportation problem
TPS_Solve_Problem
- 对旅行商最短路径的TPS经典问题求解，研究生课程《控制理论及其应用》课本里的原书matlab程序代码。-The TSP shortest path to the classic TPS problem solving, the course control theory and its application in the original book matlab code.
TSP问题代码
- 本文是以旅行商问题为研究点，利用蚂蚁算法优化求解最短路径，平台工具是具有绘图功能的matlab软件。(This paper takes traveling salesman problem as the research point, and uses ant algorithm to optimize the shortest path. The platform tool is matlab software with drawing function.)
基于遗传算法的 TSP 算法
- tsp问题（全称：TravellingSalesmanProblem），又称为旅行商问题、货郎担问题、TSP问题，是一个多局部最优的最优化问题，遗传算法是一种基于种群演变一种优化的算法，在此基础上的优化程序会自动寻找出最短路(TSP (full name: TravellingSalesmanProblem), also known as the traveling salesman problem, traveling salesman problem, but TSP problem is
BPwangluo
- 这是一个没有利用MATLAB工具箱编写的遗传算法 用来求解TSP问题寻求最短路径(This is a genetic algorithm that is not written using the MATLAB toolbox Used to solve the TSP problem to find the shortest path)
最短路径（Dijkstra算法）
- 已知两点，求该两地那间的最短路径，注意与TSP有区别。(When two points are known, the shortest path between the two places is considered, noting that there is a difference between TSP and the other.)
AntColonyOptimization-TSP
- 蚁群算法作为新发展的一种模拟蚂蚁群体智能行为的仿生优化算法，它具有较强的鲁棒性、优良的分布式计算机制、易于与其他方法相结合等优点，本算法用来解决最短路径问题，并在TSP旅行商问题上取得较好的成效。同时也可以在他领域如图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类进行参考。(Ant colony algorithm is a newly developed bionic optimization algorithm that simulates the ant colony intel
jinji
- 禁忌搜索算法，主要为解决TSP问题，选取31个城市，目标是31个城市的路径最短化(Tabu search algorithm, mainly to solve the TSP problem, select 31 cities, the goal is the shortest path of 31 cities.)
TSP路径规划
- TSP问题实现多目标点的路径规划，使其路径最短(The TSP problem realizes the path planning of multiple target points, making the shortest path.)