Description: 本软件主要用于帮助计算机爱好者学习蚁群算法时做有关蚁群算法的试验。蚁群算法作为一种优秀的新兴的算法，具有非常广的应用前景，越来越多的人开始学习蚁群算法，因此本软件也有推广前景。
本软件除了用于教学目的外，还可用于解决实际生活中的与TSP（即，旅行商问题）问题相关的问题。
TSP问题描述的是一个旅行商要到几个城市去，每个城市必须去一次且仅能去一次，要求满足这样条件的
最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排等多种约束满足问题。
-the software used to help computer enthusiasts Ant learning algorithm to do the ant colony algorithm tests. Ant Algorithm as a good new algorithm has a very broad application prospects, more and more people begin to learn ant colony algorithm, the software also promote the prospects. In addition to the software for teaching purposes, can also be used to solve real life with TSP (ie, the traveling salesman problem) issues related issues. TSP is a description of the TSP to several cities, each city must go only to one that once such conditions are met the shortest path. Some of this software can be extended for city planning, public transportation vehicles and other arrangements path constraint satisfaction problems. Platform: |
Size: 1310 |
Author:李誉 |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853791 |
Author:陈宝文 |
Hits:
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 Platform: |
Size: 4044 |
Author:宏姬 |
Hits:
Description: 题描述的是一个旅行商要到几个城市去，每个城市必须去一次且仅能去一次，要求满足这样条件的最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排-that description is a traveling salesman to several cities, each city must go to one and only one, satisfy requirements for the shortest path. This software can be used for some expansion of urban planning, arrangements Bus Route Platform: |
Size: 20205 |
Author:何泼 |
Hits:
Description: 算法分析问题：用VC编写的旅行商程序，可以实现旅行商最短路径旅行个城市的功能-algorithm analysis : VC procedures for the preparation of the traveling salesman, TSP can achieve the shortest path of travel to the cities function Platform: |
Size: 18832 |
Author:suyulan |
Hits:
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: 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: 遗传算法编程求解旅行商问题；图论中最短路问题的Matlab程序实现；背包问题模型的Matlab程序实现。-Genetic Algorithm for Solving Traveling Salesman Problem programming graph theory, shortest path problem in the Matlab program implementation knapsack problem Matlab model implementation process. Platform: |
Size: 504832 |
Author:竹子的信仰 |
Hits:
Description: 旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短。-TSP (Travelling Salesman Problem, Jane Hutchison TSP, also known as the traveling salesman problem): with n cities and the distance matrix D = [dij], which said dij city i to city j the distance, i, j = 1, 2 ... n, the problem is to identify each city exactly once visited a loop and make it to the shortest path length. Platform: |
Size: 268288 |
Author:章为到 |
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: Shortest Path, Traveling Salesman and Hamiltonian Cycle are the other network
design problem. These problems are very common to back bone network design
problem. In all these three problems, the main difference is the degree of the node
which is strictly two. Further, these three problems are very similar with each other.
In the case of Shortest Path and Traveling salesman problem, a Hamiltonian Cycle is
checked in the possible solution. Due to this similarity, these three problems are also
considered in this research work. Shortest Path is considered in the terms of decision
making.-Shortest Path, Traveling Salesman and Hamiltonian Cycle are the other network
design problem. These problems are very common to back bone network design
problem. In all these three problems, the main difference is the degree of the node
which is strictly two. Further, these three problems are very similar with each other.
In the case of Shortest Path and Traveling salesman problem, a Hamiltonian Cycle is
checked in the possible solution. Due to this similarity, these three problems are also
considered in this research work. Shortest Path is considered in the terms of decision
making. Platform: |
Size: 335872 |
Author:mohamed |
Hits:
Description: 旅行商问题：全国省会二维坐标如图30所示，基于遗传算法设计从黑龙江到西藏，并遍历全国各省会(每个省会只经过一次）的最短路径-Traveling salesman problem: two-dimensional coordinates of the national capital as shown in Figure 30, based on genetic algorithm design from Heilongjiang to Tibet and traverse the provinces (each provincial capital only after a) the shortest path Platform: |
Size: 3072 |
Author:郑威 |
Hits:
Description: 货郎担问题,最短路径算法,使用c++实现-Traveling salesman problem using the shortest path algorithm data structure to achieve c++ Platform: |
Size: 1024 |
Author:xingzhi |
Hits:
Description: Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed
The nearest neighbour (NN) algorithm (a greedy algorithm) lets the salesperson choose the nearest unvisited city as his next move. This algorithm quickly yields an effectively short route. For N cities randomly distributed on a plane, the algorithm on average yields a path 25 longer than the shortest possible path.[17] However, there exist many specially arranged city distributions which make the NN algorithm give the worst route (Gutin, Yeo, and Zverovich, 2002). This is true for both asymmetric and symmetric TSPs (Gutin and Yeo, 2007).-Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed
The nearest neighbour (NN) algorithm (a greedy algorithm) lets the salesperson choose the nearest unvisited city as his next move. This algorithm quickly yields an effectively short route. For N cities randomly distributed on a plane, the algorithm on average yields a path 25 longer than the shortest possible path.[17] However, there exist many specially arranged city distributions which make the NN algorithm give the worst route (Gutin, Yeo, and Zverovich, 2002). This is true for both asymmetric and symmetric TSPs (Gutin and Yeo, 2007). Platform: |
Size: 4096 |
Author:ahmed |
Hits:
Search - shortest traveling salesman path