上海交通大学学报(自然版) ›› 2013, Vol. 47 ›› Issue (06): 962-966.

• 交通运输 • 上一篇    下一篇

考虑路径风险的不确定需求应急物流定位-路径问题

孙华丽1,周战杰1,薛耀锋2   

  1. (1.上海大学 管理学院,上海 200444; 2.华东师范大学 上海数字化教育装备工程技术研究中心,上海 200062)
     
  • 收稿日期:2012-07-22
  • 基金资助:

    国家自然科学基金资助项目(71203134),教育部人文社会科学研究项目(10YJC630213),上海市教委科研创新重点资助项目(12ZS094),国家自然科学基金重大研究计划(90924030)

Emergency Location-routing Problem with Uncertain Demand under Path Risk

SUN Huali1,ZHOU Zhanjie1,XUE Yaofeng2
  

  1. (1. Management School, Shanghai University, Shanghai 200444, China; 2. Shanghai Engineering Research Center of Digital Educational Equipment, East China Normal University, Shanghai 200062, China)
  • Received:2012-07-22

摘要:

针对突发事件发生后路网和救援物资需求的不确定性,考虑路径运行时间超期风险、路网通行能力风险、路径复杂性及应急物资需求不确定性,以应急物资运达总时间最小和系统总成本最小为目标,建立了基于随机机会约束规划的多目标应急物流定位-路径模型,设计了改进的遗传算法对其进行求解,采用罚函数法处理模型中的约束条件.算例分析验证了模型的合理性和算法的可行性.
 
 

关键词: 应急物流, 定位-路径问题, 路径风险, 随机机会约束规划, 遗传算法

Abstract:

The location-routing problem (LRP) is an important logistics problem in emergency management. Considering the risk of the extended traveling time, the risk of road connectivity, the road complexity and the demand uncertainty of relief supplies, a multi-objective optimization model based on the stochastic chance constrained programming was proposed to minimize the total transportation time and the total system cost. Then, an improved genetic algorithm (GA) with penalty function was presented to solve the optimization problem. The results of numerical examples show that the optimization model and the improved GA algorithm proposed in this paper are feasible and effective.

Key words: emergency logistics, location-routing problem (LRP), path risk, stochastic chance constrained programming, genetic algorithm

中图分类号: