搜索资源列表
tsp
- 75个城市坐标的优化问题-75 cities coordinates the optimization problem
GA-TSP
- 用育种算法求解售货商问题。设有10个城市，售货商从0号城市出发要把货物送到其他9个城市，且每个城市只能达到一次，最后回到0号城市-breeding algorithm used to solve the problem of goods sold. With 10 cities, sales from 0 to cities starting the goods should be sent to the other nine cities, and each city can only rea
货郎担分枝限界图形演示
- 货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem descr iption : A salesman to a number of cities to sell commodities, the known distance
TSP_G
- 利用凸包的原理,求解70个城市的旅行商问题.用Matlab实现-use of convex hull of principle, solving 70 cities in the TSP. Using Matlab
SGALAB1003beta3withdoc
- run the SGALAB_MO_VEGA_demo.m in command windows. to get beta3 version here: http://www.mathworks.com/matlabcentral/fileexchange/loadFile.do?objectId=5882 What s new: 1)fixed a critical bug in selection operation 2)update the 13 c
DrawCityLine
- 50个城市以内的TSP问题, 用遗传算法, 算子采用了pmx和ox算子。-50 cities within the TSP, genetic algorithm, the operator used pmx and ox operator.
visit
- 用贪心算法做的全国31个城市之间的旅行商问题源代码，可执行程序都在附件压缩包内。里面的data.txt city.txt分别为数据表和城市名，要和可执行程序放在同一个目录内才可执行-greedy algorithm to do with the country's 31 cities between the TSP source code, the executable in Annex compressed packet. Inside data.txt city.txt of dat
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
shorttest_path_program
- 有N个城市，编号为0、1…N-1，每个城市之间的路径长度保存在二位数组a中，如a[i][j]表示城市i与城市j的路径长度。求某个城市到其余城市的最短路径。-cities are N, No. 0,1 ... N-1, every city path length between the two kept in a group median, if a [i] [j] i said cities and urban j length of the path. For a city to the o
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
tsp_tsp
- 中国所有大中城市的TSP问题实现。图形演示。采用最近邻法则-all of China's large and medium-sized cities in the TSP to achieve. Presentation graphics. Neighbors recently adopted rules
JSPzzj
- 已知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 r
acopt
- A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker
graph11
- 城市之间的最短路径，用于求任意两个城市之间的最短路径-cities in the shortest path for the two cities arbitrary seeking the shortest path between
myyqtsp
- 用vc++实现的蚁群算法解决50个以内的城市的tsp问题。 -vc used to achieve the ant algorithm within the 50 cities tsp problems.
GATSP48
- 一个遗传算法的程序,实现了48个城市的TSP算法.用VC++环境下使用-a genetic algorithm procedures, the 48 cities in the TSP algorithm. VC environment with the use of
Data_ShorPath
- 数据结构课程的经典源码。以中国交通图为背景，求各大城市之间的最短路径。读文件操作。-data structure course of the classic source. China traffic map background, major cities seeking the shortest path between. Reading file manipulation.
SimulatedAnnealing(TSP)CSHARP
- 运用c＃语言实现模拟退火算法，同时利用该算法解决旅行商（TSP）问题，获得遍历所有城市序号的最优路径。-use c # language simulated annealing, while using the algorithm to solve traveling salesman (TSP). access to the serial numbers of all the cities traverse the optimal path.
iACSkroc100bingxingxiaochuangkoubianyi
- 这是在最初的蚁群算法的变异算子的基础上改进的变异算子，旅行商问题中含100个城市的程序-This is the first ant colony algorithm mutation operator on the basis of improving the mutation operator, Traveling Salesman Problem with 100 cities in the process
cities
- 简单小程序，点击设置城市，也可点击设置城市之间离，并求出两城市之间最小距离-Simple applet, click the Settings cities, between cities can be set to click away and find the minimum distance between two cities