Seattle smart traveler: dynamic ridematching on the World Wide Web

Seattle Smart Traveler (SST) is an application of World Wide Web (WWW) technology to test the concept of automated dynamic rideshare matching. In SST, the rideshare clientele interact with the rideshare system using only WWW pages. SST collects spatial and temporal trip information using a series of WWW pages, performs a match using structured query language (SQL) specifications to a database engine, and supports both the standard phone-based contact methodology as well as two new, unique e-mail-based contact methodologies. SST was operated in parallel to a traditional, regional rideshare system for one year, and the two systems were marketed to the user community on a side-by-side basis. SST and the traditional system acquired approximately the same number of new users over a nine-month test period; however, there was little overlap in the population using the two parallel systems. SST demonstrates that there is a user population that can be reached using Internet technologies for immediate/dynamic ridematching that is not reached by traditional ridematch programs. This paper also reports a new statistical model for quantifying rideshare matching and carpooling. The model is validated using the SST experimental results, and the model demonstrates that the carpooling process is a quadratic function of the number of users participating.     

A behavioral housing search model: Two-stage hazard-based and multinomial logit approach to choice-set formation and location selection

Residential location search has become an important topic to both practitioners and researchers as more detailed and disaggregate land-use and transportation demand models are developed which require information on individual household location decisions. The housing search process starts with an alternative formation and screening stage. At this level households evaluate all potential alternatives based on their lifestyle, preferences, and utilities to form a manageable choice set with a limited number of plausible alternatives. Then the final residential location is selected among these alternatives. This two-stage decision making process can be used for both aggregate zone-level selection as well as searching disaggregate parcel or building-based housing markets for potential dwellings. In this paper a zonal level household housing search model is developed. Initially, a household specific choice set is drawn from the entire possible alternatives in the area based on the average household work distance to each alternative. Following the choice set formation step, a discrete choice model is utilized for modeling the final residential zone selection of the household. A hazard-based model is used for the choice set formation module while the final choice selection is modeled using a multinomial logit formulation with a deterministic sample correction factor. The approach presented in the paper provides a remedy for the large choice set problem typically faced in housing search models.     

A mathematical programming technique for matching time-stamped records in logistics and transportation systems

Time-stamped data for transportation and logistics are essential for estimating times on transportation legs and times between successive stages in logistic processes. Often these data are subject to recording errors and omissions. Matches must then be inferred from the time stamps alone because identifying keys are unavailable, suppressed to preserve confidentiality, or ambiguous because of missing observations. We present an integer programming (IP) model developed for matching successive events in such situations and illustrate its application in three problem settings involving (a) airline operations at an airport, (b) taxi service between an airport and a train station, and (c) taxi services from an airport. With data from the third setting (where a matching key was available), we illustrate the robustness of estimates for median and mean times between events under different random rates for “failure to record”, different screening criteria for outliers, and different target times used in the IP objective. The IP model proves to be a tractable and informative tool for data matching and data cleaning, with a wide range of potential applications.     

Multi-agent simulation of individual mobility behavior in carpooling

Carpooling is an emerging alternative transportation mode that is eco-friendly and sustainable as it enables commuters to save time, travel resource, reduce emission and traffic congestion. The procedure of carpooling consists of a number of steps namely; (i) create a motive to carpool, (ii) communicate this motive with other agents, (iii) negotiate a plan with the interested agents, (iv) execute the agreed plans, and (v) provide a feedback to all concerned agents. In this paper, we present a conceptual design of an agent-based model (ABM) for the carpooling a that serves as a proof of concept. Our model for the carpooling application is a computational model that is used for simulating the interactions of autonomous agents and to analyze the effects of change in factors related to the infrastructure, behavior and cost. In our carpooling application, we use agent profiles and social networks to initiate our agent communication model and then employ a route matching algorithm, and a utility function to trigger the negotiation process between agents. We developed a prototype of our agent-based carpooling application based on the work presented in this paper and carried out a validation study of our results with real data collected in Flanders, Belgium.     

