硕士论文时间依赖网络中国邮路问题的分支限界算法

大连理工大学

硕士学位论文

时间依赖网络中国邮路问题的分支限界算法

姓名：吕凯

申请学位级别：硕士

专业：计算机软件与理论

导教师：谭国真

20081217

Branch and Bound Algorithm for the Time Dependent Chinese Postman

Problem

Abstract

Chinese postman problem is a classic graphic problem, it is widely applied by fields such as software tested, mail delivered. Time dependent Chinese postman problem is extend of the Chinese postman problem, it consider the time and have more advantage than Chinese in problem with time factor, such as real time software test.

We introduce the classification, the study situation and application of the Chinese postman problem in the classic static networks; then we analyze the disadvantages of the classic Chinese postman problem, and then the advantages of the Chinese postman problem in time varying environment compare to the classic Chinese postman problem, and the study situation，difficulty and meaning of the Chinese postman problem in time varying environment; make base for future study. In this paper:

(1)Give the reason why traditional methods unuseful: the varying cost of edge. We give an example that can't be used in time varying environment to understand it more clearly.

(2)Propose several characteristic and branch-bound algorithms for time dependent Chinese postman problem (TDCPP). we propose several theories that can be applied to the time varying environment for directed and undirected networks, prove it to confirm the correction, branch and bound algorithms based on these properties are designed.

(3)Particularly, for the FIFO (first in first out) time varying network, we also give special characteristic to improve the algorithm. The FIFO cut-condition can be used for more effective branch and bound algorithm.

(4)Test and analyze the algorithm. We construct the tree of solution space to understand the problem; then, we list the results of the algorithms by table, and analyze the algorithms further on base of the results.

In this paper, we solve the TDCPP by branch-bound algorithm for the first time. The problem became very difficult when consider the time factor. By the result, we found that, our algorithm is useful for simple TDCPP.

Key Words： Time varying network; Chinese postman; Branch and bound; FIFO; Euler graph

大连理工大学学位论文独创性声明

作者郑重声明：所呈交的学位论文，是本人在导师的指导下进行研究 工作所取得的成果。尽我所知，除文中已经注明引用内容和致谢的地方外， 本论文不包含其他个人或集体已经发表的研究成果，也不包含其他巳申请 学位或其他用途使用过的成果。与我一同工作的同志对本研究所做的贡献 均已在论文中做了明确的说明并表示了谢意。

若有不实之处，本人愿意承担相关法律责任。

时间依赖网络中国邮路问题的分支限界算法 日期：年/工月曰

学位论文题目： 作者签

名：i