搜索资源列表
TSPinmatlab
- 用遗传算法解决城市的访问次序，可使其 旅行路线的总长度最短 可从该程序借鉴到其他应用 -using genetic algorithms to solve the city for the visit, travel routes can make the total length of the shortest can draw from the procedures of other applications
TSPprogrammatlab
- 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-known cities between the distance from the existing one must salesman n visited this city, every city and can only be visited once, finally starting to return to t
Vehicle-Routing-Problem
- 车辆行驶路线优化（Vehicle Routing Problem）-traffic route optimization (Vehicle Routing Problem)
TSPproblem
- 遗传算法解决TSP问题 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-genetic algorithm known TSP n cities between the distance, must present a salesman traveled this n cities, and each city can only be visited once, La
ailinesight
- 基本路径搜索之遇到障碍物问题 并且可以标记出所走路线-basic path Search's problems and obstacles encountered can be labeled as follow routes
tanxi
- 贪心算法解决送货员问题，使其走过的路线尽量减少，近似解求得NP问题的解。
AntTSP
- 蚁群算法解决TSP问题,界面实现,有城市,有坐标,有路线,是我自己编的
Eight-puzzleproblems
- 运用A+算法实现的八数码问题，并能输出选择路线
电脑鼠走迷宫源代码
- 电脑鼠走迷宫，修改了速度调节，平滑转弯，深度修正路线,Computer Mouse Maze, modify the speed regulation, smooth turning, the depth correction line
tsp.rar
- 旅行商问题，总共30个城市，计算最优路线和最短路径,Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path
33
- 有界面的遗传算法程序 最小路径的运输路线选择。总体而言很不错的-A genetic algorithm program interface minimum path choice of transport routes. Overall, very good
client-leader-program
- 先锋3机器人 客户端领航者控制程序 行走路线为弓字形-Pioneer 3 robot client navigator control procedures routes for the bow-shaped
GAvrp
- 该算法经运行，无任何问题，可用于解决遗传算法求解车辆路线问题-The algorithm by running without any problems, can be used for genetic algorithm to solve Vehicle Routing Problem
Generic-Algorithm-for-TSP
- 运用优化遗传算法解决100个城市的TSP问题，即要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程最小。-Optimize the use of genetic algorithms to solve 100 cities TSP problem, which was to select a departure from the resident, after each city once again, and finally returned to the resident
Legao_robot_sourcecode
- Legao机器人识别道路行走的代码，能绕着黑色路线行走-Robot road Legao identification code that can walk around the black line
Matlab
- 用matlab解决TSP旅行商问题，30个城市的路线优化问题-Matlab solving TSP traveling salesman problem
ACOforTSP
- tsp问题的群蚁算法实现，其中c为测试矩阵，代表各点的相对坐标，NC_max 最大迭代次数 ，m蚂蚁个数，Alpha 表征信息素重要程度的参数，Beta 表征启发式因子重要程度的参数，Rho 信息素蒸发系数，Q 信息素增加强度系数，R_best 各代最佳路线，L_best 各代最佳路线的长度，运行后得到最佳路线和收敛曲线-ant problem tsp algorithm group, of which c for the test matrix, the representative of
yiqunsuanfa
- 运用蚁群算法解决TSP问题，找到最好的城市路线。-Using ant colony algorithm to solve TSP problem, find the best line of the city.
gjlx
- 一个用VB写的公交路线自己随意改的程序，鼠标控制路线-A bus route with VB written in their own procedures for random change, mouse control line
ACATSP
- C表示 n个城市的坐标，为n×2的矩阵 NC_max为最大迭代次数 m表示蚂蚁个数 Alpha 表征信息素重要程度的参数 Beta 表征启发式因子重要程度的参数 Rho 信息素蒸发系数 Q 信息素增加强度系数 R_best 各代最佳路线 L_best 各代最佳路线的长度-C indicated that the coordinates of n cities, in order to n × 2 matrix NC_max maximum numbe