...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Applied Mathematical Modelling >Simultaneous evacuation and entrance planning in complex building based on dynamic network flows
【24h】

Simultaneous evacuation and entrance planning in complex building based on dynamic network flows

机译：基于动态网络流的复杂建筑同时疏散和入口规划

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper presents mathematical models and a heuristic algorithm that address a simultaneous evacuation and entrance planning. For the simultaneous evacuation and entrance planning, four types of mathematical models based on the discrete time dynamic network flow model are developed to provide the optimal routes for evacuees and responders within a critical timeframe. The optimal routes obtained by the mathematical models can minimize the densification of evacuees and responders into specific areas. However, the mathematical model has a weakness in terms of long computation time for the large-size problem. To overcome the limitation, we developed a heuristic algorithm. We also analyzed the characteristics of each model and the heuristic algorithm by conducting case studies. This study pioneers area related to evacuation planning by developing and analyzing four types of mathematical models and a heuristic algorithm which take into account simultaneous evacuation and entrance planning. (C) 2019 Elsevier Inc. All rights reserved.
机译：本文介绍了数学模型和启发式算法，可解决同时疏散和入口计划的问题。对于同时疏散和进入计划，开发了基于离散时间动态网络流模型的四种数学模型，以在关键时间内为撤离人员和响应者提供最佳路线。通过数学模型获得的最佳路线可以最大程度地减少疏散人员和响应者进入特定区域的密度。然而，就大型问题而言，数学模型在长计算时间方面具有弱点。为了克服该限制，我们开发了一种启发式算法。我们还通过进行案例研究，分析了每个模型的特征和启发式算法。本研究通过开发和分析四种同时考虑避难和入场计划的数学模型和启发式算法，开拓了与避难计划相关的领域。 （C）2019 Elsevier Inc.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号