搜索资源列表
TravelingSalesmanProblemwithGeneticAlgorithm
- 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 checki
TravelingSalesmanProblemGeneticAlgorithm
- 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)
旅行商问题
- % MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) % Finds a (near) optimal solution to a variation of the M-TSP by setting % up a GA to search for the shortest route (least distance needed for % each salesman to trav
VRP_GA.rar
- 用GA遗传算法求解VRP车辆配送问题，以及VRP的特殊情况TSP旅行商问题,GA Genetic Algorithm for VRP with the distribution of vehicles, as well as the special circumstances of VRP Traveling Salesman Problem TSP
TSPandMTSP
- MTSP 问题其实与单 旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条 件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。-M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup c
mtspf_ga
- 基于遗传算法的多旅行商问题求解，有过程变化图-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
ImprovedTSP
- 利用GA算法解决旅行商问题的源代码，可编译运行，并可观察各种遗传算子组合的作用和效果-GA algorithm to solve the traveling salesman problem using the source code can be compiled to run, and can observe the various combinations of genetic operators and effect of
tspof_ga
- TSPOF_GA Fixed Open Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
TSP
- 求已知给定坐标的旅行商问题，并且给出了丰富的子程序和详细的说明文字，特别适合GA初学者的编程指导-Request known to the given coordinates of the traveling salesman problem, and gives a wealth of subroutines and detailed captions, in particular, the programming guide for beginners GA
gaGui
- 遗传算法GA 遗传算法： 旅行商问题(traveling saleman problem,简称tsp)： 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短-GA GA GA: TSP (traveling saleman problem, short tsp): n known distance between cities, a salesman of ex
83494763aforge_src
- GA解决Tsp问题的代码.一种使用遗传算法来解决旅行售货员问题.-GA to solve the problem of code Tsp. Way to use genetic algorithm to solve the traveling salesman problem.
mtspo_ga
- 旅行商问题，起点与终点为同一点，求最短路径，-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
SA_GA_PSO
- 模拟退火（SA）、遗传算法（GA）、粒子群优化（PSO）解决旅行商问题（TSP）实验 本文件包括源码，实验说明文档，实验总结PPT Have a happy experiment！-Simulated annealing (SA), genetic algorithms (GA), particle swarm optimization (PSO) to solve the traveling salesman problem (TSP) experiment of this docum
TSP110707-1
- 旅行商问题是一个典型的NP完全性问题。本文基于改进的自适应遗传 算法设计并开发了一个求解旅行商问题的软件程序，并将此程序进行了48 个城市的TSP问题计算，与模拟退火算法的计算过程及计算结果进行了比 较。文中给出了遗传算法在解决TSP问题中的参数选择和编码方式、适应 度函数的设计、种群的初始化和遗传算子的详细设计。通过对此程序的改 装，即可用于其他NP完全性问题的求解。-The traveling salesman problem is a typical NP proble
mtsp_ga
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
mtsp_Genetic-Algorithm
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
mtsp
- 多旅行商问题的遗传算法 环形 固定节点- MTSPOFS_GA Fixed Start Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (le
mtspv_ga
- 基于遗传算法(GA)的多变量旅行商问题(TSP) ，MTSPV_GA Variable Multiple Traveling Salesman Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search fo
TSP
- 用遗传算法求解旅行商问题，GA ，GA2 为运行文件（GA2 是选择操作改进后的计算） 本算法为中初始值在运行前指定-Traveling salesman problem using genetic algorithm, GA, GA2 (GA2 selecting computing operations improved) The algorithm for the initial value before running the specified file to run
TSP
- 用遗传算法求解旅行商问题，GA ，GA2 为运行文件（GA2 是选择操作改进后的计算） 本算法为中初始值在运行前指定-Traveling salesman problem using genetic algorithm, GA, GA2 (GA2 selecting computing operations improved) The algorithm for the initial value before running the specified file to run