Ibrahim, Zuwairie (2005) Application of lengthbased DNA computing for complex scheduling problem. In: International Conference On Intelligent Computing, He Fei China, 2005, China.

PDF
126kB 
Abstract
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 wellsuited for solving such realworld application in the near future. 1
Item Type:  Conference or Workshop Item (Paper) 

Subjects:  T Technology > TK Electrical engineering. Electronics Nuclear engineering 
Divisions:  Electrical Engineering 
ID Code:  21321 
Deposited By:  Liza Porijo 
Last Modified:  19 Jan 2012 08:54 
Repository Staff Only: item control page