1) Matrix Type
矩阵式旅行商问题
1.
The Optimal Solution to the Matrix Type of TSP;
矩阵式旅行商问题的最优解
2) 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的混合型蚁群算法求解旅行商问题
3) 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.
提出了循环排序中６种不同的随机抽样方式，对旅行商问题（ＴＳＰ）的模拟退火求解进行了进一步深入研究。
4) TSP
旅行商问题
1.
Application Research for TSP Based on Neural Network-Ant Colony Algorithm;
蚁群神经网络在旅行商问题中的应用
2.
Improved Genetic Algorithms for TSP;
旅行商问题(TSP)的改进遗传算法
3.
An improved Simulated Annealing Algorithm to TSP;
旅行商问题(TSP)的改进模拟退火算法
5) travelling salesman problem(TSP)
旅行商问题
1.
Aimed at many fields combinational optimization problems being transformed into travelling salesman problem(TSP),a complex particle swarm optimization(CPSO) algorithm was put forward to solve TSP.
针对众多领域的组合优化问题可转化为旅行商问题(TSP),提出求解TSP的粒子群复形(CPSO)算法。
2.
The operation of the genetic algorithm of Travelling Salesman Problem(TSP) needs lots of time and it is easy to fall into the local optimal solution.
针对旅行商问题(Travelling Salesman Problem,TSP)的遗传算法的大规模操作,需要大量运算时间而且容易造成局部最优解,提出一种并行混合遗传算法。
3.
When the method of antibody distilling and injecting used in Travelling Salesman Problem(TSP) were presented,the convergence of AIGA was proven theoretically.
结合旅行商问题(TSP),给出了示范抗体的提取和注射方法,并给出了算法收敛性的理论证明。
6) traveling salesman problem(TSP)
旅行商问题
1.
On this basis,a new network was proposed to solve traveling salesman problem(TSP) by decaying self-feedback.
在此基础上,通过衰减自反馈,提出了求解旅行商问题(Traveling Salesman Problem,TSP)的新网络。
2.
To increase the convergence speed of the genetic algorithm in solving the traveling salesman problem(TSP),combined with adaptive operators and competitive strategy between parents and their children,an adaptive genetic algorithm based on the regional search is proposed.
为了提高用遗传算法求解旅行商问题(TSP)的收敛速度,结合自适应算子和父子竞争策略等优化思想,提出了基于分区搜索的自适应遗传算法。
3.
This paper proposed a full set of evolutionary strategies that include new method of encoding of chromosomes,invert,rotate and swap operations,for solving traveling salesman problem(TSP)by genetic algorithm(GA)The strategies are different from those commonly used in GA except the invert operation.
本文提出用遗传算法（ＧＡ）求解旅行商问题（ＴＳＰ）的一整套进化策略，包括染色体的编码、反向运算、循环运算、交换运算。
补充资料：矩阵表示问题
矩阵表示问题
representation of matrices, problem of
或Problenl of Prese”tation of matrices;npe及cTa.”-MocT“M盯p“”nPo6几eMa] 是否能够提出一个统一的一般方法(一个算法(al-即巧山m”，对于任意一组整数上的矩阵U，U，，…，U;来说，在有限步骤内，给出矩阵U能否由矩阵U，，‘·’，U，用乘法表示出来的答案.在U，U;，‘二，U。都是同阶方阵的情形最令人感兴趣.矩阵表示问题的这种陈述方式称为一般的(general).固定矩阵。，，…，u;而使矩阵u变动就得到琴呼寿那妙邵分j可题(part诫Pmbkm of presentation of tnatrices).解出一般陈述的算法也解出了所有部分问题，因为要证实一般陈述的不可解只需提出至少一个不可解的部分问题即可. 矩阵表现问题是代数特征的第一算法问题(见算法问题(司即石仇面c Prob1On”之一，它的不可解性已被证实、最早是A A.MaPK曲证明了对于n》6，可以构造一个含有91个n阶矩阵的系统，使得相应的部分问题不可解，即没有算法(在这个词的确切意义下)来辨别任意一个n阶矩阵是否可以由这一系统来表示(见[11，f21).后来(见t3])这一系统中矩阵的个数被减少到23个，并且证明了，在这个系统的构造里适当地复杂化，条件”)6可以减弱到n)4.对于任意n)6来说，可以构造一个具体的系统，包含12个n阶矩阵，具有不可解的部分问题(见[4])·适当地固定U并且变动U，，…，U。，一般陈述的不可解性已对n二3被证明(见【5」).
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条