### Abstract

DNA computing approach has gained wide interest in recent years since Adleman shows that the technique can be used to solve the Hamiltonian Path Problem (HPP). Since then there has been many research results showing how DNA computing is used to solve a variety of similar combinatorial problems which is mainly in the realm of computer science. However, the application of DNA computing in solving engineering related problems has not been well established. In this paper we demonstrate how DNA computing can be used to solve a two-elevator scheduling problem for a six-storey building. The research involves finding a suitable technique to represent the DNA sequences in finding the optimal route for each elevator based on initial conditions such as the present position of the elevator, the destination of passengers in the elevators and hall calls from a floor. The approach shows that the DNA computing approach can be well-suited for solving such real-world application in the near future.

Original language | English |
---|---|

Title of host publication | Advances in Soft Computing |

Pages | 359-370 |

Number of pages | 12 |

Edition | AISC |

Publication status | Published - 2005 |

Event | 4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology, WSTST 2005 - Muroran Duration: 2005 May 25 → 2005 May 27 |

### Publication series

Name | Advances in Soft Computing |
---|---|

Number | AISC |

ISSN (Print) | 16153871 |

ISSN (Electronic) | 18600794 |

### Other

Other | 4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology, WSTST 2005 |
---|---|

City | Muroran |

Period | 05/5/25 → 05/5/27 |

### Fingerprint

### ASJC Scopus subject areas

- Computational Mechanics
- Computer Science Applications
- Computer Science (miscellaneous)

### Cite this

*Advances in Soft Computing*(AISC ed., pp. 359-370). (Advances in Soft Computing; No. AISC).

**Solving elevator scheduling problem using DNA computing approach.** / Muhammad, Mohd Saufee; Ueda, Satomi; Ono, Osamu; Watada, Junzo; Khalid, Marzuki.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Advances in Soft Computing.*AISC edn, Advances in Soft Computing, no. AISC, pp. 359-370, 4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology, WSTST 2005, Muroran, 05/5/25.

}

TY - GEN

T1 - Solving elevator scheduling problem using DNA computing approach

AU - Muhammad, Mohd Saufee

AU - Ueda, Satomi

AU - Ono, Osamu

AU - Watada, Junzo

AU - Khalid, Marzuki

PY - 2005

Y1 - 2005

N2 - DNA computing approach has gained wide interest in recent years since Adleman shows that the technique can be used to solve the Hamiltonian Path Problem (HPP). Since then there has been many research results showing how DNA computing is used to solve a variety of similar combinatorial problems which is mainly in the realm of computer science. However, the application of DNA computing in solving engineering related problems has not been well established. In this paper we demonstrate how DNA computing can be used to solve a two-elevator scheduling problem for a six-storey building. The research involves finding a suitable technique to represent the DNA sequences in finding the optimal route for each elevator based on initial conditions such as the present position of the elevator, the destination of passengers in the elevators and hall calls from a floor. The approach shows that the DNA computing approach can be well-suited for solving such real-world application in the near future.

AB - DNA computing approach has gained wide interest in recent years since Adleman shows that the technique can be used to solve the Hamiltonian Path Problem (HPP). Since then there has been many research results showing how DNA computing is used to solve a variety of similar combinatorial problems which is mainly in the realm of computer science. However, the application of DNA computing in solving engineering related problems has not been well established. In this paper we demonstrate how DNA computing can be used to solve a two-elevator scheduling problem for a six-storey building. The research involves finding a suitable technique to represent the DNA sequences in finding the optimal route for each elevator based on initial conditions such as the present position of the elevator, the destination of passengers in the elevators and hall calls from a floor. The approach shows that the DNA computing approach can be well-suited for solving such real-world application in the near future.

UR - http://www.scopus.com/inward/record.url?scp=84875089898&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875089898&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84875089898

SN - 3540250557

SN - 9783540250555

T3 - Advances in Soft Computing

SP - 359

EP - 370

BT - Advances in Soft Computing

ER -