{'fraction_non_alphanumeric': 0.017382413087934562, 'fraction_numerical': 0.007157464212678937, 'mean_word_length': 4.792899408284024, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Evaluation of Travel Time Variability in New Jersey Turnpike - A Case Study

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 from 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. 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 origin-destination (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 NEOS server, a common optimization solver available over the Internet. A simple heuristic for the proposed model is also presented