1) Directed Postman Problem
有向图的邮递员问题
2) postman problem/capacitated arc routing problem
邮递员问题/有容约束弧路由问题
3) Chinese postman problem
中国邮递员问题
1.
A Thinking of Solving the Chinese Postman Problem;
求解中国邮递员问题的一种思路
2.
A new DNA encoding scheme to represent weights on a weighted graph is devised in this paper and a corresponding DNA algorithm for the Chinese postman problem is proposed using the encoding scheme.
设计了一种新的用于表示赋权图中边权的DNA编码方案,给出了用该方案求解中国邮递员问题的DNA算法,并利用Markov链分析了DNA算法中生成各种路径的随机过程。
3.
Based on the knowledge of the retail point could be taken as the route passing by the retail point in tobacco distribution network, the tobacco route optimization problem was transformed to Chinese Postman Problem in a network Map.
为解决烟草配送路线不合理的问题,根据烟草配送的特点建立烟草配送路径优化模型,基于配送所要到达的零售网点与配送必须经过其所在的道路等同的认识,把烟草配送路径优化问题转化为网络图中的中国邮递员问题,并利用Floyd算法求解烟草配送最短路径。
4) directed postmen problem
有向邮路问题
1.
This paper solves the directed postmen problem by genetic algorithms on the basis of transformation of graph.
在图形变换的基础上，用遗传算法实现了对有向邮路问题的求解本文所提方法较之传统方法更易于编程实现和求解大规模复杂网络问题实例表明，本方法能很好地收敛到有向邮路网络传统算法的结果
5) the mixed Chinese postman problem
混合中国邮递员问题
6) windy postman problem
带风向投递员问题
1.
The two problems are as follows: One is 2WPP, which is got by restricting the postman to traverse each edge no more than twice in the case of the windy postman problem; the other is the maximum weighted cycle packing problem on windy graphs.
这两个问题是：一是叫２ＷＰＰ，它是由带风向投递员问题限制投递员穿过每条边至多两次而得到的问题；另一问题是风向图上最大权圈装箱问
补充资料：邮递
1.传舍，驿站。 2.邮寄，由邮局递送。 3.邮寄的书信。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条