Modeling speed-flow relationship and merging behavior in work zone merging areas

This paper aims to investigate the speed-flow relationship and drivers’ merging behavior in work zone merging areas. It first proposes lane-based speed-flow models, incorporating traffic conflicts among the lanes. It proceeds to develop a desired merging location model determining where drivers start to consider merging and a binary logit model that is applied to estimate the probabilities that drivers will merge into current adjacent gaps. A merging distance model is also proposed to find the 85th percentile of the merging distance. Finally, real work zone traffic data in Singapore are used to calibrate and evaluate the developed models. The findings show that the speed-flow relationship in the through lane is affected by the merge lane traffic under uncongested circumstances. Satisfactory results indicate that the merging behavioral models can competently predict drivers’ merging behavior and that the merging distance model could provide accurate information for traffic engineers to calculate the merge lane length.     

清管器在输油管道中的运动规律研究

在分析清管物理模型的基础上,建立了清管器前段塞流动的特征参数计算模型、动态数学模型以及相应的数值计算方法,并进行了数值模拟。利用数学模拟方法可以计算清管过程中管线的压力分布,利用压力分布可以跟踪清管球在管线内的运行,这为混输管路的运行管理提供了理论依据。     

Modeling the impact of pre-trip information on commuter departure time and route choice

The objective of this paper is to investigate the impact of pre-trip information on auto commuters’ choice behavior. The analysis is based on an extensive home-interview survey of commuters in the Taichung metropolitan area in Taiwan. A joint model for route and departure time decisions with and without pre-trip information is formulated. The model specifications are developed for both the systematic and random components. In particular, econometric issues associated with specifying the random error structure are addressed for parameter estimation purposes. Insights into the effects of attributes are obtained through the analysis of the model's performance and estimated parameter values. A probit model form is used for the joint model, allowing the introduction of state dependence and correlation in the model specification. The results underscore the important relationship between the different characteristics and the propensity of commuter choice behavior under two scenarios, with and without pre-trip information.     

Analysis of Work Zone Traffic Behavior for Planning Applications

Abstract

Understanding work zone traffic behavior is important for the planning and operation of work zones. The objective of this paper is to develop a mathematical model of work zone traffic flow elements by analyzing the relationships between speed, flow, and density that can be used to estimate the capacity of work zones. Traffic flow data were collected from 22 work zone sites on South Carolina interstate highways. The scatter plots of the collected data demonstrate that the relationship between speed and density does not follow Greenshields’ linear model. A non-linear hyperbolic model was developed to describe the relationship between speed and density. Using this model the capacity of a work zone was estimated to be 1550 passenger cars per hour for 2-lane to 1-lane closures. Adjustments to this capacity value to consider other types of vehicle as well as the work zone intensity are provided. Highway agencies can use this estimated capacity along with anticipated traffic demand to schedule work zone operations to avoid long periods of over-saturation.

The tapered approach to work zone lane closures used by South Carolina is similar to methods used in work zones throughout the world. The authors believe that the methodology described in this paper for modeling work zone traffic as well as estimating work zone capacity is transferable to other countries. The conversion of actual volumes to passenger car equivalents may have to be modified due to the significant differences in traffic makeup between the United States and other countries.     

Exploration of route choice behavior with advanced traveler information using neural network concepts

A model of driver's route choice behavior under advanced traveler information system (ATIS) is developed based on data collected from learning experiments using interactive computer simulation. The experiment subjected drivers to 32 simulated days in which they were to choose between the freeway or a side road. A neural network model is used as a convenient modeling technique in this initial phase of the analysis. The results indicated that most subjects made route choices based mainly on their recent experiences. It was also demonstrated that route choice behaviors are related to the personal characteristics as well as the characteristics of the respective routes. Travel experiences have less effect on the choice of the side road compared to the freeway and the results indicate that the prediction accuracy of the model, the acceptance rate of advice, and the quality of advice are closely correlated. The model developed here was for advice consistently provided at a level of 75 percent accuracy. The paper concludes with a discussion of experimental limitations and suggestions for future research.     

