An improved DNA computing method for elevator scheduling problem

Abstract

In the paper, an algorithm based on DNA computing which can solve the elevator scheduling problem is improved. Considering the inefficiency of the existing algorithm caused by the large scale of the initial solution space, the author introduces a new conception - "connecting strand" to help produce the initial solution space in the new algorithm. "Connecting strand" can connect those rational DNA strands encoding different elevators' running routes into one and the strand obtained just stands for the "sum-route" of the elevator system. With the help of "connecting strand", the size of initial solution space is largely reduced and the performance of the algorithm is thus improved. In the end, the author proves the effectiveness of the algorithm by a simulation. © 2013 Springer-Verlag.