Description: 遗传算法的一个例子：旅行商问题。C++源代码，适合初学者研究遗传算法与最优化等方面的知识。-a genetic algorithm examples : the traveling salesman problem. C source code, suitable for beginners and genetic algorithm optimization and other kinds of knowledge. Platform: |
Size: 122189 |
Author:hu |
Hits:
Description: 一种运用蚂蚁算法和遗传算法解决旅行商问题的混合优化程序-an ant algorithm and the use of genetic algorithms to solve the traveling salesman problem hybrid optimization procedures Platform: |
Size: 81920 |
Author:陈雷 |
Hits:
Description: 遗传算法的一个例子：旅行商问题。C++源代码，适合初学者研究遗传算法与最优化等方面的知识。-a genetic algorithm examples : the traveling salesman problem. C source code, suitable for beginners and genetic algorithm optimization and other kinds of knowledge. Platform: |
Size: 121856 |
Author:hu |
Hits:
Description: 大家好!这是一个由VC编写的遗传算法解决TSP问题的源代码，希望能初学者有所帮助!-everyone! This is a VC prepared by the Genetic Algorithm for the Traveling Salesman Problem source code, hope to help beginners! Platform: |
Size: 60416 |
Author:舒小敏 |
Hits:
Description: 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs Platform: |
Size: 2048 |
Author: |
Hits:
Description: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes Platform: |
Size: 3072 |
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 -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: 主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n between the distance from the existing one salesman must traveled n this city, and visit each city only once, finally starting to return to the city, for the shortest distance from the genetic algorithm. Platform: |
Size: 1024 |
Author:阳文 |
Hits:
Description: 用遗传算法解决旅行商问题，并用图形界面显示出来。比较了分别采用轮盘赌选择算子和锦标赛选择算子的遗传算法求解TSP问题的性能，包括：运行时间、进化总代数和最优解质量。 结果曲线可以用图形显示出来。-Genetic algorithm is used to solve the traveling salesman problem, and use graphical interface is displayed. Compared using roulette selection operator and tournament selection operator of genetic algorithm to solve TSP s performance issues, including: run time, the evolution of the overall quality of algebra and the optimal solution. The results of curve can be used graphics displayed. Platform: |
Size: 71680 |
Author:sdfsfdsf |
Hits:
Description: 遗传算法和“货郎担” 问题:
"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point." -Genetic algorithm and the Platform: |
Size: 283648 |
Author:s050403054 |
Hits:
Description: 使用MPI编写一个并行程序，利用遗传算法来解决旅行商问题。-The use of MPI to prepare a parallel process, the use of genetic algorithm to solve the traveling salesman problem. Platform: |
Size: 53248 |
Author:pim |
Hits:
Description: 用C语言实现旅行商问题。该算法简单精悍，效率也不低，是实现TSP问题的很好的算法。-Using C language realize traveling salesman problem. The algorithm is simple and lean, efficiency is not low, the problem is to achieve a good TSP algorithms. Platform: |
Size: 236544 |
Author:锭 |
Hits:
Description: have recently become very interested in the area of genetic algorithms and Ant Colony Optimization techniques. I was determined to write a complete program demonstrating these two techniques. In particular I wanted to compare the efficiency of these two approaches in the area of finding solutions to the Traveling Salesman Problem Platform: |
Size: 99328 |
Author:nasser |
Hits:
Description: 用MATLAB求解遗传算法的旅行商问题，这一类问题在大学生以及研究生的数模竞赛以及日常生活当中尤为重要的，为我们所重视。、近年来，学术界对旅行商问题也逐渐重视起来。-Using MATLAB genetic algorithm for solving the traveling salesman problem, this kind of problem students and graduate students in Mathematical Modeling Contest, and daily life is particularly important for our attention. In recent years, the academic community on the traveling salesman problem is gradually pay attention to it. Platform: |
Size: 6144 |
Author:zhangshenglin |
Hits:
Description: Heuristic method for the Traveling Salesman Problem
A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
function tspplot(p,X,nodenum) #ok
TSPPLOT Plot 2D tour
TSPPLOT(P,X), P is the tour and X is the coordinate matrix
TSPPLOT(P,X,1) also adds node numbers-Heuristic method for the Traveling Salesman Problem
A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
function tspplot(p,X,nodenum) #ok
TSPPLOT Plot 2D tour
TSPPLOT(P,X), P is the tour and X is the coordinate matrix
TSPPLOT(P,X,1) also adds node numbers Platform: |
Size: 2048 |
Author:ahmed |
Hits:
Search - the traveling salesman