Research on the Route Planning Algorithm of Batch Medication Collection in Pharmacy Combined A* with Tabu Search
Taking into account the actual complexity of picking medication at pharmacy,and considering factors such as batch pick-ing medication,multi-trip picking medication,and medication weight limitations,the batch medication collection route planning problem is transformed into a vehicle routing problem with maximum capacity constraints and multi-trip constraints,with weight weighted distance as objective function.An improved A* combined with Tabu Search algorithm is designed to solve the problem and is optimized from both algorithm design and engineering perspectives to improve the performance of the algorithm.Finally,the simulation experiments and visual presentation using JAVA language verify that the algorithm has a good route planning effect,spe-cifically for all constructed examples of different scales,the algorithm provides feasible and effective picking medication routes within a reasonable time.
route planningA* algorithmtabu searchCVRPbatch medication collection at pharmacypharmaceutical logistics
NETL
NSTL
万方数据
