Abstract
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar combinatorial problems which are mainly in the realm of computer science and mathematics have been presented. In this paper, implementation ideas and methods to solve an engineering related combinatorial problem using this DNA computing approach is presented. The objective is to find an optimal path for a complex elevator scheduling problem of an 8-storey building with 3 elevators. Each of the elevator traveled path is represented by DNA sequence of specific length that represent elevator’s traveling time in a proportional way based on certain initial conditions such as present and destination floors, and hall calls for an elevator from a floor. The proposed ideas and methods show promising results that DNA computing approach can be well-suited for solving such real-world application in the near future.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024 (1994)
Adleman, L.M.: Computing with DNA. Scientific American, 34–41 (1998)
Narayanan, A., Zorbalas, S.: DNA Algorithms for Computing Shortest Paths. In: Proceedings of Genetic Programming, pp. 718–723 (1998)
Yamamoto, Y., Kameda, A., Matsuura, N., Shiba, T., Kawazoe, Y., Ahochi, A.: Local Search by Concentration-Controlled DNA Computing. International Journal of Computational Intelligence and Applications 2, 447–455 (2002)
Lee, J.Y., Shin, S.Y., Augh, S.J., Park, T.H., Zhang, B.T.: Temperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 73–84. Springer, Heidelberg (2003)
Ibrahim, Z., Tsuboi, Y., Ono, O., Khalid, M.: Direct-Proportional Length-Based DNA Computing for Shortest Path Problem. International Journal of Computer Science and Applications 1(1), 46–60 (2004)
Fitch, J.P.: Engineering Introduction to Biotechnology. SPIE Press (2001)
Zucca, M.: DNA Based Computational Models. PhD Thesis, Politecnico Di Torino, Italy (2000)
Stemmer, W.P.: DNA Shuffling by Random Fragmentation and Reassembly: In Vitro Recombination for Molecular Evolution. Proc. Natl. Acad. Sci. U.S.A. 91, 10747–10751 (1994)
Kaplan, P.D., Ouyang, Q., Thaler, D.S., Libchaber, A.: Parallel Overlap Assembly for the Construction of Computational DNA Libraries. Journal of Theoretical Biology 188(3), 333–341 (1997)
Lee, J.Y., Lim, H.W., Yoo, S.I., Zhang, B.T., Park, T.H.: Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly. In: Preliminary Proceeding of the 10th International Meeting on DNA Computing, pp. 357–364 (2004)
Paun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 106–118. Springer, Heidelberg (1999)
Amos, M.: DNA Computation. PhD Thesis, The University of Warwick, UK (1997)
Yamamoto, Y., Kameda, A., Matsuura, N., Shiba, T., Kawazoe, Y., Ahochi, A.: A Separation Method for DNA Computing Based on Concentration Control. New Generation Computing 20(3), 251–262 (2002)
Udo, F., Sam, S., Wolfgang, B., Hilmar, R.: DNASequenceGenerator: A Program for the Construction of DNA Sequences. In: Proceedings of the Seventh International Workshop on DNA Based Computers, pp. 23–32 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muhammad, M.S., Ibrahim, Z., Ueda, S., Ono, O., Khalid, M. (2005). DNA Computing for Complex Scheduling Problem. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539117_159
Download citation
DOI: https://doi.org/10.1007/11539117_159
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28325-6
Online ISBN: 978-3-540-31858-3
eBook Packages: Computer ScienceComputer Science (R0)