Long distance truck tracking from advanced point detectors using a selective weighted Bayesian model

Truck flow patterns are known to vary by season and time-of-day, and to have important implications for freight modeling, highway infrastructure design and operation, and energy and environmental impacts. However, such variations cannot be captured by current truck data sources such as surveys or point detectors. To facilitate development of detailed truck flow pattern data, this paper describes a new truck tracking algorithm that was developed to estimate path flows of trucks by adopting a linear data fusion method utilizing weigh-in-motion (WIM) and inductive loop point detectors. A Selective Weighted Bayesian Model (SWBM) was developed to match individual vehicles between two detector locations using truck physical attributes and inductive waveform signatures. Key feature variables were identified and weighted via Bayesian modeling to improve vehicle matching performance. Data for model development were collected from two WIM sites spanning 26 miles in California where only 11 percent of trucks observed at the downstream site traversed the whole corridor. The tracking model showed 81 percent of correct matching rate to the trucks declared as through trucks from the algorithm. This high accuracy showed that the tracking model is capable of not only correctly matching through vehicles but also successfully filtering out non-through vehicles on this relatively long distance corridor. In addition, the results showed that a Bayesian approach with full integration of two complementary detector data types could successfully track trucks over long distances by minimizing the impacts of measurement variations or errors from the detection systems employed in the tracking process. In a separate case study, the algorithm was implemented over an even longer 65-mile freeway section and demonstrated that the proposed algorithm is capable of providing valuable insights into truck travel patterns and industrial affiliation to yield a comprehensive truck activity data source.     

An ontological model to support communications of situation-aware vehicles

In an Intelligent Transport System (ITS) environment, the communication component is of great importance to support interactions between vehicles and roadside infrastructure. Previous studies have focused on the physical capability and capacity of the communication technologies, but the equally important development of suitable and efficient semantic content for transmission received notably less attention. Ontology is one promising approach for context modelling in ubiquitous computing environments, and in the transport domain it can be used both for context modelling and semantic contents for vehicular communications. This paper explores the development of an ontological model implementing relative geo-semantic information messages to support vehicle-to-vehicle communications. The proposed ontology model contains classes, objects, their properties/relations as well as some functions and query templates to represent and update the information of dynamic vehicles, inter-vehicle interactions and behaviour. This model was developed through a scenario enabling the evaluation of traffic conflict resolution approaches, by implementing a set of decision-making processes for intelligent vehicles. Given the scope of the proposed ontology modelling, it shows how vehicular communications can be used to update each vehicle’s context model. This work can be easily extended for more complex interactions among vehicles and the infrastructure.     

Optimisation of parking guidance and information systems display configurations

Operators of parking guidance and information (PGI) systems often have difficulty in determining the best car park availability information to present to drivers in periods of high demand. This paper describes a behavioural model of parking choice incorporating drivers perceptions of waiting times at car parks based on PGI signs. This model was used to predict the influence of PGI signs on the overall performance of the traffic system.Relationships were developed for estimating the arrival rates at car parks based on trip patterns, driver characteristics, car park attributes as well as the car park availability information displayed on PGI signs. Drivers' perceptions of waiting times at car parks were assumed to be influenced by the PGI signs for observers of the signs and actual car park utilisation levels for non-observers. The model assumes that the choice of car park does not change after entering the city centre, even if conditions observed are different from those initially perceived.A mathematical programme was formulated to determine the optimal display PGI sign configuration to minimise queue lengths and vehicle kilometres of travel (VKT). The model was limited to off-street parking choices and illegal parking was not incorporated. A simple genetic algorithm was used to identify solutions that significantly reduced queue lengths and VKT compared with existing practices.These procedures were applied to an existing PGI system operating in Tama New Town near Tokyo. Significant reductions in queue lengths and VKT were predicted using the optimisation model. This would reduce traffic congestion and lead to various environmental benefits.     

Multimodal,multiclass stochastic dynamic traffic assignment for evaluating information provision strategies

