搜索资源列表
TSP_SA
- 基于模拟退火算法求解31个城市的TSP问题。通过模拟自然退火的过程,来实现全局的最优化。根据metropolis准则,接受新解。-Based on simulated annealing algorithm 31 cities TSP. By simulating the natural process of annealing to achieve global optimization. According metropolis criteria, accept the new soluti
ant-algorithms-of-vrp
- 采用蚁群算法能够解决31个城市的旅行商问题,相对于遗传算法,模拟退火算法和其他的算法,蚁群算法有其自身的优势-Ant colony algorithm to solve the traveling salesman problem 31 cities, with respect to genetic algorithms, simulated annealing algorithm and other algorithms, ant colony algorithm has its own ad
abc
- 模拟退火算法解决TSP问题 输入格式(城市坐标.in): 第行:1个整数N,表示城市的数量 第..N+1行:每行有个空格分开的整数x,y,第i+1行的x,y表示城市i的坐标-Simulated annealing algorithm to solve TSP Input Format (city coordinates in.): The first line: an integer N, the number of cities S .. N+1 lines: eac
SA_Tsp
- 模拟退火旅行商问题用C#语言编写的,有界面计算城市之间旅行最短行程问题-Simulated annealing traveling salesman problem written in C# language, the interface to calculate the shortest path problem traveling between cities
simulated-annealing-method.
- 多城市最短路径寻优问题,基于模拟退火方法~-Many city the shortest path optimization problem, based on the simulated annealing method.
monituihuo
- 可以实现模拟退火 计算TSP问题 代码中给的是30个城市的坐标 可以自己进行代换-Simulated annealing can calculate the TSP
city-develop
- matlab 城市发展模拟,地理系统建模的小程序-matlab city develop
Simulated-Annealing
- 模拟退火的matlab实现程序,含原始的输入数据,即各个城市的具体坐标。-Simulated annealing to achieve the matlab program, including the original input data, namely the specific coordinates of each city.
SA
- 用matalab模拟退火算法解决 10 个城市的 TSP 问题,程序详细、实用,很适合初学者。-Using simulated annealing algorithm to solve matalab 10 cities TSP problem, the program detailed, practical, very suitable for beginners.
TSP
- TSP问题的模拟退火法求解,能够反推相关城市之间最优函数的求解-TSP
Annealing-algorithm
- 使用模拟退火选择路径问题,例如一个旅行商问题,给定N个城市,有一个推销员必须遍访这N个城市,而且每个城市只能访问一次最后回到出发的那个城市,要求安排合理的访问顺序,以实现访问路线最短的目标。-Select the path using the simulated annealing problems, such as a traveling salesman problem, given N cities, a salesman must have visited this N cities,
SA
- 针对于多个城市的最短距离问题或旅行商问题,模拟退火算法,C#程序-For the shortest distance problem or traveling salesman problem in many cities, simulated annealing algorithm, C# program
setup_demo_tcm53-423389
- CLUE-S模型,利用于城市土地利用变化的模拟研究,有利于对土地利用的研究,避免在城市化发展过程中出现不可恢复的问题--CLUE-S model, the use of simulation studies on urban land use change, help the study of land use, to avoid the process of urbanization in unrecoverable problem
myABM_v1
- ABM模型,可以帮助土地管理研究,对于土地或城市土地增长来说,得用ABM模型可以很好的模拟出它们的变化-ABM model, can help the land management research, for land or urban land growth, with ABM model can well simulate the change of the them
simulated-annealing(SA)
- 模拟退火方法解决TSP问题,代码用MATLAB实现,可直接运行,可自行修改初始城市数据-Simulated annealing algorithm to solve TSP problem, the code using MATLAB to achieve, can be run directly, you can modify the initial data on their own city
GA100
- 利用模拟退火发求解TSP问题。Location.dat存储了每个城市的坐标-Simulating Anealing Method for TSP
SAA-TSP
- 模拟退火算法解决旅行商问题,城市数量27,初始温度3000,温度衰减率0.95。 -Simulated annealing algorithm to solve the traveling salesman problem, 27 the number of cities, the initial temperature of 3000, the rate of temperature decay 0.95.
City
- 使用著名的模拟退火算法来求解城市旅行商问题-Use well-known ant colony algorithm to solve the traveling salesman problem
TSP
- 利用模拟退火算法求解旅行商问题,从文件读入城市信息,输出结果到文件-TSP problem
RenRen_ad
- 1.通过三种动画仿照出人人引导页的放大切换图片的效果。 2.通过重写ViewGroup仿照出人人菜单和其他界面的手势滑动切换效果。 3.通过百度地图定位及获取周边。 4.通过重写ImageView和Gallery制作相册。 5.通过afinal来下载缓存显示图片。 6.数据大部分采用人人API的数据获取,其中有些界面为了效果,而人人API没有提供相对应的接口,所以采取了一些的模拟数据来达到界面的效果,其中包括附近优惠,采用的是糯米网的数据,数据为本人所在城市青岛的优惠信息,为