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.
資源簡介：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 traver...
上傳時(shí)間： 2013-12-29
上傳用戶：璇珠官人
資源簡介： 多旅行商問題(Multiple Traveling Salesperson Problem ,簡稱MTSP) 討論的是如何安排m( > 1 ) 位旅行商訪問n( > m ) 座城市,要求每個(gè)城市只允許被訪問一次時(shí),求解所有旅行商花費(fèi)的費(fèi)用和是最小(或最大) 的問題。MTSP 問題其實(shí)與單 旅行商問題(Traveling S...
上傳時(shí)間： 2013-12-17
上傳用戶：蟲蟲蟲蟲蟲蟲
資源簡介：MTSP 問題其實(shí)與單 旅行商問題(Traveling Salesperson Problem ,簡稱TSP) 相似,但是由于添加了任何城市只要被某一旅行商訪問到即可這個(gè)附加條 件,因而增加了問題復(fù)雜度。在以前使用遺傳算法(GA) 研究解決MTSP 問題時(shí),通常采用標(biāo)準(zhǔn)的TSP 染色體和處理方法。
上傳時(shí)間： 2013-12-24
上傳用戶：731140412
資源簡介：翻譯的Soft core processors and embedded processing: a survey and analysis論文，可供大家參考，
上傳時(shí)間： 2014-01-10
上傳用戶：a6697238
資源簡介：Java code where user can enter the height and base of a triangle and the program will calculate the area and perimeter if it is a right triangle
上傳時(shí)間： 2013-12-06
上傳用戶：yzhl1988
資源簡介：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 lo...
上傳時(shí)間： 2017-02-19
上傳用戶：comua
資源簡介：A Genetic Algorithms and the Traveling Salesman Problem
上傳時(shí)間： 2015-11-27
上傳用戶：cccole0605
資源簡介：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 ...
上傳時(shí)間： 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 ...
上傳時(shí)間： 2013-12-24
上傳用戶：watch100
資源簡介：fastDNAml is an attempt to solve the same problem as DNAML, but to do so faster and using less memory, so that larger trees and/or more bootstrap replicates become tractable. Much of fastDNAml is merely a recoding of the PHYLIP 3.3 DNAML...
上傳時(shí)間： 2014-01-24
上傳用戶：bjgaofei
資源簡介：this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input erro...
上傳時(shí)間： 2013-12-22
上傳用戶：ruixue198909
資源簡介：Traveling saleman problem的代碼
上傳時(shí)間： 2014-01-03
上傳用戶：yph853211
資源簡介：Traveling saleman problem的一個(gè)Ｃ＋＋算法
上傳時(shí)間： 2015-10-08
上傳用戶：水口鴻勝電器
資源簡介：主要解決旅行商問題(Traveling saleman problem,簡稱tsp，即已知n個(gè)城市之間的相互距離，現(xiàn)有一個(gè)推銷員必須遍訪這n個(gè)城市，并且每個(gè)城市只能訪問一次，最后又必須返回出發(fā)城市，求解最短距離的遺傳算法。
上傳時(shí)間： 2015-10-09
上傳用戶：cylnpy
資源簡介：用于求解TSP(Traveling salesman problem，旅行商問題)問題，基本執(zhí)行見run.bat, 其它詳見其中的readme.txt。（實(shí)例為TSPLIB格式，見myprojects目錄，包括eil51, d198, lin318等小型問題，以及1000到3000城市之間的例子，基本能得到最優(yōu)解）
上傳時(shí)間： 2015-10-16
上傳用戶：myworkpost
資源簡介：Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
上傳時(shí)間： 2013-12-04
上傳用戶：從此走出陰霾
資源簡介：Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.對此方面的研究很有幫助
上傳時(shí)間： 2014-01-12
上傳用戶：集美慧
資源簡介：Forest quanity remote sensing reesearch, it is a useful and important paper and helpful to our research.
上傳時(shí)間： 2013-12-18
上傳用戶：change0329
資源簡介：Traveling Salesman Problem Java Genetic Algorithm solution, Hope all enjoy it.
上傳時(shí)間： 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.
上傳時(shí)間： 2016-06-26
上傳用戶：sevenbestfei
資源簡介：Genetic Algorithm (GA) based solver for the Traveling Salesman Problem
上傳時(shí)間： 2014-01-27
上傳用戶：siguazgb
資源簡介：A branch-and-bound algorithm for asymmetric TSP
上傳時(shí)間： 2014-01-27
上傳用戶：zmy123
資源簡介：a program about Traveling Salesman Problem (TSP) Genetic Algorithm
上傳時(shí)間： 2013-12-04
上傳用戶：xinzhch
資源簡介：Solve the Traveling salesman problem with a genetic algorithm.
上傳時(shí)間： 2013-12-19
上傳用戶：qunquan
資源簡介：This paper deals with the problem of speech enhancement when only a corrupted speech signal is available for processing. Kalman filtering is known as an effective speech enhancement technique, in which speech signal is usually modeled as...
上傳時(shí)間： 2013-12-20
上傳用戶：569342831
資源簡介：中南賽區(qū)ACM競賽題 Description Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all th...
上傳時(shí)間： 2013-12-22
上傳用戶：lijianyu172
資源簡介：The Linux Programming Interface - A Linux and UNIX System
上傳時(shí)間： 2013-11-10
上傳用戶：asdstation
資源簡介：Grammatica is a C# and Java parser generator (compiler compiler). It improves upon simlar tools (like yacc and ANTLR) by creating well-commented and readable source code, by having automatic error recovery and detailed error messages, and b...
上傳時(shí)間： 2015-01-11
上傳用戶：stella2015
資源簡介：OpenVPN is a robust and highly flexible tunneling application that uses all of the encryption, authentication, and certification features of the OpenSSL library to securely tunnel IP networks over a single TCP/UDP port.
上傳時(shí)間： 2014-01-13
上傳用戶：hzy5825468
資源簡介：A Simple isochronous transfer. Reads 8051 ports A,B and C, and continuously sends a five byte packet over EP8IN:
上傳時(shí)間： 2015-02-01
上傳用戶：ywqaxiwang
