Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.對此方面的研究很有幫助
資源簡介:Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.對此方面的研究很有幫助
上傳時間: 2014-01-12
上傳用戶:集美慧
資源簡介: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...
上傳時間: 2013-12-22
上傳用戶:ruixue198909
資源簡介: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)
上傳時間: 2013-12-04
上傳用戶:從此走出陰霾
資源簡介:采用蟻群算法檢測圖像邊緣 This a demo program of image edge detection using ant colony, based on the paper, "An Ant Colony Optimization Algorithm For Image Edge Detection," IEEE Congress on Evolutionary Computation (CEC), pp. 751-756, Hongk...
上傳時間: 2016-09-28
上傳用戶:cc1
資源簡介:have recently become very interested in the area of genetic Algorithms and Ant Colony Optimization techniques. I was determined to write a complete program demonstrating these two techniques. In particular I wanted to compare the efficiency...
上傳時間: 2013-12-21
上傳用戶:牛布牛
資源簡介:A program to demonstrate the Optimization process of ant colony Optimization for the Traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. ...
上傳時間: 2015-07-12
上傳用戶:偷心的海盜
資源簡介: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...
上傳時間: 2017-02-19
上傳用戶:comua
資源簡介:Using Genetic Algorithm to solve the 8 Queens problem.
上傳時間: 2014-11-28
上傳用戶:yd19890720
資源簡介: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
上傳時間: 2013-12-06
上傳用戶:nanfeicui
資源簡介:《An Introduction to Ant Colony Optimization》 作者:Marco Dorigo and Krzysztof Socha 時間:Technical Report No.TR/IRIDIA/2006-010April 2006 一份介紹蟻群系統(tǒng)的英文原版論文報告
上傳時間: 2013-12-12
上傳用戶:heart520beat
資源簡介:JAVA版的螞蟻算法(Ant Colony Optimization Algorithms)
上傳時間: 2014-10-25
上傳用戶:jqy_china
資源簡介: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...
上傳時間: 2014-01-24
上傳用戶:bjgaofei
資源簡介:蟻群算法(ant colony Optimization, ACO),又稱螞蟻算法,是一種用來在圖中尋找優(yōu)化路徑的機率型技術。它由Marco Dorigo于1992年在他的博士論文中引入,其靈感來源于螞蟻在尋找食物過程中發(fā)現路徑的行為
上傳時間: 2013-12-28
上傳用戶:xymbian
資源簡介:蟻群算法源(Ant colony Optimization ACO)代碼
上傳時間: 2014-01-12
上傳用戶:shus521
資源簡介:一個詳細的 系統(tǒng)的介紹了 ant colony Optimization 的ppt 對其中的原理做了比較詳細的分類介紹
上傳時間: 2013-12-19
上傳用戶:784533221
資源簡介:Ant colony Optimization for finding the global minimum
上傳時間: 2016-12-15
上傳用戶:guanliya
資源簡介:using NVIDIA FFT CUDA Library to solve FFT problem
上傳時間: 2014-01-24
上傳用戶:duoshen1989
資源簡介:《Ant Colony Optimization》Marco Dorigo寫的一本關于蟻群算法的書。包括AS、ACS、EAS、ASRank、MMAS的講解。很好的一本書。
上傳時間: 2017-04-22
上傳用戶:liansi
資源簡介:ant colony Optimization
上傳時間: 2013-12-21
上傳用戶:z754970244
資源簡介:ant colony Optimization 4
上傳時間: 2013-12-20
上傳用戶:cainaifa
資源簡介:ant colony Optimization 5
上傳時間: 2014-01-07
上傳用戶:qilin
資源簡介:Java source code for the Ant Colony Optimization Problem.
上傳時間: 2017-07-20
上傳用戶:xuanchangri
資源簡介:Algorithm bfs to solve knight tour problem
上傳時間: 2013-12-23
上傳用戶:qwe1234
資源簡介:Solve the Traveling Salesman problem with a genetic Algorithm.
上傳時間: 2013-12-19
上傳用戶:qunquan
資源簡介:this tar includes my code which employ the Lin-Kernighan Algorithm to address the tsp problem. this tar also include some testfiles and config file and a readme which describes how to run this program.
上傳時間: 2014-01-10
上傳用戶:stella2015
資源簡介: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 ...
上傳時間: 2016-02-06
上傳用戶:rocwangdp
資源簡介:Traveling Salesman Problem Java Genetic Algorithm Solution, Hope all enjoy it.
上傳時間: 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.
上傳時間: 2016-06-26
上傳用戶:sevenbestfei
資源簡介:This function implements brute force bactracking to solve the knapsack problem.
上傳時間: 2017-04-02
上傳用戶:stvnash
資源簡介:Genetic Algorithm (GA) based solver for the Traveling Salesman Problem
上傳時間: 2014-01-27
上傳用戶:siguazgb