摘要
针对某地区防洪救灾中物资的调运问题,利用图论中最短路的知识,根据问题实际,将物资的调运方案分成3个阶段。在每个阶段以费用最小或时间最短为目标,以各单位之间物资的供求平衡为约束,建立了规划模型。通过编程求解,制定了不同情况下物资紧急调运的具体方案,包括用车数量、行车线路、用车时间和费用。
Aiming at the dispatching of supphed material tp disaster area, the whole dispatching project is divided into three stages according to the actual instance,by use of the knowledge on the shortest path in graph theory. Some programming models,of which the target is the minimum cost or the time and the constraints are the demand balances of materials among the units, are estab- lished at each stage. By programming, some different projects to supply emergency materials are solved in case of each specific case, which involve the number of trucks, the routes, the using time and the mass cost.
出处
《后勤工程学院学报》
2011年第1期70-79,共10页
Journal of Logistical Engineering University
基金
国家自然科学基金资助项目(10971227)
关键词
线性规划
最短路
排序
linear programming
the shortest path
sort