灾后道路抢修和物资配送的整合优化算法  

Combinatorial optimization algorithm of rapid road repair and material distribution after disaster

作　　者：张毅[1] 郭晓汾[1] 李金辉[2] 

机构地区：[1]长安大学汽车学院,陕西西安710064 [2]河南科技大学车辆与动力工程学院,河南洛阳471003

出　　处：《交通运输工程学报》2007年第2期117-122,共6页Journal of Traffic and Transportation Engineering

基　　金：国家自然科学基金项目(70102008)

摘　　要：为了在有限的时间内同时获得最佳抢修效益和物资配送方案,提高救灾工作效率,针对灾后道路抢修与救灾物资配送问题,利用时空网络流动技巧,构建了两者相应的时空网络,在考虑两者的相关性后,建立了多目标的灾后道路抢修工程与紧急物资配送混合整数多重网络规划模型,提出了分解启发式求解方法。算例计算结果表明,用CPLEX数学规划软件直接求解,在求解到106.9 h时,才可求得最优解,而分解启发式方法只需31.8 min即可求得最优解,其求解效率大幅提高,求解时间对于实际的救灾工作是可以接受的。In order to obtain the highest road repair benefit and the optimized material distribution project within limited time, and enhance relief efficiency after disaster, the problems of rapid road repair and material distribution after disaster were analyzed, their time-space networks were respectively constructed by using the flowing technique of time-space network, the relativity between rapid road repair and material distribution was considered, a multi-objective mixed integer-multiple network programming model was founded relating with rapid road repair engineering and urgency material distribution after disaster, and a decomposition heuristic algorithm was put forward. The calculated result of an instance shows that it takes 106.9 h to obtain the optimized solution of the model with CPLEX math programming software, while it only takes 31.8 min with the algorithm. Its calculation efficiency is high, and the calculation time is acceptable in actual relief work after disaster. 6 tabs, 2 figs, 10 refs.

关 键 词：物流工程 道路抢修 救灾 物资配送 时空网络 混合整数规划 

分 类 号：U492[交通运输工程—交通运输规划与管理]