搜索资源列表
TSP(TravelingSalesmanProblem)
- Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and th
1234
- 2010最新的用分枝界限法解决最大多样性问题的SCI论文。-This article begins with a review of previously proposed integer formulations for the maximum diversity problem (MDP). This problem consists of selecting a subset of elements from a larger set in such a way that the
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
TSP_GA_10Cities_New
- 遗传算法解10个城市的背包问题，独立新开发源码（nxn matrix for city distances）- The Traveling Salesman Problem: A Case Study in Optimization via Genetic Algorithms (nxn matrix for city distances)
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
tsp-matlab
- The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and retu
Numerical Electromagnetic Code in C
- NEC2c is a translation of the Numerical Electromagnetics Code (NEC2) from FORTRAN to C. It uses three terms (sine, cosine and constant) to represent the current functions and apply method of moments to solve the 3-D antenna problems. NEC2c provides b
SIMULATED-ANNEALING-
- 这是一个关于商人visit许多城市，怎样走法才能使距离最短的例子，采样的了退火算法的经典案例-Traveling Salesman Problem (TSP) has been an interesting problem for a l me in classical optimization techniques which are based on linear and nonlin ogramming. TSP can be described as follows: Given
Travelling-salesman-problem-algorithm
- The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an N
From-the-string
- 问题描述： 设有字符串X，我们称在X的头尾及中间插入任意多个空格后构成的新字符串为X的扩展串，如字符串X为“abcbcd”，则字符串“abcb□cd”，“□a□bcbcd□”和“abcb□cd□”都是X的扩展串，这里“□”代表空格字符。 如果A1是字符串A的扩展串，B1是字符串B的扩展串，A1与B1具有相同的长度，那么我们定义字符串A1与B1的距离为相应位置上的字符的距离总和，而两个非空格字符的距离定义为它们的ASCII码的差的绝对值，而空格字符与其它任意字符之间的距离为已知的定值K
58848
- MATLAB code: Topic is the optimization of municipal domestic waste collection and transportation routes, the problem is: there are number of different load of garbage trucks set out the station experienced 32 garbage collection garbage and then ret
56628
- Topic is the optimization of municipal domestic waste collection and transportation routes, the problem is: there are number of different load of garbage trucks set out the station experienced 32 garbage collection garbage and then returned to the st
ellipseDetection
- The code is reasonably fast due to (optional) randomization and full code vectorization. However, as the algorithm needs to compute pairwise point distances, it can be quite memory intensive. If you get out of memory errors, either downsample the inp
traveller-problem
- The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an N
traveller-problem-1-
- The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an N
TSP
- 旅行商问题，用的是动态规划算法，需要自己输入结点和弧长，例如A B 3，表示A B 之间的弧长距离为3-Traveling salesman problem, using a dynamic programming algorithm, you need to enter your node and arc length, for example, AB 3, showing the arc between three distances AB
Thaiproxi
- This article details a novel numerical scheme to approximate gradient flows for optimal transport metrics. These flows have proved useful to tackle theoretically and numerically(load induced by the resolution of each step Indeed this corresponds to