Abstract
The Chinese postman problem is a classic resource allocation and scheduling problem, which has been widely used in practice. As a classical nondeterministic polynomial problem, finding its efficient algorithm has always been the research direction of scholars. In this paper, a new bioinspired algorithm is proposed to solve the Chinese postman problem based on molecular computation, which has the advantages of high computational efficiency, large storage capacity, and strong parallel computing ability. In the calculation, DNA chain is used to properly represent the vertex, edge, and corresponding weight, and then all possible path combinations are effectively generated through biochemical reactions. The feasible solution space is obtained by deleting the nonfeasible solution chains, and the optimal solution is solved by algorithm. Then the computational complexity and feasibility of the DNA algorithm are proved. By comparison, it is found that the computational complexity of the DNA algorithm is significantly better than that of previous algorithms. The correctness of the algorithm is verified by simulation experiments. With the maturity of biological operation technology, this algorithm has a broad application space in solving large-scale combinatorial optimization problems.
Highlights
Background eChinese postman problem (CPP) was first raised by Guan Meigu [1] in the 1960s, and it was based on the question of “how should a postman choose a route so that he can walk all the streets where he is responsible for delivering the letter and the shortest distance traveled?” It arises in numerous applications in many fields, such as municipal solid waste collection [2], winter gritting [3], material distribution and transportation [4], and intelligent transportation [5]
An algorithm based on the Adleman–Lipton model is proposed to solve the Chinese postman problem
DNA algorithm has the advantages of simple interpretation, simple coding, and high precision
Summary
With the rise and development of molecular biology, the structure and function of biomacromolecules have been. Rough different operation and control technologies for DNA molecules, new algorithms can be formed to provide strong technical support for many problems without effective solutions [26,27,28,29,30,31,32,33,34,35,36,37,38,39]. In the Adleman–Lipton model, for given test tubes (experimental test tubes) which contain a finite number of DNA strands consisting of A, G, C, and T, we can perform the following operations:. E assumption has been used in previous studies to analyze the complexity of DNA computing [41,42,43,44,45,46] We use these operations to implement algorithms to solve the Chinese postman problem
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
