A network flow model for lane-based evacuation routing
A network flow model for lane-based evacuation routing
复制标题
DOI：
10.1016/s0965-8564(03)00007-7
复制
发表时间：
2003-08-01
影响因子：
6.4
通讯作者：
Johnson, JP
中科院分区：
文献类型：
--
作者：
Cova, TJ;Johnson, JP
大部分区域疏散的交通延误发生在十字路口。基于车道的路由是减少这些延迟的一种策略。本文提出了一种网络流模型，用于识别复杂路网中基于车道的最优疏散路径规划。该模型是最小代价流问题的整数扩展。它可以用来生成路径规划，使车辆总行驶距离与合并相权衡，同时防止交叉路口的交通冲突。采用混合整数规划求解器对一个样本网络进行了最优路由规划。通过人工容量分析和微观交通仿真来比较各方案的相对效率。提出了犹他州盐湖城的应用程序。2003爱思唯尔科学有限公司版权所有。
Most traffic delays in regional evacuations occur at intersections. Lane-based routing is one strategy for reducing these delays. This paper presents a network flow model for identifying optimal lane-based evacuation routing plans in a complex road network. The model is an integer extension of the minimum-cost flow problem. It can be used to generate routing plans that trade total vehicle travel-distance against merging, while preventing traffic crossing-conflicts at intersections. A mixed-integer programming solver is used to derive optimal routing plans for a sample network. Manual capacity analysis and microscopic traffic simulation are used to compare the relative efficiency of the plans. An application is presented for Salt Lake City, Utah. (C) 2003 Elsevier Science Ltd. All rights reserved.