Zhu Senlai, Guo Yuntao, Chen Jingxu, Li Dawei, Cheng Lin
School of Transportation, Nantong University, Se Yuan Road #9, Nantong 226019, China.
Lyles School of Civil Engineering/NEXTRANS Center, Purdue University, 3000 Kent Avenue, West Lafayette, IN 47906, USA.
Sensors (Basel). 2017 Aug 2;17(8):1767. doi: 10.3390/s17081767.
Most existing network sensor location problem (NSLP) models are designed to identify the number of sensors with fixed costs and installation locations, and sensors are assumed to be installed permanently. However, sometimes sensors are carried by individuals to collect traffic data measurements manually at fixed locations. Hence, their duration of operation for which traffic data measurements are collected is limited, and their costs are not fixed as they are correlated with the duration of operation. This paper proposes a NSLP model that integrates optimal heterogeneous sensor deployment and operation strategies for the dynamic O-D demand estimates under budget constraints. The deployment strategy consists of the numbers of link and node sensors and their installation locations. The operation strategy includes sensors' start time and duration of operation, which has not been addressed in previous studies. An algorithm is developed to solve the proposed model. Numerical experiments performed on a network from a part of Chennai, India show that the proposed model can identify the optimal heterogeneous sensor deployment and operation strategies with the maximum dynamic O-D demand estimation accuracy.
大多数现有的网络传感器定位问题(NSLP)模型旨在确定具有固定成本和安装位置的传感器数量,并且假定传感器是永久安装的。然而,有时传感器由个人携带,以便在固定位置手动收集交通数据测量值。因此,它们收集交通数据测量值的运行持续时间是有限的,并且由于它们与运行持续时间相关,其成本也不是固定的。本文提出了一种NSLP模型,该模型在预算约束下集成了用于动态O-D需求估计的最优异构传感器部署和运行策略。部署策略包括链路和节点传感器的数量及其安装位置。运行策略包括传感器的开始时间和运行持续时间,这在以前的研究中尚未涉及。开发了一种算法来求解所提出的模型。在印度钦奈一部分地区的网络上进行的数值实验表明,所提出的模型能够以最大的动态O-D需求估计精度识别最优异构传感器部署和运行策略。