Abstract
This paper deals with a case study where the objective is to identify the optimal subset of routes for real-time traveler information in a highway network. It is assumed that the benefit of providing this information is directly related to the uncertainty of route travel times. The variance of travel times within a time period over consecutive days is employed as the indicator of this uncertainty. The New Jersey Turnpike is used as the study network due to the availability of vehicle-by-vehicle network-specific data. The data set covers travel times between ∼630 origindestination (OD) pairs during 2004. The problem of identifying the optimal number of subset of routes is modeled as a nonlinear integer-programming problem. The proposed model is then solved using the Network-Enabled Optimization Software server, which is a common optimization solver that is available over the Internet. A simple heuristic for the proposed model is also presented.
Original language | English (US) |
---|---|
Article number | 5247074 |
Pages (from-to) | 225-231 |
Number of pages | 7 |
Journal | IEEE Transactions on Intelligent Transportation Systems |
Volume | 11 |
Issue number | 1 |
DOIs | |
State | Published - Mar 2010 |
Keywords
- Integer programming
- Traffic transportation
- Travel time
- Travel time variability
- Traveler information systems
ASJC Scopus subject areas
- Automotive Engineering
- Mechanical Engineering
- Computer Science Applications