A network flow model for lane-based evacuation routing

被引：401

作者：

Cova, TJ ^{[1
]}

Johnson, JP ^{[1
]}

机构：

[1] Univ Utah, Dept Geog, Ctr Nat & Technol Hazards, Salt Lake City, UT 84112 USA

来源：

TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE | 2003年 / 37卷 / 07期

关键词：

emergency management; evacuation routing; network flow modeling; optimization modeling;

D O I：

10.1016/S0965-8564(03)00007-7

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

Most traffic delays in regional evacuations occur at intersections. Lane-based routing is one strategy for reducing these delays. This paper presents a network flow model for identifying optimal lane-based evacuation routing plans in a complex road network. The model is an integer extension of the minimum-cost flow problem. It can be used to generate routing plans that trade total vehicle travel-distance against merging, while preventing traffic crossing-conflicts at intersections. A mixed-integer programming solver is used to derive optimal routing plans for a sample network. Manual capacity analysis and microscopic traffic simulation are used to compare the relative efficiency of the plans. An application is presented for Salt Lake City, Utah. (C) 2003 Elsevier Science Ltd. All rights reserved.

引用

页码：579 / 604

页数：26

共 34 条

[11]

Ford L. R, 1962, FLOWS NETWORKS

[12]

Garber N. J., 1997, TRAFFIC HIGHWAY ENG

[13] A METHODOLOGY FOR ESTIMATING TIME-OF-DAY VARIATIONS IN THE SIZE OF A POPULATION EXPOSED TO RISK [J].

GLICKMAN, TS .

RISK ANALYSIS, 1986, 6 (03) :317-324

[14]

Hillier F.S., 1990, Introduction to operations research, V5th ed.

[15]

HOARD C, 2001, COMMUNICATION

[16] A DECISION-SUPPORT SYSTEM FOR DEVELOPING EVACUATION PLANS AROUND NUCLEAR-POWER STATIONS [J].

HOBEIKA, AG ;

KIM, S ;

BECKWITH, RE .

INTERFACES, 1994, 24 (05) :22-35

[17]

*ILOG, 2000, CPLEX 7 0 US MAN ILO

[18]

*ITE, 1993, TRAFF SAF TOOLB

[19]

*LAC, 2001, UNPUB LAS AL COUNT E

[20]

MILLER HJ, 2001, GEOGRAPHIC INFORMATI

← 1 2 3 4 →