摘要
This paper provides a branch-and-bound algorithm for seeking the best touring-path. Using the reduction method, this algorithm found cost low-limits of a set of the paths. As a branch-node, the live node having minimum low-limit has been expanded and a state space tree has been generated. The best touring-path has been found. Moreover, combining algorithm with data structure, the author studied many details about this problem, and gave its computer implementation.
This paper provides a branch-and-bound algorithm for seeking the best touring-path. Using the reduction method, this algorithm found cost low-limits of a set of the paths. As a branch-node, the live node having minimum low-limit has been expanded and a state space tree has been generated. The best touring-path has been found. Moreover, combining algorithm with data structure, the author studied many details about this problem, and gave its computer implementation.
