搜索资源列表
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
HybridalgorithmbasedonabalancedstudyofMTSP
- 基于混合算法的均衡路程MTSP研究 给出了MTSP的整数线性规划模型、分类, 提出了均衡各旅行商访问路程和均衡各旅行商访问人数的多目标 问题针对均衡各旅行商访问路程的设计了相应的求解算法, 求解算法为遗传算法和一的混合算法给出了相应 的示例和实验结果, 并对实验结果的有效性进行了研究-Hybrid algorithm based on a balanced study of MTSP given distance of the MTSP integer linear programm
matlab-mtsp-problem
- 这是一篇关于多旅行商问题的学术论文，非常有新意，非常有利于我们深入了解mtsp问题的本质-This is a multi-traveling salesman problem on the papers, very fresh, very beneficial to our in-depth understanding of the nature of the problem mtsp
TabuSearchforTSP
- This gives source code of traveling salesman problem. The algorithm used is tabu search.
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
MTSP
- 旅行商问题（TravelingSalesmanProblem，TSP）是经典的组合优化问题，而一些实际应用问题不能归纳为经典TSP，其中涉及到多个（项）任务的分派与优化，问题演变为多（人）旅行商问题（multipleTravelingSalesmanProblem，mTSP）-The traveling salesman problem (TravelingSalesmanProblem TSP) is a classic combinatorial optimization problem,
MTSP
- 蚁群算法实现最短路径，一个起点一个终点的问题-Ant colony algorithm shortest path problem, a starting point for an end
mtsp-with--pso
- 应用启发式算法-粒子群算法PSO，解决物流配送中心选址问题，结果好的解决了上述问题，值得参考。-PSO Particle Swarm algorithm using heuristic algorithm to address the logistics distribution center location problems, resulting in a good solution for this problem, it is also useful.
MATLAB-MTSP
- 遗传算法解决5种多旅行商问题（mtsp）的matlab程序 分别为以下5中情况： 1.从不同起点出发回到起点（固定旅行商数量） 2.从不同起点出发回到起点（旅行商数量根据计算可变） 3.从同一起点出发回到起点 4.从同一起点出发不会到起点 5.从同一起点出发回到同一终点（与起点不同）-5 kinds of genetic algorithms to solve multiple traveling salesman problem (mtsp) matlab progra
ACO---pso-MTSP-
- 基于蚁群—粒子群的TSP求解，可以解决蚁群算法陷入局部最优解的问题，更好求出TSP问题-Based on ACO- pso MTSP solving the problem can be solved ant colony algorithm into local optimal solution, obtaining better TSP problem
mTSP
- 多人员行走的路径规划问题模型的求解源代码。可以对应很多模型。非常不错。-more people route planning problem.it is very good
MTSP
- 多旅行商MTSP问题遗传算法应用遗传算法求解多旅行商问题的算法设计,并将其与模拟退火算法比较与结合,有效提高了运算的速度和效率。-Multi traveling salesman MTSP problem genetic algorithm genetic algorithm to solve the problem of multiple traveling salesman problem algorithm design, and it is compared with the simul
mtsP
- 经典的TSP变形问题，可以帮助我们更加快速的学习TSP问题-Classical TSP deformation, can help us learn more quickly TSP problem
MTSP
- matlab的两个函数，可以用于解决多旅行商问题(solve the problem of MTSP)
mtsp问题matlab代码
- 使用ga算法，通过八种评价机制解决多旅行商问题(The GA algorithm is used to solve the multiple traveling salesman problem via eight evaluation mechanisms)
mtsp_ga
- 多旅行商的最短路径选择。80个城市，5个旅行商，距离矩阵部分采用最优算法(Shortest path selection for multiple traveling salesman problem)
YSPSOMTSP
- 用粒子群解多旅行商问题的初版，问题是现在求解的结果并不是最优，不知道问题出在哪里(The first edition of solving traveling salesman problem using particle swarm optimization, solving the problem is now the result is not optimal, don't know where is the problem)
Multiple Traveling Salesmen Problem
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exa
79419092ACO---pso-MTSP-
- ACO-PSO结合的解决TSP问题的一种方法(The ACO-PSO combines a solution to the TSP problem and the algorithm is very reliable.)
5种多旅行商问题(MTSP)的遗传算法
- 基于遗传算法的多旅行商问题，其中有5种情况，均有代码(Multiple travel quotient problem based on genetic algorithm)