节点文献
灾区物资运输最优路径规划及调度方案
The optimal path planning and scheduling of transporting supplies to the disaster areas
【摘要】 灾区应急物资运输非一般的物流活动,具有弱经济性,讲究时间的紧迫性.本文针对汶川"5.12"地震,建立了最短路数学模型,运用Dijkstra算法求解供应点到各需求点的最短距离及路径,将实际问题简化,再以总的应急时间最短,建立物资调度的线性规划模型,由模型求解结果得到具体运输方案,并通过模拟仿真说明该模型的具体应用.
【Abstract】 Transporting emergent supplies to the disaster areas is different from general logistics actiuities,because of its weak economy and paying much attention to the urgency of time.For the 5·12 earthquake in wenchuan,a mathematical model of the shortest path was established,using Dijksta allgorithm to obtain the minimum distance and path between supply points and demand points.The actual problems were simplified,with the shortest emergent time,and the linear programming model of material scheduling was established.the results obtained by the model was to solve the specific transportation programs,and the specific application of the model was explaiued through stimulation.
【Key words】 material transport; emergency relief; Dijkstra algorithm; linear programming;
- 【文献出处】 重庆文理学院学报(自然科学版) ,Journal of Chongqing University of Arts and Sciences(Natural Science Edition) , 编辑部邮箱 ,2009年06期
- 【分类号】O224
- 【被引频次】3
- 【下载频次】335