1) shortest Hamilton cycle
最短哈密顿回路
2) Directed shortest Hamilton path
有向哈密尔顿最短路
3) Hamilton cycle
哈密顿回路
1.
A genetic algorithm for getting all Hamilton cycles of any graph;
用“遗传”算法求任意图的所有哈密顿回路
2.
Algorithm of cycle and recursion by every vertex for getting Hamilton cycle;
逐点循环递归法求哈密顿回路
4) Hamiltonian circuit
哈密顿回路
1.
The present paper puts forward the concepts about L sets, L matrices, joining products and path matrices, and also gives out some theorems for judging the existence of the Hamiltonian circuit based on these concepts.
给出L集合、L矩阵、连接积和通路矩阵的概念及基于这些概念的一些哈密顿回路的存在性判定定理和通过构造通路矩阵序列Mk=Mk－1*M（k=2，。
2.
The definitions of Hamiltonian circuit,subloop and family of cycles are given first,then a solving process and a necessary condition about Hamiltonian circuit are discussed.
首先给出哈密顿回路的定义以及子圈和圈族的定义，然后讨论了哈密顿回路的一个求解方法和一个必要条件。
5) Hamilton circuit
哈密顿回路
1.
This paper purposes a new DNA algorithm of the Hamilton circuit problem based surface by using the method of fluorescence labeling.
论文采用荧光标记的策略,给出了一种新的哈密顿回路问题的DNA表面计算模型。
2.
The relationship between the Hamilton circuit and the Traveling Salesman Problem is discussed.
讨论了旅行售货员问题和图论中的哈密顿回路之间的关系,在此基础上结合图论中关于完全图最短路径的近似算法得到旅行售货员问题的一种近似算法。
6) Hamilton loop
哈密尔顿回路
1.
The first step was to divide the task into two parts in statistical means,the second step was to apply the existing approximate algorithm in solving TSP problem to get two Hamilton loops,and finally the dynamic programming method was used to optimize the network in Hamilton loops to get optimized task planning sequence.
用统计方法对凿岩机器人两机械臂进行任务划分,以机械臂完成离散随机任务的最短空间移动距离为优化目标函数,将任务合作规划简化为一个具有三角属性的双TSP问题的组合;用解决TSP问题的近似算法求解得到两机械臂任务规划的哈密尔顿回路;针对哈密尔顿回路中的交叉网络采用动态规划的方法进行合理优化,从而得到凿岩机器人的较优任务规划序列。
2.
The first step is dividing the task into two parts in statistical means,the second step is applying the existing approximate algorithm to get two Hamilton loops,and finally the dynamic programming method is used to optimize the network in Hamilton loops.
对于基于个体的双机械手离散、随机合作任务规划问题,先以各任务间的最短移动距离(时间)为优化函数,将其简化为一个具有三角属性的双TSP问题的组合来研究,用统计方法进行单机械手任务划分,再用解决TSP问题的近似算法求解得到两个机械手任务规划的哈密尔顿回路。
