基于改进禁忌搜索算法的药房批量取药路径规划研究
Research on Path Planning in Pharmacy Batch Picking Medicine Based on Improved Tabu Search Algorithm
邱媛 1龚星雨1
作者信息
- 1. 南京医科大学康达学院,江苏 连云港 222000
- 折叠
摘要
针对药房批量取药这一现实问题,在设计药房整体环境布局和引入路径规划算法的基础上,提出以重量加权的距离为目标的旅行商问题TSP(Traveling Salesman Problem).建立一个混合整数规划模型,使用禁忌搜索算法进行模型求解,使用曼哈顿距离作为两点之间距离,在禁忌长度等参数设置上使用动态自适应方法,并在算法中加入扰动方法,避免算法陷入局部最优,增加搜索目标的多样性.最后使用JAVA进行了仿真模拟实验,可视化结果验证了算法的可行性和有效性.
Abstract
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.
关键词
医药物流/路径规划/药房批量取药/旅行商问题/禁忌搜索算法Key words
pharmaceutical logistics/path planning/pharmacy batch picking medicine/TSP/tabu search algorithm引用本文复制引用
基金项目
南京医科大学康达学院科研发展项目(KD2023KYJJ025)
出版年
2024
国家科技期刊平台
NSTL
万方数据