Experimental implementation of direct-proportional length-based DNA computing for elevator scheduling problem
Previously, ideas and implementation methods for solving elevator scheduling problem using DNA computing method had been proposed. In this paper, results of biochemical experiments that have been carried out to realize the computing approach are presented. Every possible elevators travel path combin...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2005
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/1859/1/saufee05_implementation_of_direct_propotional.pdf http://eprints.utm.my/id/eprint/1859/ https://books.google.com.my/books/about/ICMT_2005.html?id=qj0UDAEACAAJ&redir_esc=y |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.utm.1859 |
---|---|
record_format |
eprints |
spelling |
my.utm.18592017-08-28T00:11:02Z http://eprints.utm.my/id/eprint/1859/ Experimental implementation of direct-proportional length-based DNA computing for elevator scheduling problem Muhammad, Mohd. Saufee Ibrahim, Zuwairie Ueda, Satomi Ono, Osamu Khalid, Marzuki TK Electrical engineering. Electronics Nuclear engineering Previously, ideas and implementation methods for solving elevator scheduling problem using DNA computing method had been proposed. In this paper, results of biochemical experiments that have been carried out to realize the computing approach are presented. Every possible elevators travel path combinations are encoded by DNA sequences of length directly proportional to the elevator’s 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 an efficient initial pool generation of all possible travel path combinations and polymerase chain reaction for sequence amplification. Finally, gel electrophoresis is performed to separate the DNA sequence according to its length, and the shortest DNA sequence representing the elevator’s optimal path can thus be visualized from the gel electrophoresis image. The experimental result shows that the DNA computing approach can be wellsuited for solving such real-world problem of this type of nature. 2005-12-04 Conference or Workshop Item PeerReviewed application/pdf en http://eprints.utm.my/id/eprint/1859/1/saufee05_implementation_of_direct_propotional.pdf Muhammad, Mohd. Saufee and Ibrahim, Zuwairie and Ueda, Satomi and Ono, Osamu and Khalid, Marzuki (2005) Experimental implementation of direct-proportional length-based DNA computing for elevator scheduling problem. In: Proceeding of the 9th International Conference on Mechatronics Technology, 5-8 December 2005, Kuala Lumpur. https://books.google.com.my/books/about/ICMT_2005.html?id=qj0UDAEACAAJ&redir_esc=y |
institution |
Universiti Teknologi Malaysia |
building |
UTM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Teknologi Malaysia |
content_source |
UTM Institutional Repository |
url_provider |
http://eprints.utm.my/ |
language |
English |
topic |
TK Electrical engineering. Electronics Nuclear engineering |
spellingShingle |
TK Electrical engineering. Electronics Nuclear engineering Muhammad, Mohd. Saufee Ibrahim, Zuwairie Ueda, Satomi Ono, Osamu Khalid, Marzuki Experimental implementation of direct-proportional length-based DNA computing for elevator scheduling problem |
description |
Previously, ideas and implementation methods for solving elevator scheduling problem using DNA computing method had been proposed. In this paper, results of biochemical experiments that have been carried out to realize the computing approach are presented. Every possible elevators travel path combinations are encoded by DNA sequences of length directly proportional to the elevator’s 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 an efficient initial pool generation of all possible travel path combinations and polymerase chain reaction for sequence amplification. Finally, gel electrophoresis is performed to separate the DNA sequence according to its length, and the shortest DNA sequence representing the elevator’s optimal path can thus be visualized from the gel electrophoresis image. The experimental result shows that the DNA computing approach can be wellsuited for solving such real-world problem of this type of nature. |
format |
Conference or Workshop Item |
author |
Muhammad, Mohd. Saufee Ibrahim, Zuwairie Ueda, Satomi Ono, Osamu Khalid, Marzuki |
author_facet |
Muhammad, Mohd. Saufee Ibrahim, Zuwairie Ueda, Satomi Ono, Osamu Khalid, Marzuki |
author_sort |
Muhammad, Mohd. Saufee |
title |
Experimental implementation of direct-proportional length-based DNA computing for elevator scheduling problem |
title_short |
Experimental implementation of direct-proportional length-based DNA computing for elevator scheduling problem |
title_full |
Experimental implementation of direct-proportional length-based DNA computing for elevator scheduling problem |
title_fullStr |
Experimental implementation of direct-proportional length-based DNA computing for elevator scheduling problem |
title_full_unstemmed |
Experimental implementation of direct-proportional length-based DNA computing for elevator scheduling problem |
title_sort |
experimental implementation of direct-proportional length-based dna computing for elevator scheduling problem |
publishDate |
2005 |
url |
http://eprints.utm.my/id/eprint/1859/1/saufee05_implementation_of_direct_propotional.pdf http://eprints.utm.my/id/eprint/1859/ https://books.google.com.my/books/about/ICMT_2005.html?id=qj0UDAEACAAJ&redir_esc=y |
_version_ |
1643643435148640256 |
score |
13.15806 |