| 多出救点、多物资应急调度算法研究 |
| |
| 引用本文： | 柴秀荣,王儒敬.多出救点、多物资应急调度算法研究[J].计算机工程与应用,2010,46(6):224-226. |
| |
| 作者姓名： | 柴秀荣 王儒敬 |
| |
| 作者单位： | 1.中国科学院 合肥智能机械研究所，合肥 230031 2.中国科学技术大学 自动化系，合肥 230027 |
| |
| 基金项目： | 国家高技术研究发展计划(863)(No.2006AA10Z23702);;国家科技支撑计划(No.2006BAD10A0502,No.2006BAD10A1410);;国家自然科学基金(No.60774096)~~ |
| |
| 摘 要： | 目前物资调度方法大多是针对单出救点、单物资的调度，不能满足应急救助的实际需要。讨论在满足时间与出救点数量的约束条件下，如何解决灾害发生地多种物资调度问题，同时解决灾害发生地和物资储备仓库之间的最短路径问题。给出了两个具体的算法，并用一个实例验证了算法的可行性。
|
| 关 键 词： | 应急救助 物资调度 最短路径 |
| 收稿时间： | 2008-9-19 |
| 修稿时间： | 2008-11-28
|
Research of emergent material dispatching algorithm based on multi-depot and multi-material |
| |
| CHAI Xiu-rong,WANG Ru-jing.Research of emergent material dispatching algorithm based on multi-depot and multi-material[J].Computer Engineering and Applications,2010,46(6):224-226. |
| |
| Authors: | CHAI Xiu-rong WANG Ru-jing |
| |
| Affiliation: | 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 |
| |
| 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. |
| |
| Keywords: | emergent rescue material dispatching shortest path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
