Abstract
DNA computing approach has gained wide interest in recent years since Adleman shows that the technique can be used to solve the Hamiltonian Path Problem (HPP). Since then there has been many research results showing how DNA computing is used to solve a variety of similar combinatorial problems which is mainly in the realm of computer science. However, the application of DNA computing in solving engineering related problems has not been well established. In this paper we demonstrate how DNA computing can be used to solve a two-elevator scheduling problem for a six-storey building. The research involves finding a suitable technique to represent the DNA sequences in finding the optimal route for each elevator based on initial conditions such as the present position of the elevator, the destination of passengers in the elevators and hall calls from a floor. The approach shows that the 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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.: Molecular Computation of Solutions to Combinatorial Problems. Science, Vol. 266 (1994) 1021–1024
Adleman, L.M.: Computing with DNA. Scientific American (1998) 34–41
Lipton R.: Speeding up Computations via Molecular Biology. In DIMACS Series, Vol. 27 (1996) 67–74.
Reif, J.H.: Parallel Biomolecular Computation: Models and Simulations. Proceedings of 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA’95) 213–223.
Reif, J.H., LaBean, T. H.,: Computationally Inspired Biotechnologies: Improved DNA Synthesis and Associative Search Using Error-Correcting Codes and Vector-Quantization, Lecture Notes in Computer Science, Springer-Verlag, Vol. 2054 (2001) 145–172
Bancroft, F.C.: Hiding messages in DNA microdots, Nature, (1999) Vol. 399 533–534
Kojima, S., Watada, J., Ueda, S., Ono, O.: Optimal Group Control of Elevators based on DNA Computing. Proceeding of FIC2004 (2004) 156–161
Narayanan, A., Zorbalas, S.: DNA Algorithms for Computing Shortest Paths. Proceedings of Genetic Programming, (1998) 718–723
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, Vol. 2 (2002) 447–455
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. Lecture Notes in Computer Science, Springer-Verlag, Vol. 2568 (2003) 73–84
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, Vol. 1, Issue 1 (2004) 46–60
Udo, F., Sam, S., Wolfgang, B., Hilmar, R.: DNASequenceGenerator: A Program for the Construction of DNA Sequences. Proceedings of the Seventh International Workshop on DNA Based Computers (2001) 23–32
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., Ueda, S., Ono, O., Watada, J., Khalid, M. (2005). Solving Elevator Scheduling Problem Using DNA Computing Approach. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_43
Download citation
DOI: https://doi.org/10.1007/3-540-32391-0_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25055-5
Online ISBN: 978-3-540-32391-4
eBook Packages: EngineeringEngineering (R0)