A multimodal, multiclass stochastic dynamic traffic assignment model was developed to evaluate pre‐trip and enroute travel information provision strategies. Three different information strategies were examined: user optimum [UO], system optimum [SO] and mixed optimum [MO]. These information provision strategies were analyzed based on the levels of traffic congestion and market penetration rate for the information equipment. Only two modes, bus and car, were used for evaluating and calculating the modal split ratio. Several scenarios were analyzed using day‐to‐day and within day dynamic models. From the results analyzed, it was found that when a traffic manager provides information for drivers using the UO strategy and drivers follow the provided information absolutely, the total travel time may increases over the case with no information. Such worsening occurs when drivers switch their routes and face traffic congestion on the alternative route. This phenomenon is the 'Braess Paradox'.     

The influence of employer ridesharing programs on employee mode choice

Employer ridesharing programs and employee mode choice were analyzed using Southern California data. Problems in estimating the costs and benefits of employer ridesharing programs were identified. Surveyed firms used a wide variety of information to estimate employee mode split internally. Virtually all surveyed firms offered free or subsidized parking to some or all of their employees. Few responding firms estimated the cost of providing employee parking accurately, if at all. Despite these significant data limitations, factors influencing firm choice of employer ridesharing program components were identified. The influence of employer ridesharing programs on employee mode choice was modeled using weighted least squares logit regression analysis. Firm size was foung to be the single most important variable identified in the analysis. Larger firms were more likely to offer ridesharing incentives to their empolyees, and to report direct employer benefits from ridesharing. Alternative work hours hindered the formation of ridesharing arrangements in some cases. Relatively few firms promoted ridesharing on a purely voluntary basis. A private market for employer ridesharing services was found to exist, however. Personalized matching assistance may be a critical factor in developing more effective employer ridesharing programs. Parking pricing and supply control measures probably would have a larger impact on employee mode split overall. Parking management faces severe obstacles in implementation, some of which might be overcome through the more extensive provision of ridesharing services, such as personalized matching assistance. to employees at specific employment sites by their employers.     

Vehicle reidentification and travel time measurement on congested freeways

The paper presents an algorithm for matching individual vehicles measured at a freeway detector with the vehicles’ corresponding measurements taken earlier at another detector located upstream. Although this algorithm is potentially compatible with many vehicle detector technologies, the paper illustrates the method using existing dual-loop detectors to measure vehicle lengths. This detector technology has seen widespread deployment for velocity measurement. Since the detectors were not developed to measure vehicle length, these measurements can include significant errors. To overcome this problem, the algorithm exploits drivers’ tendencies to retain their positions within dense platoons. The otherwise complicated task of vehicle reidentification is carried out by matching these platoons rather than individual vehicles. Of course once a vehicle has been matched across neighboring detector stations, the difference in its arrival time at each station defines the vehicle’s travel time on the intervening segment.Findings from an application of the algorithm over a 1/3 mile long segment are presented herein and they indicate that a sufficient number of vehicles can be matched for the purpose of traffic surveillance. As such, the algorithm extracts travel time data without requiring the deployment of new detector technologies. In addition to the immediate impacts on traffic monitoring, the work provides a means to quantify the potential benefits of emerging detector technologies that promise to extract more detailed information from individual vehicles.     

Modeling Travel Time Under ATIS Using Mixed Linear Models

The objective of this paper is to model travel time when drivers are equipped with pre-trip and/or en-route real-time traffic information/advice. A travel simulator with a realistic network and real historical congestion levels was used as a data collection tool. The network included 40 links and 25 nodes. This paper presents models of the origin-to-destination travel time and en-route short-term route (link) travel time under five different types and levels of advanced traveler information systems (ATIS). Mixed linear models with the repeated observation's technique were used in both models. Different covariance structures (including the independent case) were developed and compared. The effect of correlation was found significant in both models. The trip travel time analysis showed that as the level of information increases (adding en-route to the pre-trip and advice to the advice-free information), the average travel time decreases. The model estimates show that providing pre-trip and en-route traffic information with advice could result in significant savings in the overall travel time. The en-route short-term (link) travel time analysis showed that the en-route short-term (link) information has a good chance of being used and followed. The short-term qualitative information is more likely to be used than quantitative information. Learning and being familiar with the system that provides the information decreases en-route short-term delay.     

