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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The Macmillan Press LTD, London, England (1976)
Bellman, R.E, Dreyfus, S.E.: Applied Dynamic Programming. Princeton University Press, Princeton, New Jersey (1962)
Bellman, R.E.: Dynamic Programming. Princeton University Press, Princeton, New Jersey (1957)
Wang, S.: Many Postmen Chinese Postmen Problems, Journal of University of Science and Technology of China (in Chinese), Beijing, China, 4, 454–460 (1995)
Edmonds, J., Johnson, E.L: Enley Tours and the Chinese Postman. Math Programming 5, 88–124 (1973)
Even, S.: Graph Algorithms. Computer Science Press, Beijing, China (1979)
Koh, K.M., The, H.H.: On Directed PostMan Problem. Nanyang University Journal, VIII&IX, 14–25 (1974/75)
Papadimition, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Printice-Hall, New Jersey: U.S.A (1982)
Goldberg, D.E.: Genetic Algorithms in Optimization, and Machine Learning. Addison-Wesley, New York, U.S.A (1989)
Wang, S.T.: Fuzzy Heuristic Search Algorithm FDA* For Fuzzy Multi-stage Decision Problems, Journal of Computer Research and Development (in Chinese), Beijing, China, 35(7), 652–656 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fei, R., Cui, D., Zhang, Y., Wang, C. (2007). Application of Dynamic Programming to Solving K Postmen Chinese Postmen Problem. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2007. Lecture Notes in Computer Science(), vol 4682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74205-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-74205-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74201-2
Online ISBN: 978-3-540-74205-0
eBook Packages: Computer ScienceComputer Science (R0)