Description: 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 Platform: |
Size: 4096 |
Author:宏姬 |
Hits:
Description: javaACS 蚁群算法是人工智能的一种算法,这个是用JAVA写的一个求解TSP的程序-javaACS ant algorithm is an artificial intelligence algorithm, This is written in JAVA using a procedure for TSP Platform: |
Size: 20480 |
Author:刘星 |
Hits:
Description: 模拟退火在最短路径求解问题上的实际应用！-simulated annealing for the shortest path problem on the practical application! Platform: |
Size: 39936 |
Author:徐徐 |
Hits:
Description: tsp问题俗称旅行商问题，一个商人从一个城市出发，经过所有的城市一次且仅一次回到出发的城市，问旅行商应当如何选择路径使总路径最短。本程序是用lingo软件编写的，只需要更改城市的数目以及距离矩阵即可。-tsp problem commonly known as the traveling salesman problem, a businessman from a city of departure, after all of the city once and only once returned to the starting city TSP question should be how to choose the shortest path so that the total path. This procedure is used lingo software programmers only need to change the number of cities as well as the distance matrix can be. Platform: |
Size: 1024 |
Author:雷浩 |
Hits:
Description: 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)
Platform: |
Size: 3072 |
Author:阳关 |
Hits:
Description: 用分支定界法求解旅行商问题旅行商问题是一个经典NP问题：有n个城市，一个推销员要从其中的某一个城市出发，每个城市只能遍历一次，要求走遍所有的城市，再回到他出发的城市，求所有可能路径中路径最短的一条路径来。-Using branch and bound method for solving traveling salesman problem traveling salesman problem is a classic NP problem: have n cities, a salesman from one of a city of departure, each city can only traverse once traveled all the requirements of the City , and then returned to his starting city, and all the possible path of the shortest path to a path. Platform: |
Size: 4096 |
Author:bianbian |
Hits:
Description: 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its description of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path Platform: |
Size: 3072 |
Author:ron |
Hits:
Description: 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. Platform: |
Size: 524288 |
Author:stefwang |
Hits:
Description: 旅行商问题，总共30个城市，计算最优路线和最短路径-Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path Platform: |
Size: 1024 |
Author:steven |
Hits:
Description: 旅行商问题的源代码及其说明。给出空间中给定n个点，画一条简单路径，包括所有的点，使得路径最短-Traveling Salesman Problem and its description of the source code. Given space in a given n points, draw a simple path, including all the points, making the shortest path Platform: |
Size: 3072 |
Author:hbk hsu |
Hits:
Description: In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment. This app. is demo for this.-In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment. This app. is demo for this. Platform: |
Size: 70656 |
Author:kassi |
Hits:
Description: 本系统是用C#语言进行旅行商问题（TSP)的实验仿真，来实现从一个城市到最后一个城市的最短路径的模拟。-This system is to use C# language Traveling Salesman Problem (TSP) of the experimental simulation, to move from one city to the last one the city' s shortest path simulation. Platform: |
Size: 204800 |
Author:学士 |
Hits:
Description: 用递归法解决最短周游路径问题的java实现-Travel by the shortest path of the recursive method to solve the problem of the java implementation Platform: |
Size: 201728 |
Author:luoyu |
Hits:
Description: 本文是以旅行商问题为研究点，利用蚂蚁算法优化求解最短路径，平台工具是具有绘图功能的matlab软件。(This paper takes traveling salesman problem as the research point, and uses ant algorithm to optimize the shortest path. The platform tool is matlab software with drawing function.) Platform: |
Size: 12288 |
Author:lm521
|
Hits:
Description: tsp问题（全称：TravellingSalesmanProblem），又称为旅行商问题、货郎担问题、TSP问题，是一个多局部最优的最优化问题，遗传算法是一种基于种群演变一种优化的算法，在此基础上的优化程序会自动寻找出最短路(TSP (full name: TravellingSalesmanProblem), also known as the traveling salesman problem, traveling salesman problem, but TSP problem is an optimization problem of multi local optimum, genetic algorithm is an optimization algorithm based on the evolution of a population, on the basis of the optimization program will automatically find the shortest path) Platform: |
Size: 146432 |
Author:淡然踏歌
|
Hits:
Search - shortest path tsp