1) MTSP
多旅行商问题
1.
Based on real number code,it proposes a hybrid genetic algorithm to optimize the MTSP.
为了得到多旅行商问题的优化路线,提出一种基于实数编码的混合遗传算法。
2) multiple traveling salesman problem
多旅行商问题
1.
Optimization of multiple traveling salesman problem based on hierarchical genetic algorithm
基于递阶遗传算法的一类多旅行商问题优化
2.
Study on multiple traveling salesman problem based on genetic algorithm
基于遗传算法的多旅行商问题研究
3.
Traveling salesman problem is one of the classical problems in Combinatorial Optimization, and the multiple traveling salesman problem(MTSP) is a generalization of the well-known traveling salesman problem(TSP), where more than one salesman is allowed to be used in the solution.
旅行售货商问题(TSP)是组合优化领域的经典问题之一,而考虑多个旅行商的多旅行商问题(MTSP)是经典的旅行商问题的扩展。
3) multiple traveling salesmen problem
多旅行商问题(MTSP)
4) MTSP
多路旅行商问题
1.
： A kind of combinatorial optimization such as MTSP and assign problem are studied.
文章研究了一类组合优化问题如：多路旅行商问题（MTSP）及分配问题。
5) traveling salesman problem
旅行商问题
1.
Improved particle swarm optimization based on k-center and its application in traveling salesman problem;
基于k-中心点法的改进粒子群算法在旅行商问题中的应用
2.
Modified particle swarm optimization algorithm for traveling salesman problem;
改进粒子群优化算法求解旅行商问题
3.
Hybrid approach based on Ant Colony System for solving traveling salesman problem;
基于MATLAB的混合型蚁群算法求解旅行商问题
6) Travelling salesman problem
旅行商问题
1.
Predatory search algorithm based on tabu list and its experimental research on travelling salesman problems;
基于禁忌表的捕食搜索算法及其在旅行商问题中的实验研究
2.
The problem of path planning for coordinated mine clearance operation of multiple autonomous underwater vehicles was formulated as a kind of multiple travelling salesman problem and two models of multiple travelling salesman problem were developed from the mission background information.
将智能水下机器人集群协同清扫水雷的路径规划问题归结为多人旅行商问题,并根据清扫水雷的任务背景提出两种多人旅行商问题模型。
3.
This paper introduces six different random sampling methods for cycling permutations and carries out a further study of solving the travelling salesman problem by simulated annealing.
提出了循环排序中６种不同的随机抽样方式，对旅行商问题（ＴＳＰ）的模拟退火求解进行了进一步深入研究。
补充资料：旅行推销员问题
旅行推销员问题（又称为旅行商问题、tsp问题）是一个多局部最优的最优化问题：有n个城市，一个推销员要从其中某一个城市出发，唯一走遍所有的城市，再回到他出发的城市，求最短的路线。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。