Solving elevator scheduling problem using DNA computing approach

Mohd Saufee Muhammad, Satomi Ueda, Osamu Ono, Junzo Watada, Marzuki Khalid

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Citations (Scopus)

    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 languageEnglish
    Title of host publicationAdvances in Soft Computing
    Pages359-370
    Number of pages12
    EditionAISC
    Publication statusPublished - 2005
    Event4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology, WSTST 2005 - Muroran
    Duration: 2005 May 252005 May 27

    Publication series

    NameAdvances in Soft Computing
    NumberAISC
    ISSN (Print)16153871
    ISSN (Electronic)18600794

    Other

    Other4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology, WSTST 2005
    CityMuroran
    Period05/5/2505/5/27

    Fingerprint

    Elevators
    DNA
    Scheduling
    Hamiltonians
    DNA sequences
    Computer science

    ASJC Scopus subject areas

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

    Cite this

    Muhammad, M. S., Ueda, S., Ono, O., Watada, J., & Khalid, M. (2005). Solving elevator scheduling problem using DNA computing approach. In 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.

    Advances in Soft Computing. AISC. ed. 2005. p. 359-370 (Advances in Soft Computing; No. AISC).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Muhammad, MS, Ueda, S, Ono, O, Watada, J & Khalid, M 2005, Solving elevator scheduling problem using DNA computing approach. in 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.
    Muhammad MS, Ueda S, Ono O, Watada J, Khalid M. Solving elevator scheduling problem using DNA computing approach. In Advances in Soft Computing. AISC ed. 2005. p. 359-370. (Advances in Soft Computing; AISC).
    Muhammad, Mohd Saufee ; Ueda, Satomi ; Ono, Osamu ; Watada, Junzo ; Khalid, Marzuki. / Solving elevator scheduling problem using DNA computing approach. Advances in Soft Computing. AISC. ed. 2005. pp. 359-370 (Advances in Soft Computing; AISC).
    @inproceedings{ef1a4efc305545bd8d47310231de7e8a,
    title = "Solving elevator scheduling problem using DNA computing approach",
    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.",
    author = "Muhammad, {Mohd Saufee} and Satomi Ueda and Osamu Ono and Junzo Watada and Marzuki Khalid",
    year = "2005",
    language = "English",
    isbn = "3540250557",
    series = "Advances in Soft Computing",
    number = "AISC",
    pages = "359--370",
    booktitle = "Advances in Soft Computing",
    edition = "AISC",

    }

    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 -