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

Chinese Journal of Management Science ›› 2009, Vol. 17 ›› Issue (3): 93-100.

Previous Articles     Next Articles

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

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

CLC Number: