融合A^(*)和禁忌搜索的药房批量取药路径规划算法研究  

Research on the Route Planning Algorithm of Batch Medication Collection in Pharmacy Combined A^(*) with Tabu Search

作　　者：邱媛 QIU Yuan(Kangda College of Nanjing Medical University,Lianyungang 222000,China)

机构地区：[1]南京医科大学康达学院,江苏连云港222000

出　　处：《电脑与电信》2024年第7期17-21,共5页Computer & Telecommunication

基　　金：南京医科大学康达学院科研发展基金项目,项目编号:KD2023KYJJ025。

摘　　要：考虑药房取药场景的实际复杂情况,综合批量取药、多趟取药、药品重量限制等因素,将药房批量取药路径规划问题转换为一个带最大容量约束和多循环约束、以重量加权距离为目标的车辆路径问题,设计了一种融合A^(*)和改进禁忌搜索的混合算法,并在算法设计和工程实现两个角度上进行优化,提高算法性能。最后使用JAVA语言进行仿真实验和可视化展示,验证了算法对于构造的不同规模的所有算例,均能在合理时间内给出可行有效的取药路径,具有较好的路径规划效果。Taking into account the actual complexity of picking medication at pharmacy,and considering factors such as batch picking 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,specifically for all constructed examples of different scales,the algorithm provides feasible and effective picking medication routes within a reasonable time.

关 键 词：路径规划 A^(*)算法 禁忌搜索算法 CVRP 药房批量取药 医药物流 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] R95[自动化与计算机技术—控制科学与工程]