计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2010年
6期
224-226
,共3页
应急救助%物资调度%最短路径
應急救助%物資調度%最短路徑
응급구조%물자조도%최단로경
emergent rescue%material dispatching%shortest path
目前物资调度方法大多是针对单出救点、单物资的调度,不能满足应急救助的实际需要.讨论在满足时间与出救点数量的约束条件下,如何解决灾害发生地多种物资调度问题,同时解决灾害发生地和物资储备仓库之间的最短路径问题.给出了两个具体的算法,并用一个实例验证了算法的可行性.
目前物資調度方法大多是針對單齣救點、單物資的調度,不能滿足應急救助的實際需要.討論在滿足時間與齣救點數量的約束條件下,如何解決災害髮生地多種物資調度問題,同時解決災害髮生地和物資儲備倉庫之間的最短路徑問題.給齣瞭兩箇具體的算法,併用一箇實例驗證瞭算法的可行性.
목전물자조도방법대다시침대단출구점、단물자적조도,불능만족응급구조적실제수요.토론재만족시간여출구점수량적약속조건하,여하해결재해발생지다충물자조도문제,동시해결재해발생지화물자저비창고지간적최단로경문제.급출료량개구체적산법,병용일개실례험증료산법적가행성.
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.