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.
标签: interesting traveling classical Salesman
上传时间: 2016-02-06
上传用户:rocwangdp
遗传算法和“货郎担” 问题: "The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point."
标签: traveling salesman problem finite
上传时间: 2013-12-24
上传用户:watch100
traveling Salesman Problem Java Genetic Algorithm Solution, Hope all enjoy it.
标签: traveling Algorithm Salesman Solution
上传时间: 2013-12-19
上传用户:sz_hjbf
TSP( traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect method for solving NP complete problem.
标签: traveling algorithm Salesman complete
上传时间: 2016-06-26
上传用户:sevenbestfei
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.
标签: salesperson principle branchand the
上传时间: 2017-02-18
上传用户:comua
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.
标签: branch-and-strategy Salesperson traveling solution
上传时间: 2013-12-29
上传用户:璇珠官人
Genetic Algorithm (GA) based solver for the traveling Salesman Problem
标签: Algorithm traveling Salesman Genetic
上传时间: 2014-01-27
上传用户:siguazgb
a program about traveling Salesman Problem (TSP) Genetic Algorithm
标签: traveling Algorithm Salesman program
上传时间: 2013-12-03
上传用户:xinzhch
多旅行商问题(Multiple traveling Salesperson Problem ,简称MTSP) 讨论的是如何安排m( > 1 ) 位旅行商访问n( > m ) 座城市,要求每个城市只允许被访问一次时,求解所有旅行商花费的费用和是最小(或最大) 的问题。MTSP 问题其实与单 旅行商问题(traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条 件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。现 为解决MTSP 问题给出了一种新的染色体设计和相关的处理方法,并与以往的理论设计和计算性能进行比较。计算测试显 示,新的方法能够获得较小的查找空间,在许多方面,新的方法产生的解空间更好。
标签: Salesperson traveling Multiple Problem
上传时间: 2013-12-16
上传用户:虫虫虫虫虫虫
MTSP 问题其实与单 旅行商问题(traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条 件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。
标签: Salesperson traveling Problem MTSP
上传时间: 2013-12-24
上传用户:731140412