Solving elevator scheduling problem using DNA computing approach

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

    研究成果: Conference contribution

    4 被引用数 (Scopus)

    抄録

    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.

    本文言語English
    ホスト出版物のタイトルAdvances in Soft Computing
    ページ359-370
    ページ数12
    AISC
    出版ステータスPublished - 2005
    イベント4th IEEE International Workshop on Soft Computing as Transdisciplinary Science and Technology, WSTST 2005 - Muroran
    継続期間: 2005 5 252005 5 27

    出版物シリーズ

    名前Advances in Soft Computing
    番号AISC
    ISSN(印刷版)16153871
    ISSN(電子版)18600794

    Other

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

    ASJC Scopus subject areas

    • 計算力学
    • コンピュータ サイエンスの応用
    • コンピュータ サイエンス(その他)

    フィンガープリント

    「Solving elevator scheduling problem using DNA computing approach」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル