火车运邮问题及解法

火车运邮问题及解法 TRAIN MAIL TRANSPORTATION PROBLEM AND SOLUTION 王祖祥 Wang Zuxiang Shen Chengwu Cheng Jianzhen Shen Yun 1 2 3 first-author 沈成武 1 2 3 陈践真 1 2 3 沈云 1 2 3 武汉大学计算中心 武汉大学计算中心 Computer Center of Wuhan Vniversity Computer Center of Wuhan Vniversity 武汉大学数学系 武汉大学数学系 武汉邮政研究所 武汉邮政研究所 本文介绍了火车运邮问题的背景,提出了制定运邮计划的标号算法.该算法从一确定的站出发,采用一个系统的搜索过程来确定该站到其他各站的邮路.在此基础上,提出了车计划的制定方法. In this paper,the background of the problem of train mail transportation plan is given and a label algorithm to obtain the plan is described. The algorthm uses a systematic search process to determine the mail transportation routes from the given station to all others . From this,a method to make the mail transportation plan of a train is suggested. 运邮网络 运邮计划 算法 有向图 mail transportation network mail transportation plan algorithm directed graph O117.9;O221.2 1993-05-01 2021-04-01 5