Surveying commuter behavior: Designing motorist information systems

A “Motorist Information Survey” was conducted by University of Washington investigators as part of a project sponsored by the Washington State Department of Transportation (WSDOT) and the Federal Highway Administration under the State's Freeway Arterial Management Effort (FAME). This survey, with responses on 62 variables from 3, 893 Seattle commuters, gathered information about motorist behavior and decision processes, particularly as they relate to the design and delivery of motorist information. Results showed that motorists have greater flexibility as to the ime they leave work than the time they leave home, experience some stress during their commute, and most value saving commute time. Motorists are more likely to change their routes from work than from home, to divert to known routes sooner than to unknown routes, and to be influenced by traffic information, congestion, and time of day. Motorists prefer to receive traffic information before entering the freeway as traffic information has the greatest influence on route choice and departure time and all motorists rely most on commercial radio for receipt of traffic information and find it most useful. A majority of motorists want to see highway advisory radio developed first, followed by a phone hot-line, and a dedicated cable TV station.     

Stable ride-sharing matching for the commuters with payment design

Ride-sharing enables reduction of private car usage for commuting. This paper proposes a stable matching model for the ride-sharing which aims to minimize the travel cost of all commuters. A payment for the ride-sharing is designed considering the equity and incentive. An algorithm based on the deferred acceptance algorithm is proposed for the model. To verify the model and algorithm, cases with different scales are presented based on Dalian. The results illustrate that the compensation, time window and driver-to-rider ratios can affect the successful matching rate.

     

A probabilistic map matching method for smartphone GPS data

Smartphones have the capability of recording various kinds of data from built-in sensors such as GPS in a non-intrusive, systematic way. In transportation studies, such as route choice modeling, the discrete sequences of GPS data need to be associated with the transportation network to generate meaningful paths. The poor quality of GPS data collected from smartphones precludes the use of state of the art map matching methods. In this paper, we propose a probabilistic map matching approach. It generates a set of potential true paths, and associates a likelihood with each of them. Both spatial (GPS coordinates) and temporal information (speed and time) is used to calculate the likelihood of the data for a specific path. Applications and analyses on real trips illustrate the robustness and effectiveness of the proposed approach. Also, as an application example, a Path-Size Logit model is estimated based on a sample of real observations. The estimation results show the viability of applying the proposed method in a real route choice modeling context.     

Development of a differential route share model for railroad freight traffic

This paper summarizes work undertaken towards development and calibration of a model to predict the distribution of rail freight traffic among competing routes. The model is designed for use in analyzing the traffic effects of changes in the level-of-service on selected rail lines. The model predicts route shares based on the overall network configuration of each railroad participating in a given market. The model selects feasible routes, discards those routes which appear to be too circuitous or costly, and then assigns traffic to the remaining routes in accordance with several network characteristics. It is designed to be sensitive to level-of-service changes, and to simulate the response of shippers and railroads to a competitive environment. A multiple route-finding algorithm was used to find possible routes based on the number of railroads operating at the originating and terminating end of a market. Multiple routes were determined and matched with observed traffic flows from the ICC One-Percent Waybill Sample. Physical network characteristics for each route, including distance, junction frequency, and “impedance,” were calculated from the network model and were correlated with the traffic share observed on each route in the market. A two-stage model was developed to find feasible routes from the set of possible routes and to allocate traffic to feasible routes based on levels-of-service. The model was calibrated on 9,793 routes from 1,199 markets with twenty or more carloads from the 1977 One-Percent Carload Waybill Sample. Model calibration supported the hypothesis that network route characteristics did indeed influence shipper choice of route, and that a normative model could be used to assess relative attractiveness of routes under various railroad corporate ownership restructuring scenarios.