基于L形算法的震后救援物资调运优化研究  

The optimizing study of post-earthquake relief item transportation based on L-shaped algorithm

作　　者：边际[1] 汪传旭[1] 

机构地区：[1]上海海事大学经济管理学院,上海200135

出　　处：《交通科学与工程》2011年第4期85-91,共7页Journal of Transport Science and Engineering

基　　金：国家自然科学基金(70973074);研究生创新基金资助项目(yc2011008)

摘　　要：考虑地震发生后受灾点的物资需求具有不确定性以及通往受灾点的道路受影响可能发生中断情形,研究了震后的救援物资运输优化问题,建立了随机需求条件下以运输时间最小为目标的应急物资调运优化模型.运用基于两阶段法的L形算法对模型进行求解,通过具体算例验证算法的有效性,并通过与一般随机规划的求解算法———机会约束规划法的比较,验证了该算法的优越性.Considering the uncertainty of demand after earthquake as well as the interruption of roads linked with the disaster sites,the problem of optimizing the relief items＇ transportation after earthquake is studied,and an optimizing model is developed by minimizing the transportation time with random demand.The L-shaped algorithm based on the two-stage method is presented for the proposed model.A numerical example is given to demonstrate the effectiveness of the algorithm,and the advantage of L-shaped algorithm is proved by performing the comparison between L-shaped method and the chance constrained programming.

关 键 词：救援物资 优化调运 随机需求 道路中断 L形算法 

分 类 号：F270[经济管理—企业管理]