Description: 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 their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases. Platform: |
Size: 446727 |
Author:yangdi |
Hits:
Description: 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 their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases. Platform: |
Size: 446464 |
Author:yangdi |
Hits:
Description: 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 sum of the distances between the chosen elements is maximized. We propose a branch and
bound algorithm and develop several upper bounds on the objective function values of partial solutions
to the MDP. Empirical results with a collection of previously reported instances indicate that the pro-
posed algorithm is able to solve all the medium-sized instances (with 50 elements) as well as some
large-sized instances (with 100 elements). We compare our method with the best previous linear integer
formulation solved with the well-known software Cplex. The comparison favors the proposed procedure. Platform: |
Size: 592896 |
Author:李利波 |
Hits:
Description: 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 computations are performed on that matrix.
The output is the shortest found path between all the cities.-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 computations are performed on that matrix.
The output is the shortest found path between all the cities. Platform: |
Size: 87040 |
Author:Fenomen |
Hits:
Description: 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 x). All the computations then are performed on such matrix.
The output is the shortest path between all cities, the algorithm was capable to find.-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 x). All the computations then are performed on such matrix.
The output is the shortest path between all cities, the algorithm was capable to find. Platform: |
Size: 111616 |
Author:Fenomen |
Hits:
Description: 遗传算法解10个城市的背包问题，独立新开发源码（nxn matrix for city distances）- The Traveling Salesman Problem: A Case Study in Optimization via Genetic Algorithms (nxn matrix for city distances) Platform: |
Size: 2048 |
Author:Weige |
Hits:
Description: 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 (nodes) of the graph represent cities and edge weights represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between two cities. Also, this algorithm can be used for shortest path to destination in traffic network. Platform: |
Size: 9216 |
Author:williamsu82 |
Hits:
Description: 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 returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. Platform: |
Size: 25600 |
Author:asqw |
Hits:
Description: 这是一个关于商人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 a numberof cities to v
d their distances from all other cities know, an optimal travel route has to
und so that each city is visited one and only once with the least possible dista
aveled. This is a simple problem with handful of cities but becomes complica
the number increases. Platform: |
Size: 501760 |
Author:罗佳婷 |
Hits:
Description: 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 NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. Platform: |
Size: 2048 |
Author:ramin |
Hits:
Description: 问题描述：
设有字符串X，我们称在X的头尾及中间插入任意多个空格后构成的新字符串为X的扩展串，如字符串X为“abcbcd”，则字符串“abcb□cd”，“□a□bcbcd□”和“abcb□cd□”都是X的扩展串，这里“□”代表空格字符。 如果A1是字符串A的扩展串，B1是字符串B的扩展串，A1与B1具有相同的长度，那么我们定义字符串A1与B1的距离为相应位置上的字符的距离总和，而两个非空格字符的距离定义为它们的ASCII码的差的绝对值，而空格字符与其它任意字符之间的距离为已知的定值K，空格字符与空格字符的距离为O。在字符串A、B的所有扩展串中，必定存在两个等长的扩展串A1、B1，使得A1与B1之间的距离达到最小，我们将这一距离定义为字符串A、B的距离。 请你写一个程序，求出字符串A、B的距离。
输入：
有多组数据,每一组数据第一行为字符串A，第二行为字符串B，A、B均由小写字母组成且长度均不超过2000，第三行为一个整数K，1≤K≤100，表示空格与其它字符的距离。
输出：
每组数据一行包含一个整数，表示要求的字符串A、B的距离。-Problem Description :
With a string of X, we call the new string is inserted after any number of spaces in the middle of the head and tail and composed for the X X extension string , such as string X is "abcbcd", the string "abcb □ cd", "□ a □ bcbcd □" and "abcb □ cd □" are X extensions string here "□" on behalf of a space character. If A1 is the extended string string A , B1 B is an extension of substrings , A1 and B1 have the same length , then we define a string from the sum of the distances A1 and B1 on the corresponding character position , and the two from the definition of non- space character is absolute difference of their ASCII codes, and the distance to any other character with a space character between a known K, from the space character and the space character value is O. String A, B in all the extended string , and so there must be two extended string length A1, B1, so that the distance between A1 and B1 to a minimum , this distance will be defined as a string A, the Platform: |
Size: 1024 |
Author:qiang22 |
Hits:
Description: We consider the problem of recovering an underwater image distorted by surface waves. A large amount of video data of the distorted image is acquired. The problem is posed in terms of finding an undistorted im- age patch at each spatial location. This challenging reconstruction task can be formulated as a manifold learning problem, such that the center of the manifold is the image of the undistorted patch. To compute the center, we present a new technique to estimate global distances on the manifold. Our technique achieves robustness through convex flow com- putations and solves the “leakage” problem inherent in recent manifold embedding techniques.
Platform: |
Size: 546816 |
Author:asdf12341234 |
Hits:
Description: 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 returned to the station. Waste matrix of distances between poin-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 returned to the station. Waste matrix of distances between poin... Platform: |
Size: 289792 |
Author:vanishri |
Hits:
Description: 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 station. Waste matrix of distances between poin-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 station. Waste matrix of distances between poin... Platform: |
Size: 393216 |
Author:vanishri |
Hits:
Description: 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 input image or somehow decrease the number of non-zero points in it. It can deal with big amount of noise but can have severe problem with occlusions (major axis end points need to be visible) Platform: |
Size: 21504 |
Author:Vu Phan |
Hits:
Description: 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 NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
Platform: |
Size: 6144 |
Author:coucou911 |
Hits:
Description: 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 NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. Platform: |
Size: 6144 |
Author:coucou911 |
Hits:
Description: 旅行商问题，用的是动态规划算法，需要自己输入结点和弧长，例如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 Platform: |
Size: 2048 |
Author:刘丽 |
Hits:
Description: 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 the resolution of a convex optimization problem involving a Wasserstein distance to the previous iterate Following several recent works on the approximation of Wasserstein distances) Platform: |
Size: 1435648 |
Author:133549 |
Hits:
Search - problem distances