Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/14393
Title: Optimal speed detector density for the network with travel time information
Authors: Chan, KS
Lam, WHK 
Issue Date: 2002
Publisher: Pergamon Press
Source: Transportation research. Part A. Policy and practice, 2002, v. 36, no. 3, p. 203-223 How to cite?
Journal: Transportation research. Part A. Policy and practice 
Abstract: In the expressway network, detectors are installed on the links for detecting the travel time information while the predicted travel time can be provided by the route guidance system (RGS). The speed detector density can be determined to influence flow distributions in such a way that the precision of the travel time information and the social cost of the speed detectors are optimized, provided that each driver chooses the minimum perceived travel time path in response to the predicted travel time information. In this paper, a bilevel programming model is proposed for the network with travel time information provided by the RGS. The lower-level problem is a probit-based traffic assignment model, while the upper-level problem is to determine the speed detector density that minimizes the measured travel time error variance as well as the social cost of the speed detectors. The sensitivity analysis based algorithm is proposed for the bilevel programming problem. Numerical examples are provided to illustrate the applications of the proposed model and of the solution algorithm.
URI: http://hdl.handle.net/10397/14393
ISSN: 0965-8564
DOI: 10.1016/S0965-8564(00)00045-8
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

32
Last Week
0
Last month
3
Citations as of Sep 22, 2017

WEB OF SCIENCETM
Citations

17
Last Week
0
Last month
1
Citations as of Sep 16, 2017

Page view(s)

27
Last Week
1
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.