单旋转货架最优拣选路径求解

Optimum route picking solution for multi-rotating shelves

对拣选路径优化问题,提出了一种新的路径优化算法。建立了单旋转货架拣选路径数学模型,通过改进的离散粒子群算法求解,通过MATLAB实现算法,并用图论的方法分析和论证了该解决方法的可行性。针对山西某儿童医院的实际应用情况进行建模和求解,并在MATLAB中进行仿真,研究证明该算法应用在单回转智能存取系统能够有效求出其运行的最短路径。通过实际应用验证,新的算法能很好求出单垂直循环式药柜的最短路径。该方法为药房自动化控制系统设计提供了有价值的参考。

To optimize route picking,a new route optimization algorithm was put forward. The route picking mathematical model of single rotating shelves was built. Through the improved Discrete Particle Swarm Algorithm solving,the method of Graph Theory analyzing and the algorithm realizing by Matlab,the feasibility of this approach was proved. Based on the data from a children ＇s hospital of Shanxi,the mathematical model was simulated in Matlab. The result of the optimization research proves that the shortest path can be effectively found out by using the new algorithm in a single rotating shelf＇s storage system. Experimental results and validation show the shortest path of the single vertical rotating medicine cabinet can be well found by the new algorithm method. The new method can provide a valuable reference for realizing the pharmacy automation control system design.