This program is using Genetic Algorithm to solve the Travlling salesman Problem. It gives the best path route within a specified time. usage: java Evolver <seconds> <city file> <config file> Author: Liu Yang
標(biāo)簽： Algorithm Travlling the salesman
上傳時(shí)間： 2013-12-06
上傳用戶：nanfeicui
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 error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
標(biāo)簽： Traveling salesman solution Problem
上傳時(shí)間： 2013-12-22
上傳用戶：ruixue198909
用于求解TSP(Traveling salesman problem，旅行商問(wèn)題)問(wèn)題，基本執(zhí)行見(jiàn)run.bat, 其它詳見(jiàn)其中的readme.txt。（實(shí)例為T(mén)SPLIB格式，見(jiàn)myprojects目錄，包括eil51, d198, lin318等小型問(wèn)題，以及1000到3000城市之間的例子，基本能得到最優(yōu)解）
標(biāo)簽： Traveling salesman problem TSP
上傳時(shí)間： 2015-10-16
上傳用戶：myworkpost
A Genetic Algorithms and the Traveling salesman Problem
標(biāo)簽： Algorithms Traveling salesman Genetic
上傳時(shí)間： 2015-11-27
上傳用戶：cccole0605
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)
標(biāo)簽： Traveling salesman solution Problem
上傳時(shí)間： 2013-12-04
上傳用戶：從此走出陰霾
Using Ant Colony Optimization Algorithm to solve Traveling salesman Problem.對(duì)此方面的研究很有幫助
標(biāo)簽： Optimization Algorithm Traveling salesman
上傳時(shí)間： 2014-01-12
上傳用戶：集美慧
這是一個(gè)用遺傳算法來(lái)求解旅行商問(wèn)題（TSP問(wèn)題：Travelling salesman Problem）的源代碼，學(xué)習(xí)遺傳算法，演化計(jì)算的很值得一看！
標(biāo)簽： Travelling salesman Problem TSP
上傳時(shí)間： 2016-02-05
上傳用戶：hj_18
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
上傳時(shí)間： 2016-02-06
上傳用戶：rocwangdp
遺傳算法和“貨郎擔(dān)” 問(wè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
上傳時(shí)間： 2013-12-24
上傳用戶：watch100
Traveling salesman Problem Java Genetic Algorithm Solution, Hope all enjoy it.
標(biāo)簽： Traveling Algorithm salesman Solution
上傳時(shí)間： 2013-12-20
上傳用戶：sz_hjbf
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
