@article{sayyady_fathi_list_stone_2013, title={Locating Traffic Sensors on a Highway Network Models and Algorithms}, ISSN={["2169-4052"]}, DOI={10.3141/2339-04}, abstractNote={ This paper considers the problem of finding optimal sensor locations on a traffic network with the goal of characterizing system use overall. The problem is studied for two practical scenarios. In the first scenario, it is assumed that there is a given number of sensors (p) to be located on the highway network. In this context, the problem is to find a collection of p locations among a given collection of candidate locations. In the second scenario, it is assumed that there is a cost (ci) associated with installing a sensor at each candidate location i and a total budget b. In this context, the problem is to find a collection of locations that provide the best possible characterization given the budget constraint. A metric is proposed for evaluating a potential solution, and then appropriate mathematical models are proposed for solving the problem for each scenario. It is shown that the budget-constrained problem is an extension of the well-known p-median problem. A new Lagrangian heuristic algorithm is presented for solving large instances of this problem when a budget constraint is imposed. A comprehensive computational experiment is used to demonstrate that the Lagrangian heuristic algorithm provides solutions for large-scale networks within reasonable execution times. Examples are based on locating weigh-in-motion sensors on a large-scale highway network. }, number={2339}, journal={TRANSPORTATION RESEARCH RECORD}, author={Sayyady, Fatemeh and Fathi, Yahya and List, George F. and Stone, John R.}, year={2013}, pages={30–38} }
 @article{sayyady_stone_list_jadoun_kim_sajjadi_2011, title={Axle load distribution for mechanistic-empirical pavement design in North Carolina multidimensional clustering approach and decision tree development}, number={2256}, journal={Transportation Research Record}, author={Sayyady, F. and Stone, J. R. and List, G. F. and Jadoun, F. M. and Kim, Y. R. and Sajjadi, S.}, year={2011}, pages={159–168} }
 @article{sayyady_stone_taylor_jadoun_kim_2010, title={Clustering Analysis to Characterize Mechanistic-Empirical Pavement Design Guide Traffic Data in North Carolina}, ISSN={["2169-4052"]}, DOI={10.3141/2160-13}, abstractNote={ This paper presents attempts to generate regional average truck axle load distribution factors (ALFs), monthly adjustment factors (MAFs), hourly distribution factors (HDFs), and vehicle class distributions (VCDs) for North Carolina. The results support Mechanistic–Empirical Pavement Design Guide (MEPDG) procedures. Weigh-in-motion data support the analysis and generate seasonal factors. MEPDG damage-based sensitivity analysis shows that pavement performance is sensitive to North Carolina site-specific ALFs, MAFs, and VCDs. Similar results occur for national default values of ALF, MAF, and VCD. Hierarchical clustering analysis based on North Carolina ALFs and MAFs develops representative seasonal traffic patterns for different regions of the state. Findings show that seasonal truck traffic has distinct characteristics for the eastern coastal plain, the central Piedmont, and the western mountains. A simplified decision tree and a related table help the pavement designer select the proper representative patterns of ALF and MAF. To develop VCD factors, the approach uses 48–h classification counts and a seasonal factoring procedure to account for day-of-week and seasonal variations. The approach incorporates site-specific truck traffic to improve the accuracy of pavement design. On the basis of sensitivity analysis results, pavement performance is found to be insensitive to North Carolina site-specific and national default values of HDF; thus, the average statewide HDF values may be used as input to MEPDG. Specific contributions of this research are the relative insensitivity of pavement performance to HDF, the use of 48-h classification counts to estimate VCD inputs, and a decision tree and table to help pavement designers select the proper ALF and MAF inputs. }, number={2160}, journal={TRANSPORTATION RESEARCH RECORD}, author={Sayyady, Fatemeh and Stone, John R. and Taylor, Kent L. and Jadoun, Fadi M. and Kim, Y. Richard}, year={2010}, pages={118–127} }
 @article{eom_stone_kang_2010, title={Empirical case study of spatial-temporal student activity population}, number={2157}, journal={Transportation Research Record}, author={Eom, J. K. and Stone, J. R. and Kang, K.}, year={2010}, pages={11–21} }
 @article{eom_stone_ghosh_2009, title={Daily Activity Patterns of University Students}, volume={135}, ISSN={["1943-5444"]}, url={http://www.scopus.com/inward/record.url?eid=2-s2.0-75949111868&partnerID=MN8TOARS}, DOI={10.1061/(ASCE)UP.1943-5444.0000015}, abstractNote={This paper presents a comprehensive analysis of students’ activity characteristics and travel patterns based on the 2001 North Carolina State University Student Activity Travel Survey. Results show that undergraduate students and on-campus residents are engaged in more activities than graduate students and off-campus students. Graduate students are more likely to engage in class and work activity in the afternoon than in the morning. There is no statistically significant difference between student groups in terms of the proportion of students involved in a certain activity at a certain hour of the day. Instead, the types of activities are different across all 24 h of a day. The insights gained from this study will serve as the basis of an activity-based university travel demand model for North Carolina State University.}, number={4}, journal={JOURNAL OF URBAN PLANNING AND DEVELOPMENT}, author={Eom, Jin Ki and Stone, John R. and Ghosh, Sujit K.}, year={2009}, month={Dec}, pages={141–149} }
 @article{horner_stone_huntsinger_2008, title={Data reuse methods for transportation planning in small- and medium-sized towns}, volume={134}, DOI={10.1061/(ASCE)0733-9488(2008)134:4(149)}, abstractNote={Small and medium sized towns often lack resources for the data collection required by many transportation planning methods. In many cases, though, data from a regional or national source may be transferred to the small town or used in the form of national averages. We focus on the case of towns on the fringe of large metropolitan areas and compare various data reuse techniques. We defined a quantitative categorization method that indicates for a given town if local data transfer or national data transfer is preferable. The analysis is based on two surveys of North Carolina metropolitan areas and their surroundings (Charlotte and Raleigh-Durham) representing 5,000 households in 90 municipalities ranging in size from a few hundred population to half a million. Our results show that planners working in FRINGE towns can defensibly use the NCHRP 365 trip rates dictated by the nearby urban center, or existing trip rates derived from surveys of the urban center itself.}, number={4}, journal={Journal of Urban Planning and Development}, author={Horner, J. W. and Stone, J. R. and Huntsinger, L. F.}, year={2008}, pages={149–152} }
 @article{han_stone_2008, title={Synthesized through-trip models for small and medium urban areas}, number={2077}, journal={Transportation Research Record}, author={Han, Y. and Stone, J. R.}, year={2008}, pages={148–155} }
 @article{han_stone_huntsinger_2007, title={Manual traffic allocation for small-town networks}, number={1997}, journal={Transportation Research Record}, author={Han, Y. and Stone, J. R. and Huntsinger, L. F.}, year={2007}, pages={24–34} }
 @inbook{stone_baugh_chakravarty_surasky_2001, title={Winston-Salem mobility manager: Data collection, validation, and performance evaluation}, ISBN={0309072220}, DOI={10.3141/1760-15}, abstractNote={ The Winston-Salem Mobility Manager project has served as a test bed for advanced public transportation systems technology since 1995. The aspects of remote data collection, validation, and performance evaluation are discussed. The computerized scheduling software for Trans-AID, the local paratransit system, was accessed and passenger RIDE files were downloaded. Java-based utilities and conventional spreadsheets removed invalid data, sorted urban and rural passenger trips, and compared transit productivity measures. Validated Trans-AID data show relatively few data entry errors, some logical errors, and high time-window violations. Ridership, productivity, and service gains determined by intuitive assessment of traditional measures are not supported by statistical analysis. Rather, the results of t-tests suggest counterintuitive management actions to improve service and productivity. Internet-based methods of data collection, validation, and evaluation demonstrate promise for real-time transit management and agency monitoring. }, number={1760}, booktitle={Transit: Bus transit and maintenance: Rural paratransit technology: Capacity and quality of service}, publisher={Washington, DC: National Academy Press}, author={Stone, J. R. and Baugh, J. W. and Chakravarty, S. and Surasky, M. N.}, year={2001}, pages={114–120} }
 @inbook{stone_stevens_2000, title={Effectiveness of taxi partitions: Baltimore, Maryland case study}, ISBN={0309067383}, number={1731}, booktitle={Transit: Bus transit and maintenance: Rural paratransit technology: Capacity and quality of service}, publisher={Washington, DC: National Academy Press}, author={Stone, J. R. and Stevens, D. C.}, year={2000}, pages={71–78} }
 @inbook{stone_ahmed_nalevanko_2000, title={Internet-based decision support for advanced public transportation systems technology}, ISBN={0309067383}, number={1731}, booktitle={Transit: Bus transit and maintenance: Rural paratransit technology: Capacity and quality of service}, publisher={Washington, DC: National Academy Press}, author={Stone, J. R. and Ahmed, T. and Nalevanko, A.}, year={2000}, pages={63–67} }
 @article{baugh_kakivaya_stone_1998, title={Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing}, volume={30}, ISSN={["0305-215X"]}, url={http://www.scopus.com/inward/record.url?eid=2-s2.0-0031680443&partnerID=MN8TOARS}, DOI={10.1080/03052159808941240}, abstractNote={Abstract Numerous techniques for generating approximate solutions have been proposed in the last decade for routing and scheduling in multi-vehicle dial-a-ride problems. While some of these techniques have mathematical foundations, it is often difficult to assess the global optimality of the generated solution due to the use of pure local improvement methods. In additon, most of these methods are based on a single objective, such as minimization of the number of vehicles used, and cannot account for different or competing objectives that characterize the problem. This paper proves the intractability of the dial-a-ride problem, and then describes a new approximate method based on simulated annealing that is used to solve these problems in the presence of multiple objectives.}, number={2}, journal={ENGINEERING OPTIMIZATION}, author={Baugh, JW and Kakivaya, GKR and Stone, JR}, year={1998}, pages={91–123} }