Ibrahim, Zuwairie (2005) Application of length-based DNA computing for complex scheduling problem. In: International Conference On Intelligent Computing, He Fei China, 2005, China.
Full text not available from this repository.
This paper discussed the implementation ideas and experimental procedures to solve an engineering related combinatorial problem using DNA computing approach. An elevator scheduling problem is chosen as a benchmark where all the elevator traveled paths are represented by DNA sequence of specific length that represent the elevator’s traveling time in a proportional way based on certain initial conditions such as elevator’s present and destination floors, and hall calls for an elevator from a floor. Parallel overlap assembly method is employed for initial pool generation for a more efficient generation of all possible elevator traveled paths. The initial pool generation solution is then subjected to polymerase chain reaction and gel electrophoresis to extract the required optimal path. Experimental result obtained shows that DNA computing approach can be well-suited for solving such real-world application in the near future. 1
|Item Type:||Conference or Workshop Item (Paper)|
|Subjects:||T Technology > TK Electrical engineering. Electronics Nuclear engineering|
|Deposited By:||Liza Porijo|
|Deposited On:||07 Feb 2017 06:50|
|Last Modified:||07 Feb 2017 06:50|
Repository Staff Only: item control page