主管：中国科学院
主办：中国优选法统筹法与经济数学研究会
　　　中国科学院科技战略咨询研究院
中国管理科学

中国管理科学 ›› 2009, Vol. 17 ›› Issue (3): 93-100.

• 论文 • 上一篇    下一篇

时变随机网络下有时间窗的有害物品运输路径选择研究

魏航   

  1. 上海财经大学国际工商管理学院, 上海 200433
  • 收稿日期:2008-09-12 修回日期:2009-05-30 出版日期:2009-06-30 发布日期:2009-06-30
  • 作者简介:魏航(1976- ),男(汉族),浙江绍兴人,上海财经大学国际工商管理学院,博士,讲师,研究方向:物流管理,组合优化.
  • 基金资助:

    国家自然自科学基金资助项目(70471039);上海财经大学‘211工程’三期重点学科建设项目资助

Hazardous Materials Transportation Path Problem in Stochastic, Time-varying Network with Constrain of Time Windows

WEI Hang   

  1. School of International Business Administration, Shanghai University of Finance and Economics, Shanghai 200433, China
  • Received:2008-09-12 Revised:2009-05-30 Online:2009-06-30 Published:2009-06-30

PDF (PC)

1168

被引次数

38

摘要： 研究了时变随机网络下有害物品运输路径选择问题。首先定义了可行路径的具有随机性和时变性的选择向量,以期望值为目标,建立了多目标时变随机网络下有软、硬时间窗限制的有害物品运输路径选择模型。给出了时变随机网络下的有效路径的定义,并设计了多维时变随机动态标号,利用此标号设计了求解模型的多项式算法,通过此算法可以得到时变随机网络下有害物品运输路径的所有有效解。最后给出了一个应用算例。

关键词: 有害物品运输, 时变, 随机, 时间窗, 多目标

Abstract: The paper discussed hazardous materials transportation in stochastic time-varying with soft and hard time windows(HTSTTW).Firstly we defined a sector to describe the time-varying and stochastic character for a feasible path and then developed the models for HTSTTW. Because of the multi-objective function in the model,the definition of efficient path in time-varying and stochastic network was given. In order to develop the algorithm,the dynamic and multi-dimension label was defined. Then,the algorithm for selecting for HTSTTW based on the label was developed. The complexity of the algorithm was discussed. By this algorithm,the non-dominated paths in the hazardous materials transportation were provided. Then,series of property were proved. At last,a case was studied.

Key words: hazardous materials transportation, time-varying, stochastic, time windows, multi-objective

中图分类号: