MULTIOBJECTIVE ROUTING OF HAZARDOUS MATERIALS IN STOCHASTIC NETWORKS

被引：44

作者：

WIJERATNE, AB

TURNQUIST, MA

MIRCHANDANI, PB

机构：

[1] CORNELL UNIV,SCH CIVIL & ENVIRONM ENGN,ITHACA,NY 14853

[2] UNIV ARIZONA,DEPT SYST & IND ENGN,TUCSON,AZ 85721

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1993年 / 65卷 / 01期

关键词：

MULTIOBJECTIVE; SHORTEST PATH; HAZARDOUS MATERIAL; STOCHASTIC; NETWORK; PARETO-OPTIMAL;

D O I：

10.1016/0377-2217(93)90142-A

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper describes a method for determining a set of non-dominated routes in a network when there are multiple, uncertain measures which form the basis for route evaluation. The resulting Stochastic, Multiobjective Shortest Path (SMOSP) algorithm has important application in hazardous materials transportation. In addition to the methodological development, we present an example application to routing hazardous materials in the Albany-Schenectady-Troy area of New York State.

引用

页码：33 / 43

页数：11

共 23 条

[1]

ABKOWITZ M, 1984, TRANSPORT RES REC, V977, P22

[2]

CLIMACO JCN, 1982, EUR J OPER RES, V11, P399, DOI 10.1016/0377-2217(82)90205-3

[3] SHORTEST PATHS IN NETWORKS WITH VECTOR WEIGHTS [J].