摘要
目前物资调度方法大多是针对单出救点、单物资的调度,不能满足应急救助的实际需要。讨论在满足时间与出救点数量的约束条件下,如何解决灾害发生地多种物资调度问题,同时解决灾害发生地和物资储备仓库之间的最短路径问题。给出了两个具体的算法,并用一个实例验证了算法的可行性。
The existing material dispatching methods are mostly single-depot and single-material dispatching,they can＇t satisfy the actual needs of emergent rescue.ln the paper,how to solve the multi-material dispatching problem for disaster occurred place in the constraints of time and the number of depots is discussed.How to seek the shortest path between the disaster occurred place and the material reserve storages is also discussed.Two specific algorithms are given and an example is utilized to verify the feasibility of the algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第6期224-226,共3页
Computer Engineering and Applications
基金
国家高技术研究发展计划(863)(No.2006AA10Z23702)
国家科技支撑计划(No.2006BAD10A0502
No.2006BAD10A1410)
国家自然科学基金(No.60774096)~~
关键词
应急救助
物资调度
最短路径
emergent rescue
material dispatching
shortest path
