搜索资源列表
tuihuosuanfa
- 在Visual C++ 编译环境下，模拟退火算法程序，并利用它们求解了48个城市的TSP问题。-in Visual C compiler environment, simulated annealing procedures, and use them for the 48 cities in the TSP.
Ant_CS
- 蚂蚁算法的VB优化程序，里面有城市数据。直观好用-Ant algorithm to optimize the VB program, there are cities in the data. Intuitive use
football
- Descr iption 2008六月激动人心的欧洲杯就要开始了，来直世界各地的人们都会涌向主办国瑞士和奥地利。由于比赛是在不同的城市进行，为了使球迷们能够尽快的到达各个城市，主办方决定在城市之间修建铁路来满足需要，铁路线当然越短越好喽。现在你的任务是帮助主办方选择最优的修建方案。 Input 输入的第一行是一个数n(2 <= n <= 50 )，表示城市的数目。 后面是一个n * n的矩阵A，A[i][j]表示第i个城市和第j个城市的路径(0 <= A[
lvxingshangwenti
- 旅行商问题，即TSP问题（Traveling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 TSP问题是一个组合优化问题。该问题可以被证明具有NPC计算复杂性。因此，任何能使该问题的求解得以简化的方法，都将受到高度的评价和关注。 -Traveling salesman problem, the T
lvxingshangwenti
- 设有n+1个城市，分别用0,1,...,n表示。从从城市i到城市j的距离为d[i][j]。一个 推销员要从城市0出发，到达其他任意一城市一次且仅一次，然后再回到城市0。问题是 他如何选择行走路线，使总路程最短-With n+1 cities, respectively 0,1 ,..., n, said. From from city i to city j, the distance d [i] [j]. A salesman from the city 0 departure, ar
AntTsp
- 蚁群算法求解TSP问题，只需添加设置城市数就可以-Ant colony algorithm for solving TSP, simply add a set number of cities
MainFrm
- 利用模拟退火法计算求取两座城市之间距离的最小值。-The simulated annealing method to obtain the minimum distance between two cities.
zhanghua
- 主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。-。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n between the distance from the exis
2618-anqn
- 一个VC++算法实例，求两个城市间的最短距离，对算法的学习有帮助。-An instance of VC++ algorithm, seeking the shortest distance between two cities, there is help on the learning algorithm.
SimulatedAnnealing.RAR
- 在Visual C++ 编译环境下，模拟退火算法程序，并利用它们求解了48个城市的TSP问题-In Visual C++ compiler environment, the simulated annealing process, and use them to solve a 48 cities TSP problem
SATsp_VC
- 本程序已知50个城市坐标，可计算经过50个城市一次的最短路径，为经典的TSP问题，非常实用-This procedure is known coordinates of 50 cities, 50 cities through a calculated shortest path for the classic TSP, very useful
ANT.CPP
- C++ Implementation of Ant Colony Optimization Program.This uses a Cost matrix to Calculate the Shortest path from a number of Cities.
TSP_TS
- Solution for Travelling Salesman Problem by using Tabu Search heuristics. Archive contains sources and some data to test the appllication. As an input, we take the coordinates of cities (x,y) and then transform them into distances matrix. All co
TSP_SA
- Solution for Travelling Salesman Problem using the simulated annealing heuristic. As an input, we take coordinates of cities (x,y) and then transform them into distances matrix (we assume, the distance between x and y is the same as between y and
SPF
- Dijkstra s algorithm, named after its discoverer, Dutch computer scientist Edsger Dijkstra, is a greedy algorithm that solves the single-source shortest path problem for a directed graph with non negative edge weights. For example, if the vertices (n
MinTranport
- 求解最佳交通路线。程序内置部分城市间距离，用户选择其实低于目的地，计算最有路线。-Solving the optimal transport routes. The program built-in some cities, the distance between the user options are actually lower than the destination, calculate the most routes.
AI
- 2个人工智能程序，可视化界面：A*算法解决货郞担问题（支持13个城市）。还有动物识别专家系统-Two artificial intelligence program, visual interface: A* algorithm to solve the problem of cargo Lang Tam (supports 13 cities). There are animal identification expert system
tsp
- A traveling salesman has to travel through a bunch of cities, in such a way that the expenses on traveling are minimized. This is the infamous Traveling Salesman Problem (aka TSP)
bouble-tower
- 背景 从前，有一个古老的帝国有两个形状不同的塔分别在不同的两个城市里。这两个塔是用圆形的砖一块一块建成的。这些圆形砖的高度是一样的，其半径都是整数。很明显，尽管这两个塔形状不同，但造塔所使用的圆形砖却有很多是相同的。 过了很多年，一个国王命令他的建筑师们移除两个塔的部分砖以便使它们的形状完全一样，同时使两个塔的高度尽可能的高，并且新塔的砖瓦的排列顺序必须与原来的一样。国王认为这样的两个塔象征着这两个城市之间的和谐和平等，于是命名它们为双胞胎塔。 任务 现在，两千年以
TSP-program
- Genetic algorithms to solve 10 cities TSP program-Genetic algorithms to solve 10 cities TSP program source code