Abstract
The probe machine model is a new computational model. Its computation depends only on DNA molecules, and it is a parallel computing model from the bottom. Its data placement is nonlinear and combined with the parallelism of biochemical reactions, which greatly improves the effective computing power of the model. The Chinese postman problem is a NP complete problem in combinatorial optimization. In this paper, we will try to solve this problem by using the probe machine model, so as to improve the effectiveness of the problem computation. The postman problem is corresponded to a connected graph G. According to the vertex construct data cell and connection probe, and put it into the computing platform. After the calculation, the solution of the problem is detected by the detector. It is the smallest weight sum of the generalized Euler closure. This model shows the superiority and versatility of the probe machine model compared with other computing models.
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
References
Xu, J.: Probe machine. IEEE Trans. Neural Netw. Learn. Syst. 27(7), 1405–1416 (2016)
Turing, A.M.: On computable numbers, with an application to the entscheidungsproblem. A correction. In: Alan Turing His Work and Impact, s2-42(1), pp. 13–115 (2013)
Guan, M.G.: Operation method of odd even point diagram. J. Math. 10(3), 263–266 (1960)
Guan, M.G.: A historical review for the research and development of Chinese postmen. J. Oper. Res. 19(3), 1–7 (2015)
Edmonds, J.: The Chinese postman problem. Oper. Res. 13(Suppl.), 1–73 (1965)
Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part 1: the Chinese postman problem. Oper. Res. 43, 231–242 (1965)
Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part 2: the rural postman problem. Oper. Res. 43, 399–414 (1965)
Stricker, R.: Public sector vehicle routing: the Chinese postman problem. Massachusetts Institute of Technology (1970)
Gordenko, M.K., Avdoshin, S.M.: The mixed Chinese postman problem. Tpyды ИCП PAH 29(4) (2017)
Gutin, G., Jones, M., Sheng, B.: Parameterized complexity of the k-arc Chinese postman problem. J. Comput. Syst. Sci. 84, 107–119 (2017)
Gutin, G., Jones, M., Sheng, B.: Parameterized complexity of the k-arc Chinese postman problem. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 530–541. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44777-2_44
Han, A.L., Zhu, D.M.: DNA computing model based on a new scheme of encoding weight for Chinese postman problem. J. Comput. Res. Dev. 44(6), 1053–1062 (2007)
Li, W., Wang, L.: DNA calculation of Chinese postman problem. J. Comput. Appl. 29(7), 1880–1883 (2009)
Acknowledgment
This project is supported by National Natural Science Foundation of China (No. 61702008, No. 61672001) and Anhui Provincial Natural Science Foundation (No. 1808085MF193).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Yang, J., Yin, Z., Cui, J., Zhang, Q., Tang, Z. (2018). The Chinese Postman Problem Based on the Probe Machine Model. In: Qiao, J., et al. Bio-inspired Computing: Theories and Applications. BIC-TA 2018. Communications in Computer and Information Science, vol 952. Springer, Singapore. https://doi.org/10.1007/978-981-13-2829-9_6
Download citation
DOI: https://doi.org/10.1007/978-981-13-2829-9_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-2828-2
Online ISBN: 978-981-13-2829-9
eBook Packages: Computer ScienceComputer Science (R0)