Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Industrial Engineering and Engineering Management》 2007-03
Add to Favorite Get Latest Update

An Approach for Hazardous Materials Transportation Path Problem in the Time-Varing Network Curfews

WEI Hang~1,LI Jun~2,WEI Jie~3(1.School of International Business Administration,Shanghai University of Finance and Economics,Shanghai 200433,China;2.School of Economics and Management,Southwest Jiaotong University,Chengdu 610031,China;3.Management School,Hangzhou Dianzi University,Hangzhou 310018,China)  
In hazardous materials transportation,the shortest path problem is almost wanted.Moreover,the transportation networks are always time-varying and there will be curfews in some nodes.The paper developed the models for time-varying shortest path in the hazardous materials transportation with soft and hard curfews.Based on the dynamic programming,the algorithms were proposed for them. Then,the computational complexity of the algorithm was discussed.By this algorithm,the non-dominated paths in the hazardous materials transportation were provided.The sequence of values for the feasible route in the network with the different conditions were proposed and proved for them.At last,a case was studied.
【Fund】: 国家自然科学基金资助项目(70471039);; 教育部新世纪优秀人才支持计划项目(NCET-04-0886)
【CateGory Index】: U116.2
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved