Application of Dynamic Programming to Solving K Postmen Chinese Postmen Problem

  • Authors:

  • Rong Fei;Duwu Cui;Yikun Zhang;Chaoxue Wang

  • Affiliations:

  • School of Computer Science and Engineering, Xi'an university of technology, Xi'an, China;School of Computer Science and Engineering, Xi'an university of technology, Xi'an, China;School of Computer Science and Engineering, Xi'an university of technology, Xi'an, China;School of Computer Science and Engineering, Xi'an university of technology, Xi'an, China

  • Venue:
  • ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, Dynamic Programming is used to solve K postmen Chinese postmen problem for the first time. And a novel model for decision- making of KPCPP and the computation models for solving the whole problem are proposed. The arcs of G are changed into the points of G' by CAPA, and the model is converted into another one, which applies to Multistep Decision Process, by MDPMCA. On the base of these two programs, Dynamic Programming algorithm KMPDPA can finally solve the NPC problem-KPCPP. An illustrative example is given to clarify concepts and methods. The accuracy of these algorithms and the relative theories are verified by mathematical language.