MODELING OF BUILDING EVACUATION PROBLEMS BY NETWORK FLOWS WITH SIDE CONSTRAINTS

被引：84

作者：

CHOI, W

HAMACHER, HW

TUFEKCI, S

机构：

[1] Univ of Florida, Gainesville, FL,, USA, Univ of Florida, Gainesville, FL, USA

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1988年 / 35卷 / 01期

关键词：

COMPUTER PROGRAMMING - Algorithms - MATHEMATICAL MODELS;

D O I：

10.1016/0377-2217(88)90382-7

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper we model building evacuations by network flows with side constraints. Side constraints come from variable arc capacities on some arcs which are functions of flows in incident arcs. In this context we study maximum flow, minimum cost, and minimax objectives. For some special structured networks we propose 'greedy' algorithms for solving these problems. For more general network structures, solution procedures are recommended which take advantage of the network structures of the problems.

引用

页码：98 / 110

页数：13

共 28 条

[1]

[Anonymous], 1980, FIRES HUMAN BEHAV

[2]

BAZARAA MS, 1977, NONLINEAR PROGRAMMIN

[3]

BENNET SM, 1966, OPERATIONS RES, V14

[4] NETWORK MODELS FOR BUILDING EVACUATION [J].

CHALMET, LG ;

FRANCIS, RL ;

SAUNDERS, PB .

MANAGEMENT SCIENCE, 1982, 28 (01) :86-105

[5]

CHEN S, 1977, NETWORKS, V7

[6]

Choi W., 1984, Operational Reseach '84. Proceedings of the Tenth International Conference, P1047

[7]

CHOI W, 1985, 858 U FLOR DEP IND S

[8]

FRANCIS RL, 1984, 8436 U FLOR DEP IND

[9]

Fruin J. J, 1970, THESIS POLYTECHNIC I

[10]

Fruin JJ, 1971, PEDESTRIAN PLANNING

← 1 2 3 →