A LOCATION-ALLOCATION MODEL AND ALGORITHM FOR EVACUATION PLANNING UNDER HURRICANE FLOOD CONDITIONS

被引:212
作者
SHERALI, HD [1 ]
CARTER, TB [1 ]
HOBEIKA, AG [1 ]
机构
[1] VIRGINIA POLYTECH INST & STATE UNIV,TRANSPORTAT RES CTR,BLACKSBURG,VA 24061
关键词
D O I
10.1016/0191-2615(91)90037-J
中图分类号
F [经济];
学科分类号
02 ;
摘要
The location of shelters in a region threatened by a hurricane can greatly influence the highway network clearance time, i.e. the time needed by evacuees to escape from origin points to safe areas. The studies conducted to date for developing hurricane plans have not implicitly considered the impact of shelter locations on evacuation times. The purpose of this research is to develop both a planning and an operational computer-based tool through a particular location-allocation model. This model selects a set of candidate shelters from among a given set of admissible alternatives in a manner feasible to available resources, and prescribes an evacuation plan which minimizes the total congestion-related evacuation time. An extraneous flow is also superimposed on the network in order to represent the traffic of evacuees not using the designated shelters as destinations. The model formulated is a nonlinear mixed-integer programming problem, for which we develop a heuristic and (two versions of) an exact implicit enumeration algorithm based on the generalized Benders' decomposition method. Computational experience is provided against a set of realistic test problems formulated on the Virginia Beach network. Potential avenues for future research are also explored.
引用
收藏
页码:439 / 452
页数:14
相关论文
共 39 条
[1]   EFFICIENT BRANCH AND BOUND ALGORITHM FOR CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
AKINC, U ;
KHUMAWALA, BM .
MANAGEMENT SCIENCE, 1977, 23 (06) :585-594
[3]  
Bazaraa MS, 1979, NONLINEAR PROGRAMMIN
[4]   INVERSE OPTIMIZATION - AN APPLICATION TO THE CAPACITATED PLANT LOCATION PROBLEM [J].
BITRAN, GR ;
CHANDRU, V ;
SEMPOLINSKI, DE ;
SHAPIRO, JF .
MANAGEMENT SCIENCE, 1981, 27 (10) :1120-1141
[5]  
Carey M. R., 1979, COMPUTERS INTRACTABI
[6]   EXTENSIONS TO A LAGRANGEAN RELAXATION APPROACH FOR THE CAPACITATED WAREHOUSE LOCATION PROBLEM [J].
CHRISTOFIDES, N ;
BEASLEY, JE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1983, 12 (01) :19-28
[7]  
CORNUEJOLS G, 1988, COMP HEURISTICS RELA
[8]   TRAFFIC ASSIGNMENT PROBLEM FOR A GENERAL NETWORK [J].
DAFERMOS, SC ;
SPARROW, FT .
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1969, B 73 (02) :91-+
[9]  
Francis RL., 1974, FACILITY LAYOUT LOCA
[10]   THE BRAESS PARADOX [J].
FRANK, M .
MATHEMATICAL PROGRAMMING, 1981, 20 (03) :283-302