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 条
  • [21] A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
    Malewicz, G
    THEORETICAL COMPUTER SCIENCE, 2004, 329 (1-3) : 285 - 301
  • [22] Near-Optimal Weighted Matrix Completion
    Lopez, Oscar
    JOURNAL OF MACHINE LEARNING RESEARCH, 2023, 24
  • [23] Near-Optimal Distributed Tree Embedding
    Ghaffari, Mohsen
    Lenzen, Christoph
    DISTRIBUTED COMPUTING (DISC 2014), 2014, 8784 : 197 - 211
  • [24] Near-Optimal Separators in String Graphs
    Matousek, Jiri
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (01): : 135 - 139
  • [25] Safe Learning for Near-Optimal Scheduling
    Busatto-Gaston, Damien
    Chakraborty, Debraj
    Guha, Shibashis
    Perez, Guillermo A.
    Raskin, Jean-Francois
    QUANTITATIVE EVALUATION OF SYSTEMS (QEST 2021), 2021, 12846 : 235 - 254
  • [26] Statistically Near-Optimal Hypothesis Selection
    Bousquet, Olivier
    Braverman, Mark
    Kol, Gillat
    Efremenko, Klim
    Moran, Shay
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 909 - 919
  • [27] Near-Optimal (Euclidean) Metric Compression
    Indyk, Piotr
    Wagner, Tal
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 710 - 723
  • [28] NEAR-OPTIMAL BOUNDS FOR PHASE SYNCHRONIZATION
    Zhong, Yiqiao
    Boumal, Nicolas
    SIAM JOURNAL ON OPTIMIZATION, 2018, 28 (02) : 989 - 1016
  • [29] A CLASS OF NEAR-OPTIMAL JPDA ALGORITHMS
    ROECKER, JA
    IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1994, 30 (02) : 504 - 510
  • [30] A near-optimal mechanism for impartial selection
    Bousquet, Nicolas
    Norin, Sergey
    Vetta, Adrian
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8877 : 133 - 146