Abstract
A linear programming problem is solved for the first time based on DNA computing model, which has important significance for research on DNA computing. According to feature of the mathematical model of traffic network transportation optimization problem (TNTOP), three groups of replaceable encoding for each basic variable are designed in the algorithm as follows: basic variable group; variable value group and c value group, which stores the information of basic variable and its value and has many groups replaceable foreign DNA corresponding to the basic variable. In the algorithm of TNTOP based on replaceable encoding for basic variable, combination operation which is used can assign or re-assign values to variables, which is composed of group insert experiment, gel electrophoresis experiment and group deleting experiment. The combination operation can test the constraint conditions and extract all optimal solutions of TNTOP. Detection experiment designed based on electrophoresis experiment can detect mixture containing many kinds of closed circle DNA sequence, and can detect out all closed circle DNA sequences or one closed circle DNA sequence of the mixture according to requirement of the algorithm. The correctness and the complexity of the DNA algorithm are proved, and a simulation example is given to explain feasibility of the DNA algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Kang Z, Jin X (2006) Closed circle DNA algorithm of the minimal covering problem. Comput Eng Appl 20:7–9
Kang Z, Shuo L, Lei Q et a1. (2011) The study of plasmid DNA computing model. J HuaZhong Univ Sci Technol (Nat Sci) 2:32–35
Kang Z, Zhi X, Chanjia W et a1. (2010) Closed circle DNA algorithm of set covering problem. J HuaZhong Univ Sci Technol (Nat Sci) 2:21–25
Kang Z, Lei Q, Xiaojun T et al (2009) Closed circle DNA algorithm of 0–1 planning problem. Syst Eng Electron 4:947–951
Kang Z, Xiaojun T, Jin X (2009) Closed circle DNA algorithm of change positive- weighted Hamilton circuit problem. J Syst Eng Electron 3:636–642
Kang Z, Chuanjia W, Shuo L et a1. (2009) Closed circle DNA algorithm for SAT problem. Huazhong Keji Daxue Xuebao (Ziran Kexue Ban) 7:75–78
Acknowledgments
The work is supported by the National Natural Science Foundation of China (61179032), and by Natural Science Foundation of Hubei Province of China (2011CDB229), and by Science and Technology Research Project of Hubei Provincial Department of Education (D20111702), and by Science and Technology Research and Development Project of Ministry of Housing and Urban–Rural Development of the People’s Republic of China (2012-K5-9), and by Construction Science and Technology Plan Project of of Hubei Provincial Department of Reconstruction(2011-29).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, K., Zhu, Y., Jin, F., Tao, X. (2013). Replaceable Encoding for Basic Variable of Traffic Network Transportation Optimization Problem. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-37502-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37501-9
Online ISBN: 978-3-642-37502-6
eBook Packages: EngineeringEngineering (R0)