A NETWORK-BASED MODEL FOR TRANSPORTING EXTREMELY HAZARDOUS MATERIALS

被引:38
作者
SIVAKUMAR, RA
BATTA, R
KARWAN, MH
机构
[1] SUNY Buffalo, DEPT IND ENGN, BUFFALO, NY 14260 USA
[2] UNITED AIRLINES, CORP RES & DEV, CHICAGO, IL 60666 USA
基金
美国国家科学基金会;
关键词
D O I
10.1016/0167-6377(93)90034-E
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
While routing those hazardous materials that can be catastrophic when involved in an accident, it sometimes can make more sense to minimize the risk given the occurrence of an accident, rather than the a priori risk. In this paper, we consider the concept of conditional risk, and propose two solution procedures. A model that minimizes the conditional risk, keeping the accident probability within a set threshold is also presented.
引用
收藏
页码:85 / 93
页数:9
相关论文
共 11 条
[1]   OPTIMAL OBNOXIOUS PATHS ON A NETWORK - TRANSPORTATION OF HAZARDOUS MATERIALS [J].
BATTA, R ;
CHIU, SS .
OPERATIONS RESEARCH, 1988, 36 (01) :84-92
[2]   OPTIMAL MINIMAX PATH OF A SINGLE SERVICE UNIT ON A NETWORK TO NONSERVICE DESTINATIONS [J].
BERMAN, O ;
HANDLER, GY .
TRANSPORTATION SCIENCE, 1987, 21 (02) :115-122
[3]   MINIMAL RATIO SPANNING TREES [J].
CHANDRASEKARAN, R .
NETWORKS, 1977, 7 (04) :335-342
[4]  
DRAKE A, 1967, FUNDAMENTALS APPLIED
[5]  
GLICKMAN TS, 1991, PROBABILISTIC SAFETY
[6]  
Gondran M, 1984, GRAPHS ALGORITHMS
[7]  
GOPALAN R, 1987, THESIS STATE U NEW Y
[8]   A DUAL ALGORITHM FOR THE CONSTRAINED SHORTEST-PATH PROBLEM [J].
HANDLER, GY ;
ZANG, I .
NETWORKS, 1980, 10 (04) :293-310
[9]  
Lawler E. L., 1976, COMBINATORIAL OPTIMI
[10]   FINDING K SHORTEST LOOPLESS PATHS IN A NETWORK [J].
YEN, JY .
MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 17 (11) :712-716