基于改进圆算法的医疗物资配送路径优化研究
Research on path optimization of medical supplies distribution based on improved circle algorithm
ES评分 0
| DOI |
10.12208/j.aics.20220063 |
| 刊名 |
Advances in International Computer Science
|
| 年，卷(期) |
2022, 2(4) |
| 作者 |
|
| 作者单位 |
沧州师范学院计算机科学与工程学院 河北沧州 ;
南京工程学院汽车与轨道交通学院 江苏南京 ;
山东大学(威海) 澳国立联合理学院 山东威海 ;
青岛理工大学环境与市政工程学院 山东青岛 ;
乐山师范学院数理学院 四川乐山 ;
|
| 摘要 |
医疗物资配送是一个典型的优化问题。本文通过分析不同条件下运输车辆的最优路径。当只有一辆运输车辆时，需要找到经过所有节点的运输路线，最终以最小的总成本返回起点。首先，以最短总路径为目标函数，根据每个节点只进出一次等约束，建立基于0-1整数规划的最小代价模型，然后采用传统算法中的改进圆算法来解决该问题。最后求解出最佳路径为1,6,7,10,11,16,14,13,15,9,12,4,5,2,8,1，总距离为3.0387。
|
| Abstract |
Medical material distribution is a typical optimization problem. This paper analyzes the optimal path of transportation vehicles under different conditions. When there is only one transport vehicle, it is necessary to find a transport route through all nodes, and finally return to the starting point with the minimum total cost. First, take the shortest total path as the objective function, according to the constraint that each node can only enter and exit once, secondly establish the minimum cost model based on 0-1 integer programming, and then use the improved circle algorithm in the traditional algorithm to solve this problem. Finally, the optimal path is solved as 1, 6, 7, 10, 11, 16, 14, 13, 15, 9, 12, 4, 5, 2, 8, 1, and the total distance is 3.0387.
|
| 关键词 |
TSP；改进的圆算法；医疗物资配送；路径优化研究
|
| KeyWord |
TSP; improved circle algorithm; medical material distribution; path optimization research
|
| 基金项目 |
|
| 页码 |
31-33 |
王硕*,吴浩,谢峻成,丛磊,柳晓崇.
基于改进圆算法的医疗物资配送路径优化研究 [J].
国际计算机科学进展.
2022; 2; (4).
31 - 33.