Routing and location on a network with hazardous threats

被引：7

作者：

Berman, O

Drezner, Z ^{[1
]}

Wesolowsky, GO

机构：

[1] Calif State Univ Fullerton, Dept Management Sci Informat Syst, Fullerton, CA 92834 USA

[2] Univ Toronto, Toronto, ON, Canada

[3] McMaster Univ, Hamilton, ON L8S 4L8, Canada

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2000年 / 51卷 / 09期

关键词：

routing hazardous materials; location; obnoxious facilities;

D O I：

10.2307/254230

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The aim of this paper is to minimise the impact of hazards located on or near a network. Two situations are considered: (1) where a hazard is located on a network and affects off network sites and (2) an off-network hazard which can affect traffic on the network. Eight models aimed at optimising different objectives are developed and solved, including finding a route between two nodes on a network which minimises the hazard along it and finding a location on a network where the hazard is minimised.

引用

页码：1093 / 1099

页数：7

共 12 条

[1]

[Anonymous], 1995, Facility Location: A Survey of Application and Methods, Spring Series in Operations Research, Chapter 6

[2]

[Anonymous], 1975, P 16 ANN IEEE S FDN

[3]

[Anonymous], MAPLE 5 LIB REFERENC

[4] THE CONSTRAINED BOTTLENECK PROBLEM IN NETWORKS [J].

BERMAN, O ;

EINAV, D ;

HANDLER, G .

OPERATIONS RESEARCH, 1990, 38 (01) :178-181

[5] 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

[6]

BOFFEY B, 1995, FACILITY LOCATION SU, P453

[7]

COUGHLIN R, 1974, ELEMENTARY APPL CALC

[8]

Dijkstra E. W., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[9]

ERKUT E, 1995, FACILITY LOCATION SU, P467, DOI DOI 10.1007/978-1-4612-5355-6

[10]

Hildebrand F.B., 1987, Introduction to numerical analysis

← 1 2 →