Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (6): 224-226.DOI: 10.3778/j.issn.1002-8331.2010.06.065

• 工程与应用 • Previous Articles     Next Articles

Research of emergent material dispatching algorithm based on multi-depot and multi-material

CHAI Xiu-rong1,2,WANG Ru-jing1   

  1. 1.Institute of Intelligent Machines,Chinese Academy of Science,Hefei 230031,China
    2.Department of Automation,University of Science and Technology of China,Hefei 230027,China
  • Received:2008-09-19 Revised:2008-11-28 Online:2010-02-21 Published:2010-02-21
  • Contact: CHAI Xiu-rong



  1. 1.中国科学院 合肥智能机械研究所,合肥 230031
    2.中国科学技术大学 自动化系,合肥 230027
  • 通讯作者: 柴秀荣

Abstract: The existing material dispatching methods are mostly single-depot and single-material dispatching,they can’t satisfy the actual needs of emergent rescue.In 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.

Key words: emergent rescue, material dispatching, shortest path

摘要: 目前物资调度方法大多是针对单出救点、单物资的调度,不能满足应急救助的实际需要。讨论在满足时间与出救点数量的约束条件下,如何解决灾害发生地多种物资调度问题,同时解决灾害发生地和物资储备仓库之间的最短路径问题。给出了两个具体的算法,并用一个实例验证了算法的可行性。

关键词: 应急救助, 物资调度, 最短路径

CLC Number: