搜索资源列表
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)
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
TSPMATLAB.rar
- 遗传算法求解TSP问题的MATLAB实现。这是一篇非常有新意的论文，对于学习遗传算法非常有用,This paper has resolved the traveling salesman problem(TSP) by virtue of geneitc algorithms(GA)
robot_motion_planning
- This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link robot arm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a maximum pre-define
GA
- solving traveling salesman problem with matlab
mtspo_ga
- 旅行商问题，起点与终点为同一点，求最短路径，-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
GAtsp
- 基于遗传算法（GA）的10个城市的旅行商（TSP）问题的建模及仿真-Based on genetic algorithms (GA) of the 10 cities of the traveling salesman (TSP) problem of modeling and simulation
GA-to-TSP
- 遗传算法解决旅行商问题 -Genetic algorithm to solve traveling salesman problem genetic algorithm to solve traveling salesman problem
tsp-with-GA
- traveling salseman problem using 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
- TSP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the TSP by setting up a GA to search for the shortest route (least distance for the salesman to travel to each city exactly once and return to
MTSPF_GA
- 遗传算法计算多旅行商问题：多个商人从多个城市出发各自返回自己的出发城市。-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 nee
adaptive-GA-TSP
- 运用matlab进行编程，能够解决TSP旅行商问题的基本遗传算法的实现，其中参数可自定义-Programming using matlab, able to solve the TSP traveling salesman problem of the realization of the basic genetic algorithm, the parameter can be customized
GA
- 在考虑汽车零部件包装箱长、宽、高等三维尺寸的约束下，以配送中心为原点，分派多辆同一规格的货车到n个供应商处取货，最后回到配送中心。本章所构建的三维装载约束下的汽车零部件循环取货路径优化模型要解决的问题是确定循环取货路径，要求充分考虑汽车零部件在货车车厢中的三维装载位置，确保每个供应商处的零部件均能成功装载，尽可能使车辆装载率最大，且所有车辆的总行驶路径最短。-In considering the auto parts box length, width, higher dimensional s
GA-TSP
- This code uses the genetic algorithm to solve the traveling salesman problem by using the exchange,cross and mutation operators to change the route and calculate the fitness(distance) of each route.
Multiple-Traveling-Salesmen-Problem
- 多旅行商matlab实验源码实现了三种多旅行商问题,使用了遗传算法，可以在matlab2010a以上版本运行-MTSPOF_GA Fixed Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
tsp_ga
- 旅行商问题的GA启发式解法的matlab程序-GA heuristic solution of the traveling salesman problem matlab program
mtsp问题matlab代码
- 使用ga算法，通过八种评价机制解决多旅行商问题(The GA algorithm is used to solve the multiple traveling salesman problem via eight evaluation mechanisms)
chapter4 基于遗传算法的TSP算法
- 遗传算法的旅行商问题的典型范例，初学者可参考学习。(Traveling salesman problem based on genetic algorithm)