【摘要】 把影响中药自动配药系统工作效率的瓶颈——集中料斗的取药服务规划 ,归结为带有单边时间窗的旅行商运动规划问题 (TSP- STW)。在建立了问题的动态规划模型后 ,给出了计算机求解算法的框架 ,检验了算法的正确性 ,并定量分析了影响算法有效性的计算量和存储空间要求。给出了程序对不同规模问题的运行时间 ,得出满足实时调度要求的条件更多还原

【Abstract】 In this paper the operative schedule of the collecting bucket, which is the bottleneck that greatly effects the work efficiency of the Automatic Traditional Chinese Medicine Dispensation System (ATCMDS), belongs to the classic Travelling Salesman Problems with single time windows (TSP-STW).On the basis of its dynamic programming model, the diagram of computational algorithm was given and its correctness was verified. Quantitative analysis on computational complexity and memory demand of the algorithm reveals both are decisive factors in its effectiveness. In the end, the paper gave the computational time on different size of problems and derived the conditions needed to satisfy real time schedule demand.更多还原