Patrol Route Planning for Incident Response Vehicles under Dispatching Station Scenarios
Patrol Route Planning for Incident Response Vehicles under Dispatching Station Scenarios
复制标题
DOI：
10.1111/mice.12384
复制
发表时间：
2018-07
期刊：
影响因子：
--
通讯作者：
L. Hajibabai;Debashis Saha
中科院分区：
文献类型：
--
作者：
L. Hajibabai;Debashis Saha
交通事故往往会引发重大的安全问题，给邻近的交通网络带来额外的拥堵，并导致间接的经济成本。由于大约三分之一的交通事故是二次事故，有效的事件管理活动至关重要，特别是在交通量较大的道路上，以便及时发现、响应和清理事件，从而支持安全约束和恢复交通网络的通行能力。因此，同时规划第一受访者的调度站选址和巡逻路线设计有利于缓解拥堵。本文提出了一种巡逻车辆的最优路径规划，以便于对潜在事故的快速反应。提出了一种混合整数非线性规划，该规划基于从每个任意位置到所有事发地点的预期最大响应时间来最小化受访者的巡逻旅行成本。热点)，具有各种事件发生概率。针对不同车站设计场景下的路径优化模型，提出了一种基于列生成的求解技术。为了研究调度站设计对路径成本的影响，提出了一种嵌入连续逼近方法的集成遗传算法框架，降低了混合选址设计和路径规划问题的复杂性。在不同规模的假设网络上进行了数值实验，以表明所提出的算法的性能，并得出管理上的启示。本文开发的模型和求解技术适用于同时涉及路线选择和设施选址的许多网络问题。
Traffic incidents often contribute to major safety concerns, impose additional congestion in the neighboring transportation networks, and induce indirect costs to economy. As roughly a third of traffic crashes are secondary accidents, effective incident management activities are critical, especially on roadways with high traffic volume, to detect, respond to, and clean up incidents in a timely fashion, which supports safety constraints and restores traffic capacity in the transportation network. Hence, it is beneficial to simultaneously plan for first respondents’ dispatching station location and patrol route design to mitigate congestion. This article presents an optimal route planning for patrolling vehicles to facilitate quick response to potential accidents. A mixed‐integer nonlinear program is proposed that minimizes the respondents’ patrolling travel cost based on the expected maximum response time from each arbitrary location to all incident locations (a.k.a. hotspots) with various incident occurrence probabilities. We have developed a column generation‐based solution technique to solve the route optimization model under different station design scenarios. To investigate the impact of dispatching station design on the routing cost, an integrated genetic algorithm framework with embedded continuous approximation approach is developed that reduces the complexity of the hybrid location design and route planning problem. Numerical experiments on hypothetical networks of various sizes are conducted to indicate the performance of the proposed algorithm and to draw managerial insights. The models and solution techniques, developed in this article, are applicable to a number of network problems that simultaneously involve routing and facility location choices.