Solving elevator scheduling problem using DNA computing approach

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.