Dispensing Mode Design of Automated Pharmacy Based on Reduction Algorithm of State Matrix
Zhu Zong-ya · Computer Knowledge and Technology · 2013
In the automated pharmacy system, a reduction algorithm of state matrix is proposed to improve dispensing efficiency. The time equation of motion is analyzed and the optimization goals are determined. Order reduction algorithm of state compres sion matrix algorithm is used to solve the SCP(set covering problem). The entry point and specific processes of this algorithm is given. Combining branch and bound method, a problem instance is shown and solved. Matlab simulations analyze and illustrate the excellent performance of this algorithm in the automated pharmacy dispensing process. The algorithm's time complexity and space complexity are calculated. Comparing with other algorithms on the occasion of practical problems, advantages and disadvan tages are concluded.