Direct-proportional length-based DNA computing implementation for elevator scheduling problem
Implementation and experimental procedures to solve an elevator scheduling problem using direct-proportional length-based DNA computing approach are presented in this paper. All possible travel path combinations of the elevators are encoded by oligonucleotides of length directly proportional to the...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/7372/ |
| _version_ | 1848891456012419072 |
|---|---|
| author | Muhammad, Mohd. Saufee Ibrahim, Zuwairie Ono, Osamu Khalid, Marzuki |
| author_facet | Muhammad, Mohd. Saufee Ibrahim, Zuwairie Ono, Osamu Khalid, Marzuki |
| author_sort | Muhammad, Mohd. Saufee |
| building | UTeM Institutional Repository |
| collection | Online Access |
| description | Implementation and experimental procedures to solve an elevator scheduling problem using direct-proportional length-based DNA computing approach are presented in this paper. All possible travel path combinations of the elevators are encoded by oligonucleotides of length directly proportional to the elevators traveling time based on certain initial conditions such as elevators 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 all the generated travel paths by its oligonucleotides lengths. The gel electrophoresis image is then captured to visualize the required optimal path. Experimental result shows that DNA computing approach can be well-suited for solving such real-world problem of this type of nature |
| first_indexed | 2025-11-15T20:58:15Z |
| format | Conference or Workshop Item |
| id | utm-7372 |
| institution | Universiti Teknologi Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T20:58:15Z |
| publishDate | 2007 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utm-73722017-08-08T08:36:07Z http://eprints.utm.my/7372/ Direct-proportional length-based DNA computing implementation for elevator scheduling problem Muhammad, Mohd. Saufee Ibrahim, Zuwairie Ono, Osamu Khalid, Marzuki QA75 Electronic computers. Computer science Implementation and experimental procedures to solve an elevator scheduling problem using direct-proportional length-based DNA computing approach are presented in this paper. All possible travel path combinations of the elevators are encoded by oligonucleotides of length directly proportional to the elevators traveling time based on certain initial conditions such as elevators 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 all the generated travel paths by its oligonucleotides lengths. The gel electrophoresis image is then captured to visualize the required optimal path. Experimental result shows that DNA computing approach can be well-suited for solving such real-world problem of this type of nature 2007 Conference or Workshop Item PeerReviewed Muhammad, Mohd. Saufee and Ibrahim, Zuwairie and Ono, Osamu and Khalid, Marzuki (2007) Direct-proportional length-based DNA computing implementation for elevator scheduling problem. In: TENCON 2005 2005 IEEE Region 10, 21-24 Nov. 2005 , Kanagawa,Jepun. |
| spellingShingle | QA75 Electronic computers. Computer science Muhammad, Mohd. Saufee Ibrahim, Zuwairie Ono, Osamu Khalid, Marzuki Direct-proportional length-based DNA computing implementation for elevator scheduling problem |
| title | Direct-proportional length-based DNA computing implementation for elevator scheduling problem |
| title_full | Direct-proportional length-based DNA computing implementation for elevator scheduling problem |
| title_fullStr | Direct-proportional length-based DNA computing implementation for elevator scheduling problem |
| title_full_unstemmed | Direct-proportional length-based DNA computing implementation for elevator scheduling problem |
| title_short | Direct-proportional length-based DNA computing implementation for elevator scheduling problem |
| title_sort | direct-proportional length-based dna computing implementation for elevator scheduling problem |
| topic | QA75 Electronic computers. Computer science |
| url | http://eprints.utm.my/7372/ |