This simple simulation of a pulse Traveling down a parallel-plate guide makes a handy test code for initial experiments with boundary conditions. ToyFDTD3 adds some simple features to ToyFDTD1: A PMC boundary condition, a sinusoidal pulse source, and output tracking a single point in the mesh. Released 15 June 1999.
標(biāo)簽： parallel-plate simulation Traveling simple
上傳時(shí)間： 2015-04-06
上傳用戶：stella2015
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. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
標(biāo)簽： optimization demonstrate the Traveling
上傳時(shí)間： 2015-07-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 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
Traveling saleman problem的代碼
標(biāo)簽： Traveling saleman problem 代碼
上傳時(shí)間： 2014-01-03
上傳用戶：yph853211
Traveling saleman problem的一個(gè)Ｃ＋＋算法
標(biāo)簽： Traveling saleman problem 算法
上傳時(shí)間： 2015-10-08
上傳用戶：水口鴻勝電器
主要解決旅行商問(wèn)題(Traveling saleman problem,簡(jiǎn)稱tsp，即已知n個(gè)城市之間的相互距離，現(xiàn)有一個(gè)推銷員必須遍訪這n個(gè)城市，并且每個(gè)城市只能訪問(wèn)一次，最后又必須返回出發(fā)城市，求解最短距離的遺傳算法。
標(biāo)簽： Traveling saleman problem tsp
上傳時(shí)間： 2015-10-09
上傳用戶：cylnpy
用于求解TSP(Traveling salesman problem，旅行商問(wèn)題)問(wèn)題，基本執(zhí)行見(jiàn)run.bat, 其它詳見(jiàn)其中的readme.txt。（實(shí)例為TSPLIB格式，見(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
上傳用戶：集美慧
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
