Skip to main content
SpringerLink
Log in

DNA Computing for Complex Scheduling Problem

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3611))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024 (1994)

    Article  Google Scholar 

  2. Adleman, L.M.: Computing with DNA. Scientific American, 34–41 (1998)

    Google Scholar 

  3. Narayanan, A., Zorbalas, S.: DNA Algorithms for Computing Shortest Paths. In: Proceedings of Genetic Programming, pp. 718–723 (1998)

    Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. 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)

    Google Scholar 

  7. Fitch, J.P.: Engineering Introduction to Biotechnology. SPIE Press (2001)

    Google Scholar 

  8. Zucca, M.: DNA Based Computational Models. PhD Thesis, Politecnico Di Torino, Italy (2000)

    Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. 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)

    Article  Google Scholar 

  11. 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)

    Google Scholar 

  12. 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)

    Chapter  Google Scholar 

  13. Amos, M.: DNA Computation. PhD Thesis, The University of Warwick, UK (1997)

    Google Scholar 

  14. 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)

    Article  MATH  Google Scholar 

  15. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied DNA Computing, Meiji University, 1-1-1 Higashi-Mita, Tama-Ku, Kawasaki-Shi, Kanagawa-Ken, 214-8571, Japan

    Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ueda, Osamu Ono & Marzuki Khalid

Authors
  1. Mohd Saufee Muhammad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zuwairie Ibrahim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Satomi Ueda
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Osamu Ono
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Marzuki Khalid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

  2. School of Software, Sun Yat-Sen University, 510275, Guangzhou, China

    Ke Chen

  3. School of Computer Engineering, Nanyang Technological University, BLK N4, 2b-39, Nanyang Avenue, 639798, Singapore

    Yew Soon Ong

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation