Search - shortest path tsp

Search - shortest path tsp - List

[AI-NN-PR] TravelingSalesmanProblemwithGeneticAlgorithm DL : 0: 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 -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 included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter, value
Date : 2025-12-29 Size : 4kb User : 宏姬
[AI-NN-PR] javaACS DL : 0: javaACS 蚁群算法是人工智能的一种算法,这个是用JAVA写的一个求解TSP的程序-javaACS ant algorithm is an artificial intelligence algorithm, This is written in JAVA using a procedure for TSP
Date : 2025-12-29 Size : 20kb User : 刘星
[AI-NN-PR] sa-tsp DL : 0: 模拟退火在最短路径求解问题上的实际应用！-simulated annealing for the shortest path problem on the practical application!
Date : 2025-12-29 Size : 39kb User : 徐徐
[AI-NN-PR] Double_ACO_TSP DL : 0: 此程序包是用双种群蚁群算法来求中国75个城市的最短路径问题，即典型的TSP问题，把包解压运行main.m文件即可-This package is a dual population of ant colony algorithm to seek China s 75 cities, the shortest path problem, that is typical TSP problem, the package can extract the files to run main.m
Date : 2025-12-29 Size : 8kb User : 梁锦兆
[AI-NN-PR] tsp DL : 0: ga算法解tsp问题.动态TSP就是城市坐标在随着时间变化,我们的目标则要在最短的时间窗内寻找出最优的城市遍历路径,这是个双最优问题. 这是我对动态TSP算法的理解,使用改进的反序-杂交算法-ga algorithm problems tsp. dynamic TSP is that the town change over time in the coordinates, we aim to have in the shortest possible time window to find out the optimal path to traverse the city, this is a dual-optimal problem. This is my understanding of the dynamic TSP algorithm understanding, the use of improved anti-sequence- Hybrid Algorithm
Date : 2025-12-29 Size : 4kb User : 李丽
[AI-NN-PR] simulaiton_annealing DL : 0: 著名的模拟退火算法源程序,运用的例子是TSP问题,以中国31省会城市的最短旅行路径为例.-Well-known source of the simulated annealing algorithm, using the example is the TSP in order to China s 31 provincial capital cities as an example of the shortest path to travel.
Date : 2025-12-29 Size : 2kb User : 1234
[AI-NN-PR] tsp DL : 0: hopfield神经网络求解TSP问题，改程序设置了10个城市的随机位置，进而解决城市间最短路径问题。-hopfield neural network to solve TSP problem, the procedures set up to 10 cities random location, then the shortest path between cities to solve problem.
Date : 2025-12-29 Size : 512kb User : stefwang
[AI-NN-PR] tsp DL : 0: 旅行商问题，总共30个城市，计算最优路线和最短路径-Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path
Date : 2025-12-29 Size : 1kb User : steven
[AI-NN-PR] GATSP DL : 0: 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
Date : 2025-12-29 Size : 4kb User : luoyong
[AI-NN-PR] TSP DL : 0: 利用动态规划思想，求货郎担问题，采用C++，显示各结点的路径并求出最短距离-The use of dynamic programming ideas, seeking traveling salesman problem, using C++, showing the node' s path and find the shortest distance
Date : 2025-12-29 Size : 10kb User : mr wu
[AI-NN-PR] TSP_hopfield DL : 0: 通过hopfield神经网络解决TSP商务旅行商问题，找出一条最短路径！-By hopfield neural networks to solve traveling salesman problem TSP business, find a shortest path!
Date : 2025-12-29 Size : 9kb User : Cecilia
[AI-NN-PR] ant DL : 0: 旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短-TSP (Travelling Salesman Problem, abbreviated TSP, also known as the traveling salesman problem): with n cities and the distance matrix D = [dij], where dij that city i to city j the distance, i, j = 1, 2 ... n, then the problem is to find out I visited each city exactly once and make a loop for the shortest path length
Date : 2025-12-29 Size : 6kb User : hepeng
[AI-NN-PR] SimulateAnnealing DL : 0: 用于实现TSP的模拟退火实验 JAVA编写适合初学求解144城市最短路径-Simulated Annealing for the TSP to achieve the preparation of experimental JAVA 144 cities for beginners to solve the shortest path
Date : 2025-12-29 Size : 2kb User : 李小
[AI-NN-PR] tabu-matlabcode-tsp DL : 0: 蚁群法在最短路径中的运用，附带matlab代码-Ant in the use of the shortest path, with matlab code
Date : 2025-12-29 Size : 7kb User : 123
[AI-NN-PR] TSP DL : 0: 使用遗传算法进行求解路线最短路径问题的VC++6.0源程序-Using a genetic algorithm to solve the line shortest path problem VC++6.0 source
Date : 2025-12-29 Size : 55kb User : yangbin
[AI-NN-PR] AS DL : 0: 蚁群算法解决TSP问题，34个城市寻找最短路径-Ant colony algorithm to solve TSP 34 cities to find the shortest path
Date : 2025-12-29 Size : 2kb User : xinxiaomeng
[AI-NN-PR] TSP DL : 0: 遗传算法：旅行商问题（已知城市坐标，求路过各城市的最短路径）-Genetic algorithms: the traveling salesman problem (known city coordinates, find the shortest path passing cities)
Date : 2025-12-29 Size : 2kb User : 连云
[AI-NN-PR] chapter4-GA-TSP DL : 0: 遗传算法求TSP最短路径，非常有利于初学者学习-Genetic Algorithm for TSP shortest path, is very conducive for beginners to learn
Date : 2025-12-29 Size : 9kb User : huangpei
[AI-NN-PR] tsp DL : 0: 用遗传算法求解旅行商问题，输出最短路径的最短路径长度。-Genetic Algorithm for Traveling Salesman problem, the output shortest path length of the shortest path.
Date : 2025-12-29 Size : 2kb User : 千羽寻叶
[AI-NN-PR] Ga-tsp DL : 0: 遗传算法tsp问题针对题目中物流配送路径优化问题，本文引入0-1规划思想，建立了带约束条件的物流配送问题的数学模型。求解时，引入遗传算法的编码方式，并针对分区数与客户数量相差较小的情况，灵活运用分区配送算法确定包含最优解的分区序列组，紧密结合枚举法使得其算法兼顾简单、快速的优点。应用Matlab软件可执行得到最短路径。兼顾时间因素导致的复杂影响，我们引入了惩罚函数，并通过设定惩罚系数，进一步由最短路径求得最优路径。-Genetic algorithm tsp problem of logistics distribution routing optimization problem subject, this paper introduces 0-1 programming ideas, a mathematical model with the constraints of logistics and distribution problems. Solving, introducing genetic algorithm encoding, and the number of partitions and the number of customers for a small difference, the flexible use of the partition containing the partition algorithm to determine the distribution of the optimal solution sequence group, closely enumeration method allows both the algorithm is simple, fast advantages. Matlab software application executable to get the shortest path. Complex factors affecting both the time, we introduce a penalty function, and by setting the penalty coefficient, and further obtain the optimal path from the shortest path.
Date : 2025-12-29 Size : 181kb User :

« 12 »