搜索结果
找到约 26 项符合
Traveling 的查询结果
按分类筛选
其他 This simple simulation of a pulse traveling down a parallel-plate guide makes a handy test code for
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. Relea ...
数值算法/人工智能 A program to demonstrate the optimization process of ant colony optimization for the traveling salem
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 ...
人工智能/神经网络 this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up
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, s ...
matlab例程 traveling saleman problem的代码
traveling saleman problem的代码
数学计算 traveling saleman problem的一个C++算法
traveling saleman problem的一个C++算法
人工智能/神经网络 主要解决旅行商问题(traveling saleman problem,简称tsp
主要解决旅行商问题(traveling saleman problem,简称tsp,即已知n个城市之间的相互距离,现有一个推销员必须遍访这n个城市,并且每个城市只能访问一次,最后又必须返回出发城市,求解最短距离的遗传算法。
人工智能/神经网络 用于求解TSP(Traveling salesman problem
用于求解TSP(Traveling salesman problem,旅行商问题)问题,基本执行见run.bat, 其它详见其中的readme.txt。(实例为TSPLIB格式,见myprojects目录,包括eil51, d198, lin318等小型问题,以及1000到3000城市之间的例子,基本能得到最优解)
数值算法/人工智能 A Genetic Algorithms and the Traveling Salesman Problem
A Genetic Algorithms and the Traveling Salesman Problem
matlab例程 Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algo
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)
matlab例程 Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助
Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助