Abstract
In the paper, an algorithm based on DNA computing which can solve the elevator scheduling problem is improved. Considering the inefficiency of the existing algorithm caused by the large scale of the initial solution space, the author introduces a new conception –"connecting strand" to help produce the initial solution space in the new algorithm. “Connecting strand” can connect those rational DNA strands encoding different elevators’ running routes into one and the strand obtained just stands for the “sum-route” of the elevator system. With the help of “connecting strand”, the size of initial solution space is largely reduced and the performance of the algorithm is thus improved. In the end, the author proves the effectiveness of the algorithm by a simulation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024 (1994)
Lipton, R.J.: DNA Solution of Hard Computational Problems. Science 268, 542–545 (1995)
Ouyang, Q., Kaplan, P.D., Liu, S., et al.: DNA Solution of the Maximal Clique Problem. Science 278, 446–449 (1997)
Sakamoto, K., Gouzu, H., Komiya, K., et al.: Molecular Computation by DNA Hairpin Formation. Science 288, 1223–1226 (2000)
Muhanmmad, M.S., Ueda, S., Watada, J., et al.: Solving Elevator Scheduling Problem Using DNA Computing Approach. Advances in Soft Computing 29, 359–370 (2005)
Watada, J.: DNA Computing and Its Applications. Studies in Computational Intelligence 115, 1065–1089 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, HC., Liu, XY. (2013). An Improved DNA Computing Method for Elevator Scheduling Problem. In: Zu, Q., Hu, B., Elçi, A. (eds) Pervasive Computing and the Networked World. ICPCA/SWS 2012. Lecture Notes in Computer Science, vol 7719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37015-1_76
Download citation
DOI: https://doi.org/10.1007/978-3-642-37015-1_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37014-4
Online ISBN: 978-3-642-37015-1
eBook Packages: Computer ScienceComputer Science (R0)