Research on Path Planning in Pharmacy Batch Picking Medicine Based on Improved Tabu Search Algorithm
Based on the design of the overall environment layout of pharmacies and the introduction of path planning algorithms,a Traveling Salesman Problem(TSP)with weight weighted distance as the objective is proposed to address the practical problem of pharmacy batch picking medicine.It establishes a mixed integer programming model,uses tabu search algorithm for model solving,uses Manhattan distance as the distance between two points,uses dynamic adaptive methods in setting parameters such as tabu length,and adds a shake method to the algorithm to avoid getting stuck in local optima and increase the diversity of search targets.Finally,simulation experiments are conducted using JAVA,and the visualization results have verified the feasibility and effectiveness of the algorithm.
国家科技期刊平台
NSTL
万方数据
