搜索资源列表
TSP.rar
- 通过模拟退火的HOPFIELD神经网络求解TSP问题,HOPFIELD through simulated annealing neural network for solving the TSP problem
TSP
- 旅行商问题，两种方法实现，分别是递归回溯和用栈来代替递归的功能的程序-Traveling salesman problem, two methods to achieve, namely, retrospective and the use of recursive stack instead of recursive function procedures
tsp
- 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its descr iption of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path
1
- TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一,旅行商的VC算法实现-TSP problem (Travelling Salesman Problem) is a well-known problem in mathematics, one of the VC algorithm traveling salesman
TSP
- 本程序实现了NPC问题旅行商的三个近似算法。-This procedure achieved a traveling salesman problem NPC three approximation algorithm.
sa_tsp
- 旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TS
ACO-TSP
- 利用蚁群算法解决旅行商问题，其中运用智能蚂蚁算法-Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem
tsp--yichuangsuanfa
- 程序对48个城市的TSP问题（城市坐标文件对应于48.txt）进行计算，求解路径和最优路径图如下。 48个城市结果，大的红*表示路径开始城市，途经城市依次用蓝色方块和红色*标示。 -Procedures of the 48 cities TSP problem (document coordinates corresponding to the city 48.txt) to calculate the optimal solution of the path and road map
Multi-travelingsalesmanproblem
- 多旅行商问题是单旅行商问题的扩展, 具有更广泛的实际意义。在研究M TSP 解的特点的基础上, 提 出了最小化总行程和均分多个旅行商访问点数、最小化总行程及均分访问路程的两个多目标的M TSP 问题, 并分别给出了相应的数学模型、求解算法和应用实例, 实例表明模型的正确性。-Multi-traveling salesman problem traveling salesman problem is a single expansion, with a wider range of pra
TSP
- 此程序是用于tsp问题，也就是单旅行商问题，内容全面，讲解清晰-This procedure is used for tsp problem, traveling salesman problem is a single, comprehensive, on a clear
tsp
- matlat源程序解决tsp问题,使用的是遗传算法，与普通的程序不同，本程序详细介绍了遗传算子的构造-MATLAB to solve tsp problem
TSP
- 一个求解旅行商问题（TSP）的程序，效果不错，时间还可以-A Traveling Salesman Problem (TSP) program, the effect is true, time can also be
TSP
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
TSP
- 在Visual C++ 编译环境下，遗传算法的程序，并利用它们求解了48个城市的TSP问题。-In the Visual C++ compiler environment, the genetic algorithm process, and use them to solve a 48 cities TSP problem.
tsp
- 用VB写的利用蚁群优化算法解决的20个点的TSP问题，给出了路径以及经过每个点的顺序。-Using VB to write the use of ant colony optimization algorithm to solve the 20 points of TSP problem, given the path and through each point order.
PSO-for-TSP-of-51-city
- 为本人毕业设计里，粒子群算法的一个应用，求解51个城市的TSP问题，城市的个数和位置都可以改动，并与遗传算法求解的结果进行对比!-I graduated from the design, the application of the particle swarm algorithm for solving the 51 cities TSP problem, the number and location of the city can be altered, and compared with
TSP
- TSP问题是经典的寻优问题 也是人工智能里一个重要的问题 我编写的程序主要是用蚁群算法来解决这个问题。蚁群算法是人工智能里用来寻优的重要算法 由于蚁群算法的优点使得TSP问题能够实现。 -The TSP problem is a classical optimization problem is also an important problem in artificial intelligence programs written in my main is to use ant colo
ACO-to-solve-TSP-problem
- 算法使用蚁群算法求解TSP问题，使得最终所需时间短，效率高。-Algorithm using ant colony algorithm for TSP problem, so that the final time is short, high efficiency.
遗传算法TSP
- 基于遗传算法的TSP问题，连续HOPfield网络优化(TSP problem based on genetic algorithm and optimization of continuous HOPfield network)
人工鱼群求解TSP问题
- 用matlab解决人工鱼群算法处理TSP问题(Solving TSP Problem by Artificial Fish Swarm Algorithms with MATLAB)