Location:
Search - traveling
Search list
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: 产生式系统中旅行商问题的求解-Production System Traveling Salesman Problem Solving
Platform: |
Size: 43008 |
Author: 红雨 |
Hits:
Description: C#版遗传算法解TSP问题-C# version Genetic Algorithm for the Traveling Salesman Problem
Platform: |
Size: 8192 |
Author: 黄瑞 |
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: LC分枝限界法解货郎担—代码-LC Branch and Bound Solving traveling salesman- code
Platform: |
Size: 59392 |
Author: 张强 |
Hits:
Description: 货郎担问题源代码 货郎担问题源代码-traveling salesman problem source code traveling salesman problem
Platform: |
Size: 3072 |
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: 本程序实现了多城市的tsp问题（即旅行商问题）的遗传算法-the process of multi-city tsp (ie, the traveling salesman problem) Genetic Algorithm
Platform: |
Size: 1171456 |
Author: 叶靥 |
Hits:
Description: 用动态规划算法编写的有关旅行商问题的java程序-dynamic programming algorithm used in the preparation of the Traveling Salesman Problem java programs
Platform: |
Size: 2048 |
Author: |
Hits:
Description: 分支限界法实现货郎担问题，开发工具eclipse-branch and bound Method traveling salesman problem, development tools eclipse
Platform: |
Size: 16384 |
Author: EllenGong |
Hits:
Description: 求解货郎担问题的分枝限界算法,程序中有较为详细的注释-solving the traveling salesman problem Branch and Bound algorithm, procedures are more detailed Notes
Platform: |
Size: 3072 |
Author: 郎风华 |
Hits:
Description: 经典的货郎担问题解决办法，采用了模拟退火算法，结构非常清楚，速度很快！-classic traveling salesman problem solution, using simulated annealing, the structure is very clear, very fast!
Platform: |
Size: 1437696 |
Author: 红红 |
Hits:
Description: 旅行商问题,动态规划,附加说明文档,是程序竞赛的经典题-traveling salesman problem, dynamic programming, additional documentation, and procedures of the classic title race
Platform: |
Size: 17408 |
Author: 周狼 |
Hits:
Description: 旅行商问题的遗传算法求解源代码，多目标优化经典问题的现代启发式算法实现-traveling salesman problem genetic algorithm source code, multi-objective optimization of the modern classic Heuristic Algorithm
Platform: |
Size: 4096 |
Author: 鸿渐 |
Hits:
Description: 问题：货郎担问题 实现方法：枚举，回溯，动态规划，分支界限法 -: traveling salesman problem Method : Enumeration, backtracking, dynamic programming, branch and bound
Platform: |
Size: 11264 |
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(Traveling salesman problem，旅行商问题)问题，基本执行见run.bat, 其它详见其中的readme.txt。（实例为TSPLIB格式，见myprojects目录，包括eil51, d198, lin318等小型问题，以及1000到3000城市之间的例子，基本能得到最优解）-for TSP (Traveling salesman problem, TSP), the implementation of basic run.bat see, see the other readme.txt. (Example format for the ACS, see myprojects catalogs, including eil51, d198. lin318 other small-scale, and from 1000 to 3000 among cities example, can be the optimal solution)
Platform: |
Size: 445440 |
Author: caqi |
Hits:
Description: 利用模拟退火算法解决旅行商问题的java原码-using simulated annealing algorithm to solve the traveling salesman problem java original code
Platform: |
Size: 9216 |
Author: 祖超 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»