Description: prolog语言写的一个八皇后问题,程序比较简单,有注释-prolog language to write an eight-queen problem, the procedure is relatively simple, has the Notes Platform: |
Size: 1024 |
Author:张言国 |
Hits:
Description: The basic principle using the branchand-
bound strategy to solve the traveling
salesperson optimization problem (TSP)
consists of two parts.
There is a way to split the solution space.
There is a way to predict a lower bound for a
class of solutions.
There is also a way to find an upper bound of
an optimal solution.
If the lower bound of a solution exceeds this
upper bound, this solution cannot be optimal.
Thus, we should terminate the branching
associated with this solution.-The basic principle using the branchand-bound strategy to solve the travelingsalesperson optimization problem (TSP) consists of two parts . Platform: |
Size: 2048 |
Author:linru |
Hits:
Description: Traveling Salesperson Problem
Our branch-and-strategy splits a branch and bound solution into two groups:
one group including a particular arc and the other excluding this arc.
1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound.
2.If a constant subtracted from any row
or any column of the cost matrix, an
optimal solution does not change. Platform: |
Size: 135168 |
Author:黃文岩 |
Hits:
Description: 多旅行商问题(Multiple Traveling Salesperson Problem ,简称MTSP) 讨论的是如何安排m( > 1 ) 位旅行商访问n( >
m ) 座城市,要求每个城市只允许被访问一次时,求解所有旅行商花费的费用和是最小(或最大) 的问题。MTSP 问题其实与单
旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条
件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。现
为解决MTSP 问题给出了一种新的染色体设计和相关的处理方法,并与以往的理论设计和计算性能进行比较。计算测试显
示,新的方法能够获得较小的查找空间,在许多方面,新的方法产生的解空间更好。-Multi-Traveling Salesman Problem (Multiple Traveling Salesperson Problem, referred to as MTSP) discussed the arrangements for the m (> 1)-bit traveling salesman visits n (>
m) cities to require each city to allow only visited once, the solution of traveling salesman to spend all the costs and the smallest (or largest) problems. In fact, with the single issue of MTSP
TSP (Traveling Salesperson Problem, referred to as TSP) is similar to, but added any city as long as the visit by a traveling salesman to be attached to the
Pieces, thus increasing the complexity of the problem. The use of genetic algorithms in the past (GA) to study and solve the issue of MTSP, usually a standard chromosome and the TSP approach. Is
MTSP problem to solve is given a new design and associated chromosome approach and the theory of the previous design and to compare performance. Calculation of the test significantly
Show that the new method can find a smaller space, in many respects, the new met Platform: |
Size: 247808 |
Author:liqiubin |
Hits:
Description: MTSP 问题其实与单
旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条
件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。-M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup
cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2
mum. Th is is calledM ult ip le T raveling Salesmen P roblem (M TSP). There are various heurist ic
methods to obtain op t imal o r near2op t imal so lut ions fo r the TSP p roblem. But to the M ult ip le
T raveling Salesmen P roblem , there are no t much app roaches to so lveM TSP. In th is paper, a hy2
brid genet ic algo rithm to so lve TSP and M TSP is p resented. Th is algo rithm combines GA and
heurist ics. N umerical experiments show that the new algo rithm is very efficient and effect ive. Platform: |
Size: 217088 |
Author:liqiubin |
Hits:
Description: 旅行商问题的实现，用分支界限法实现旅行商问题-The realization of traveling salesman problem, and the Limits of Law branch of the realization of traveling salesman problem Platform: |
Size: 196608 |
Author:燃烧 |
Hits:
Description: Traveling salesperson problem with dynamic programming in c-Traveling salesperson problem with dynamic programming in c++ Platform: |
Size: 1024 |
Author:osg |
Hits:
Description: 该数据为TSP测试库数据，可用做TSP算法的测试，目前大多tsp测试都选用这个库里的数据为实例，它来自标准的TSPLIB95库。-TSP is a dataset directory which contains some examples of data for the traveleing salesperson problem.
Most of these examples come TSPLIB, a collection of traveling salesman problem datasets maintained by Gerhard Reinelt at http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/
Platform: |
Size: 5087232 |
Author:黄元君 |
Hits:
Description: Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed
The nearest neighbour (NN) algorithm (a greedy algorithm) lets the salesperson choose the nearest unvisited city as his next move. This algorithm quickly yields an effectively short route. For N cities randomly distributed on a plane, the algorithm on average yields a path 25 longer than the shortest possible path.[17] However, there exist many specially arranged city distributions which make the NN algorithm give the worst route (Gutin, Yeo, and Zverovich, 2002). This is true for both asymmetric and symmetric TSPs (Gutin and Yeo, 2007).-Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed
The nearest neighbour (NN) algorithm (a greedy algorithm) lets the salesperson choose the nearest unvisited city as his next move. This algorithm quickly yields an effectively short route. For N cities randomly distributed on a plane, the algorithm on average yields a path 25 longer than the shortest possible path.[17] However, there exist many specially arranged city distributions which make the NN algorithm give the worst route (Gutin, Yeo, and Zverovich, 2002). This is true for both asymmetric and symmetric TSPs (Gutin and Yeo, 2007). Platform: |
Size: 4096 |
Author:ahmed |
Hits:
Search - Traveling Salesperson Problem