搜索资源列表
蚁群算法的优化计算——旅行商问题(TSP)优化
- 路径优化 蚁群算法 tsp问题 优化设计(Path optimization TSP problem of path optimization ant colony algorithm)
SA_TSP
- 介绍模拟退火算法，并应用到TSP问题上。并附有小程序(Introduce simulated annealing algorithm and apply it to TSP problem. With a small program)
TSP遗传算法
- 对于TSP问题使用遗传算法的解决方法，其中含有测试数据以及代码数据。(The genetic algorithm is used to solve the TSP problem, which contains the test data and the code data.)
混合粒子群算法原始
- 采用混合粒子群算法求解tsp问题MATLAB仿真(Hybrid particle swarm optimization (PSO) algorithm for MATLAB simulation of TSP problem)
模拟退火
- 利用模拟退火算法进行仿真实验，解决TSP问题(Using simulated annealing algorithm to solve TSP)
遗传算法
- 利用进化算法进行仿真实验，解决TSP问题(Simulation experiments are carried out by evolutionary algorithm to solve the TSP problem)
AntColonyOptimization-TSP
- 蚁群算法作为新发展的一种模拟蚂蚁群体智能行为的仿生优化算法，它具有较强的鲁棒性、优良的分布式计算机制、易于与其他方法相结合等优点，本算法用来解决最短路径问题，并在TSP旅行商问题上取得较好的成效。同时也可以在他领域如图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类进行参考。(Ant colony algorithm is a newly developed bionic optimization algorithm that simulates the ant colony intel
遗传算法TSP
- 基于遗传算法的TSP问题，连续HOPfield网络优化(TSP problem based on genetic algorithm and optimization of continuous HOPfield network)
蚁群算法的优化计算——旅行商问题（TSP）优化
- 蚁群算法的优化计算——旅行商问题（TSP）优化(Optimization calculation of ant colony algorithm)
tsp-master
- 运行TSP-GP即可运行，其中有几个快捷键： e.开始进化 s.停止 进化一旦开始，如果不手动停止，计算就会一直进行下去(Run TSP-GP, and there are several shortcuts: E. began to evolve S. stop Once the evolution begins, the calculation will go on if you don't stop it manually.)
antcolonytsp
- 采用蚁群算法求解TSP问题 迭代次数设置200(Ant colony algorithm is used to solve TSP problem. The number of iterations is set to 200.)
matlab解决tsp
- matlab中解决tsp问题经典蚁群算法(Classical ant colony algorithm for solving TSP problem in MATLAB)
GA-tsp
- 使用遗传算法解决了旅行商问题，采用C++做实现(The traveling salesman problem is solved by genetic algorithm, and implemented by C++.)
ga_TSP
- 程序主要是用于解决TSP问题，运用的算法为遗传算法(The program is mainly used to solve the TSP problem. The algorithm used is the Genetic algorithm.)
TSP_PSO
- 基于混合粒子群算法的tsp问题求解的MATLAB程序。(Solution of TSP problem based on Hybrid Particle Swarm Optimization)
jinji
- 禁忌搜索算法，主要为解决TSP问题，选取31个城市，目标是31个城市的路径最短化(Tabu search algorithm, mainly to solve the TSP problem, select 31 cities, the goal is the shortest path of 31 cities.)
mtspf_ga
- 用于2维和3维的TSP问题，固定起点和终点，可给定旅行商数量(For the 2 dimensional and 3 dimensional TSP problem, fixed starting point and end point, the number of traveling salesmen can be given.)
新建压缩文件
- 完美实现tsp问题的求解，并能得到较精准的答案(Solving the problem of TSP)
6. TSP Prog
- 遗传算法解决旅行商问题，可以解决N个城市最短路程问题并画图表示，给出迭代次数和最短距离(Solving the traveling salesman problem by genetic algorithm)
ga_TSP
- 动态展示tsp问题求解过程，并给出最优解和平均解(Dynamic display of TSP problem solving process)