期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2006
卷号：6
期号：6
页码：78-84
出版社：International Journal of Computer Science and Network Security
摘要：We present a design and implementation method to solve an elevator scheduling problem using DNA computing in this research. DNA sequences of length directly proportional to the elevator’s traveling time are encoded to represent all possible travel path combinations based on certain initial conditions such as present and destination floors, and hall calls from a floor. Parallel overlap assembly is employed for initial pool generation and polymerase chain reaction for amplification. Gel electrophoresis is then performed to separate the sequences according to its length and its image is captured to visualize the optimal path. Experimental result obtained verifies that this approach can be well-suited to solve such real-world problem of this nature.
关键词：Elevator scheduling problem, DNA computing, gel electrophoresis, optimal path
