DNA computing for complex scheduling problem

  • Authors:

  • Mohd Saufee Muhammad;Zuwairie Ibrahim;Satomi Ueda;Osamu Ono;Marzuki Khalid

  • Affiliations:

  • Institute of Applied DNA Computing, Meiji University, Kawasaki-Shi, Kanagawa-Ken, Japan;Institute of Applied DNA Computing, Meiji University, Kawasaki-Shi, Kanagawa-Ken, Japan;Institute of Applied DNA Computing, Meiji University, Kawasaki-Shi, Kanagawa-Ken, Japan;Institute of Applied DNA Computing, Meiji University, Kawasaki-Shi, Kanagawa-Ken, Japan;Institute of Applied DNA Computing, Meiji University, Kawasaki-Shi, Kanagawa-Ken, Japan

  • Venue:
  • ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar combinatorial problems which are mainly in the realm of computer science and mathematics have been presented. In this paper, implementation ideas and methods to solve an engineering related combinatorial problem using this DNA computing approach is presented. The objective is to find an optimal path for a complex elevator scheduling problem of an 8-storey building with 3 elevators. Each of the elevator traveled path is represented by DNA sequence of specific length that represent elevator's traveling time in a proportional way based on certain initial conditions such as present and destination floors, and hall calls for an elevator from a floor. The proposed ideas and methods show promising results that DNA computing approach can be well-suited for solving such real-world application in the near future.