运力受限的应急物资动态调度模型及算法  

Model and algorithm of relief materials dynamic scheduling without sufficient vehicle quantity

作　　者：王旭坪[1] 马超[1] 阮俊虎[1] 

机构地区：[1]大连理工大学系统工程研究所,大连116023

出　　处：《系统工程理论与实践》2013年第6期1492-1500,共9页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(90924006;71171029);中央高校基本科研业务费

摘　　要：针对大规模突发事件下应急物资动态调度问题,把灾民的损失用物资未满足度的形式进行量化,构建以最小化灾民损失和车辆调度费用为目标的混合整数规划模型,以对运力受限情况下的救援车辆路径选择和应急物资分配进行综合决策.利用分层求解策略缩小问题的求解空间,改进基于客户点的编码方式,设计了针对此问题的遗传算法.代入实验数据得出了物资集散地不同运力下的应急物资动态调度方案,进而确定了最优运力配置量,与现实情况下的配送方案比较表明此模型和算法是有效的.This paper focused on relief materials dynamic scheduling after large emergency. We quantified the loss of victims in terms of unmet needs, and formulated a mixed integer programming model in order to minimize victims＇ loss and vehicle scheduling expense. The main decisions were determining the delivery routes and allocating the relief supplies from relief distribution center （RDC） to save points without sufficient vehicle quantity. We used the hierarchical thinking to reduce solution space, improved the coding method and designed the genetic algorithm for this problem. Finally, experimental results show the dynamic scheduling scheme under different vehicle quantity, and determine the optimal vehicle quantity in RDC through comparative analysis, the validity of this model and algorithm is verified combining with realistic distribution scheme.

关 键 词：突发事件 运力受限 动态调度 最优运力 

分 类 号：C93[经济管理—管理学]