Analysis of Near-Optimal Evacuation Instructions

被引:15
|
作者
Huibregtse, Olga L. [1 ]
Bliemer, Michiel C. J. [1 ]
Hoogendoorn, Serge P. [1 ]
机构
[1] Delft Univ Technol, NL-2628 CN Delft, Netherlands
来源
1ST CONFERENCE ON EVACUATION MODELING AND MANAGEMENT | 2010年 / 3卷
关键词
Evacuation; Instructions; Optimization; OPTIMIZATION;
D O I
10.1016/j.proeng.2010.07.018
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, approximations of optimal evacuation instructions are analyzed. The instructions, consisting of a departure time, a destination, and a route, are for the evacuation by car of a population of a region threatened by a hazard. An optimization method presented in earlier research is applied on three different hazard scenarios resulting in an instruction set for each scenario. These instruction sets are different because of network degeneration caused by the different hazard scenarios. Analysis of the network occupancy during the evacuations as consequence of the instruction sets shows that the capacity is used in the scenarios for minimal 87%, 90%, and 87% for the period wherein the effect of the network degeneration is relatively small. Although the results are logical, no clear patterns are perceptible in the instructions leading to this network occupancy. This endorses to the viewpoint from the earlier paper, namely, that is useful to apply an optimization method to create evacuation instructions instead of applying instructions set up by straightforward rules (like evacuating to the nearest destination). Furthermore, it shows the efficiency of this specific optimization method. (C) 2010 Published by Elsevier Ltd
引用
收藏
页码:189 / 203
页数:15
相关论文
共 50 条
  • [31] Near-Optimal Auctions on Independence Systems
    Ammann, Sabrina C. L.
    Stiller, Sebastian
    THEORY OF COMPUTING SYSTEMS, 2024, 68 (05) : 1160 - 1179
  • [32] Near-Optimal Generalisations of a Theorem of Macbeath
    Mustafa, Nabil H.
    Ray, Saurabh
    31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014), 2014, 25 : 578 - 589
  • [33] Near-optimal individualized treatment recommendations
    Meng, Haomiao
    Zhao, Ying-Qi
    Fu, Haoda
    Qiao, Xingye
    Journal of Machine Learning Research, 2020, 21
  • [34] Near-Optimal A-B Testing
    Bhat, Nikhil
    Farias, Vivek F.
    Moallemi, Ciamac C.
    Sinha, Deeksha
    MANAGEMENT SCIENCE, 2020, 66 (10) : 4477 - 4495
  • [35] Near-Optimal Interdiction of Factored MDPs
    Panda, Swetasudha
    Vorobeychik, Yevgeniy
    CONFERENCE ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE (UAI2017), 2017,
  • [36] Near-Optimal Adaptive Compressed Sensing
    Malloy, Matthew L.
    Nowak, Robert D.
    2012 CONFERENCE RECORD OF THE FORTY SIXTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS (ASILOMAR), 2012, : 1935 - 1939
  • [37] REPLACEMENT POLICIES - A NEAR-OPTIMAL ALGORITHM
    JAYABALAN, V
    CHAUDHURI, D
    IIE TRANSACTIONS, 1995, 27 (06) : 784 - 788
  • [38] Visualization of near-optimal sequence alignments
    Smoot, ME
    Guerlain, SA
    Pearson, WR
    BIOINFORMATICS, 2004, 20 (06) : 953 - 958
  • [39] Near-Optimal Collaborative Learning in Bandits
    Reda, Clemence
    Vakili, Sattar
    Kaufmann, Emilie
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
  • [40] COMPLEXITY OF NEAR-OPTIMAL GRAPH COLORING
    GAREY, MR
    JOHNSON, DS
    JOURNAL OF THE ACM, 1976, 23 (01) : 43 - 49