• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Annual meeting of the transportation research board;Transportation Research Board >Time-Dependent Vehicle Routing and Assignment in No-Notice Evacuations
【24h】

Time-Dependent Vehicle Routing and Assignment in No-Notice Evacuations

机译：通知疏散中随时间变化的车辆路线和分配

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Natural and man-made disasters are consistent threats to populated areas. As the population densityin major cities increases each year, the effects of these disasters can only increase. The intensity ofthese disasters may occasionally require an execution of an emergency evacuation order. In order toreduce the uncertainty immediately following such an order, emergency response agencies arerequired to have evacuation plans, which become more important when there is no advanceknowledge of the event. One element to include in these plans is the positioning of emergencyresponse vehicles (ERVs) to direct traffic away from affected areas and towards evacuation shelters.The aim of this study is to apply a mathematical model and effective and efficient algorithms tooptimally assign and route ERVs to critical points in the road network. This paper extends theDijkstra’s Algorithm for dynamic travel times and integrates it with an assignment model. Thiscombined approach minimizes the total arrival time or latest arrival time of ERVs much faster thanthe mixed integer programming (MIP). The methodology is validated using an evacuation roadnetwork in a metropolitan area.
机译：自然和人为灾害是对人口稠密地区的持续威胁。由于人口密度 在主要城市中，每年增加的灾难带来的后果只会越来越大。强度 这些灾难有时可能需要执行紧急疏散命令。为了 降低此类命令后的不确定性，应急响应机构 要求有疏散计划，这在没有提前的情况下变得尤为重要 有关事件的知识。这些计划中包括的一项内容是紧急情况的定位 应急车辆（ERV），将车辆从受影响地区引向避难所。 这项研究的目的是将数学模型和有效高效的算法应用于 优化将ERV分配和路由到路网中的关键点。本文扩展了 Dijkstra的动态旅行时间算法，并将其与分配模型集成。这 组合方法最大程度地缩短了ERV的总到达时间或最新到达时间，比 混合整数编程（MIP）。该方法已通过疏散路进行了验证 大城市中的网络。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号