搜索资源列表
PSO
- 利用改进的粒子群算法解决旅行商问题，即g改进的PSO解决TSP,在调用程序时，直接输入pso（c,n），c为距离矩阵，请自己给出，n为粒子群个数-Improved particle swarm algorithm to solve the traveling salesman problem, ie g Improved PSO to solve the TSP
The-TSP-problem
- The TSP problem - 旅行商问题，回溯，分支界限法解决-The TSP problem- traveling salesman problem, backtracking, branch-and-bound method to solve
TSP_cold
- 模拟退火算法求解旅行商问题，停止条件为“零度”-Simulated annealing algorithm to solve the traveling salesman problem, stop the " zero"
yichuanTSP
- 在matlab编程环境下，利用智能算法中的遗传算法，实现实现了旅行商问题。-Genetic algorithm for TSP
tsp_bb
- 旅行商问题的分支定界解法，含有详细的注释和说明，希望对你有用。-Branch and bound
粒子群算法（PSO）解决TSP
- 粒子群优化TSP旅行商问题，可运行，可以在上面改造出关于离散优化，VRP等问题
tsp_optimization-master
- 旅行商问题，是图论问题中的经典问题，本例是实现该算法的典例-Solves the m-tsp with optimization. Used as part of the project to optimize vehicle routes leading to fuel efficient solutions. Change the coordinates array to modify the input coord
pso
- 粒子群算法求解旅行商问题 运行yunxing.m中的内容-Particle swarm algorithm to solve the traveling salesman problem
MTSP
- 旅行商问题（TravelingSalesmanProblem，TSP）是经典的组合优化问题，而一些实际应用问题不能归纳为经典TSP，其中涉及到多个（项）任务的分派与优化，问题演变为多（人）旅行商问题（multipleTravelingSalesmanProblem，mTSP）-The traveling salesman problem (TravelingSalesmanProblem TSP) is a classic combin
BP
- BP神经网络程序，用语解决实际生活中的一些最优化问题，比如旅行商问题。-BP neural network program, the term to solve the optimization problem in real life, such as the traveling salesman problem.
main0601
- 旅行商问题的退火算法解决-The traveling salesman problem annealing algorithm to solve
c
- c语言用蚂蚁算法解决TSP旅行商问题，带详细注释！供学习蚂蚁算法用！ -c language ant algorithm to solve the traveling salesman problem TSP, with detailed notes! Ant algorithm to use for learning!
TSP-SA-CHANGXIN
- 解决了应用模拟退火算法的旅行商问题研究 应用平台MATLAB-To solve application of simulated annealing algorithm traveling salesman problem application platform MATLAB
TSP
- 用模拟退火算法解决旅行商问题，城市坐标是数据集直接调用。-Simulated annealing algorithm to solve the traveling salesman problem, the city coordinates data sets directly call.
VRP
- 实现简单路径规划问题，也可以说是旅行商问题，货郎担问题 -Simple path planning problem is the traveling salesman problem, traveling salesman problem
ycsf
- 使用遗传算法解决旅行商问题。一个旅行商要去N个城市旅行，这N个城市中，任意两个城市之间都有一条路径，路径的长度按照两个城市之间的直线距离计算。找出一条路径，使得旅行商从A城市出发经过所有的城市再回到A城市，所经过的路径最短，每个城市不能重复旅行。-Using genetic algorithm to solve the traveling salesman problem.
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 sea
dynamic-ACO-for-TSP
- 动态蚁群算法（ACO）求解（旅行商）TSP问题-Dynamic ant colony algorithm (ACO) to solve the problem (TSP) TSP
mfc-tsp
- 用c++实现的mfc程序，解决旅行商问题。-Mfc program with c++ implemented, solve the traveling salesman problem.
andorid-TSP
- 安卓程序，包括解决旅行商问题的应用，指南针，寻求最短路径的小游戏，关于旅行商问题的介绍。-Andrews program, including application to solve the traveling salesman problem, compass, seeking the shortest path game, the introduction of the traveling salesman problem.