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.
標(biāo)簽： interesting traveling classical Salesman
上傳時間： 2016-02-06
上傳用戶：rocwangdp
遺傳算法和“貨郎擔(dān)” 問題: "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."
標(biāo)簽： traveling salesman problem finite
上傳時間： 2013-12-24
上傳用戶：watch100
traveling Salesman Problem Java Genetic Algorithm Solution, Hope all enjoy it.
標(biāo)簽： traveling Algorithm Salesman Solution
上傳時間： 2013-12-20
上傳用戶：sz_hjbf
TSP( traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect method for solving NP complete problem.
標(biāo)簽： 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.
標(biāo)簽： salesperson principle branchand the
上傳時間： 2017-02-19
上傳用戶：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.
標(biāo)簽： branch-and-strategy Salesperson traveling solution
上傳時間： 2013-12-29
上傳用戶：璇珠官人
Genetic Algorithm (GA) based solver for the traveling Salesman Problem
標(biāo)簽： Algorithm traveling Salesman Genetic
上傳時間： 2014-01-27
上傳用戶：siguazgb
a program about traveling Salesman Problem (TSP) Genetic Algorithm
標(biāo)簽： traveling Algorithm Salesman program
上傳時間： 2013-12-04
上傳用戶：xinzhch
多旅行商問題(Multiple traveling Salesperson Problem ,簡稱MTSP) 討論的是如何安排m( > 1 ) 位旅行商訪問n( > m ) 座城市,要求每個城市只允許被訪問一次時,求解所有旅行商花費(fèi)的費(fèi)用和是最小(或最大) 的問題。MTSP 問題其實(shí)與單 旅行商問題(traveling Salesperson Problem ,簡稱TSP) 相似,但是由于添加了任何城市只要被某一旅行商訪問到即可這個附加條 件,因而增加了問題復(fù)雜度。在以前使用遺傳算法(GA) 研究解決MTSP 問題時,通常采用標(biāo)準(zhǔn)的TSP 染色體和處理方法?，F(xiàn) 為解決MTSP 問題給出了一種新的染色體設(shè)計和相關(guān)的處理方法,并與以往的理論設(shè)計和計算性能進(jìn)行比較。計算測試顯 示,新的方法能夠獲得較小的查找空間,在許多方面,新的方法產(chǎn)生的解空間更好。
標(biāo)簽： Salesperson traveling Multiple Problem
上傳時間： 2013-12-17
上傳用戶：蟲蟲蟲蟲蟲蟲
MTSP 問題其實(shí)與單 旅行商問題(traveling Salesperson Problem ,簡稱TSP) 相似,但是由于添加了任何城市只要被某一旅行商訪問到即可這個附加條 件,因而增加了問題復(fù)雜度。在以前使用遺傳算法(GA) 研究解決MTSP 問題時,通常采用標(biāo)準(zhǔn)的TSP 染色體和處理方法。
標(biāo)簽： Salesperson traveling Problem MTSP
上傳時間： 2013-12-24
上傳用戶：731140412
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
