搜索资源列表
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
TSP_G
- 利用凸包的原理,求解70个城市的旅行商问题.用Matlab实现-use of convex hull of principle, solving 70 cities in the TSP. Using Matlab
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
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
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
travelingsalemanproblem
- 主要解决旅行商问题(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 existi
travelsale
- 利用遗传算法解决旅行商问题，以五个城市为例，给出了程序的源码和具体说明。-using genetic algorithms to solve the traveling salesman problem, and to five cities as an example, the program source and specify.
main.rar
- 蚁群算法计算城市最短距离，matlab源代码,Ant colony algorithm is the shortest distance between cities,
path_choose
- 任意给出两城市，找出两城市间的最短路径。还可以限定载重量，在满足载重量要求条件下，找出最短路径-Arbitrary given the two cities, two cities to find the shortest path. Can also limit the load to meet load requirements, find the shortest path
ga-for-tsp
- 利用遗传算法解决50个城市tsp问题，适合初学者。-The use of genetic algorithm to solve the issue of 50 cities tsp, suitable for beginners.
HopfieldTsp
- 用MatLab，编写用Hopfield网络求 解TSP问题（旅行商问题）的程序(城市 数目≥5)-Using MatLab, prepared using Hopfield network to solve TSP problem (TSP) process (the number of cities with ≥ 5)
ACTSP
- 实现了蚁群算法求解TSP问题。注释详细 function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q) ------------------------------------------------------------------------- 主要符号说明 C n个城市的坐标，n×2的矩阵 NC_max最大迭代次数 m蚂蚁个数
MatlabFuzzyClusteringAnalysis
- 采用K- means 算法和FCM 算法实现对47 个城市竞争力的聚类分析-Using K-means algorithm and FCM algorithm to achieve the competitiveness of 47 cities in the cluster analysis
HopfieldTsp
- 人工神经网络的作业。用连续hopfield网络求解的10个城市的旅行商最优路径问题-Artificial neural network operation. With continuous hopfield network of 10 cities to solve the optimal traveling salesman path problem
Babylon
- 本书将读者带入6000年前的巴比伦，他是当时世界上最富裕而繁华的城市，每个巴比伦人都了解金钱的价值，并懂得如何让自己变得富有-Book reader into the Babylon 6,000 years ago, he was the world' s most affluent and prosperous cities, each Babylonians understand the value of money, and know how to make themselves r
TSP
- 利用遗传算法求解旅行商问题 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm traveling salesman problem, namely, th
Rayleigh_PDF
- this the most common type of fading model observing in urban cities-this is the most common type of fading model observing in urban cities
TSP_based_on_Ant_Colony_Optimization
- 蚁群优化求解TSP问题，20座城市。源自老师，非本人所写。-Ant colony optimization to solve the problem TSP, 20 cities. From teachers, non-written by himself.
matlab
- 用经典算法解决旅行商问题，得出城市间的最短路径，此为经典算法。-With the classical algorithm to solve traveling salesman problem, obtained the shortest path between cities, this is the classical algorithm.
simAnealing
- Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used whe