中小型药房取药最短路径算法研究

Shortest Path Algorithm for Taking Drugs in Small and Medium Pharmacy

目的:解决中小型药房中取药人员找药过程费时费力的问题。方法:对药房中药架进行区域划分,并针对各个区域内部、区域之间的出入口的具体位置进行分析,通过宽度优先遍历的方法实现最短路径的查找算法。结果:最佳取药路径算法分8步实现,由计算机自动设计路线,使得取药人员可快速、轻松地获得最短路径。结论:通过此算法的实现,可以提高工作效率,且因实现此算法不依赖药房的特定设备,所以此算法具有很好的推广前景。

OBJECTIVE： To resolve the problems of time-consuming and energy-consuming when the staff are looking for drugs in small and medium pharmacy. METHODS： The drug shelves were divided into some units, the specific position of inter- face in each unit or among units were analyzed. The breadth-first was adopted to achieve the shortest path algorithm. RESULTS： By computers designing course automatically, optimal path algorithm for taking drugs was achieved by 8 steps to enable the staff to get the shortest path easily. CONCLUSION： This algorithm can enhance the efficiency of work. The implementation of this algorithm does not need the unique equipments in pharmacies, so this approach has good prospects for promotion.