Forecasting intercity rail ridership using revealed preference and stated preference data

The aims of this paper i) to present a methodology for incorporating revealed preference (RP) and stated preference (SP) data in discrete choice models，ii) to apply the methodology to intercity travel mode choice analysis，and iii) to predict new mode shares for each O-D pair resulting from changes in service levels. The combined estimation technique with RP and SP data is developed to promote advantages of the two complementary data sources. The empirical study of intercity travel demand demonstrates the practicality of the methodology by accurately reproducing observed aggregate data and by applying a flexible operational prediction method

The Concept and Impact Analysis of a Flexible Mobility on Demand System

This paper introduces an innovative transportation concept called Flexible Mobility on Demand (FMOD), which provides personalized services to passengers. FMOD is a demand responsive system in which a list of travel options is provided in real-time to each passenger request. The system provides passengers with flexibility to choose from a menu that is optimized in an assortment optimization framework. For operators, there is flexibility in terms of vehicle allocation to di erent service types: taxi, shared-taxi and mini-bus. The allocation of the available fleet to these three services is carried out dynamically and based on demand and supply so that vehicles can change roles during the day. The FMOD system is built based on a choice model and consumer surplus is taken into account in order to improve the passenger satisfaction. Furthermore, pro fits of the operators are expected to increase since the system adapts to changing demand patterns. In this paper, we introduce the concept of FMOD and present preliminary simulation results that quantify the added value of this system.Fujitsu Laboratories funding under the OSP account 6925717 Fujitsu Laboratories funding under the OSP account 6927900 Fujitsu Laboratories funding under the OSP account 692960

Hybrid Choice Models: Progress and Challenges

We discuss the development of predictive choice models that go beyond the random utility model in its narrowest formulation. Such approaches incorporate several elements of cognitive process that have been identified as important to the choice process, including strong dependence on history and context, perception formation, and latent constraints. A flexible and practical hybrid choice model is presented that integrates many types of discrete choice modeling methods, draws on different types of data, and allows for flexible disturbances and explicit modeling of latent psychological explanatory variables, heterogeneity, and latent segmentation. Both progress and challenges related to the development of the hybrid choice model are presented.

Well-being and activity-based models

We present empirical and theoretical analyses to investigate the relationship between happiness (or subjective well-being) and activity participation and develop a framework for using well-being data to enhance activity-based travel demand models. The overriding hypothesis is that activities are planned and undertaken to satisfy needs so as to maintain or enhance subjective well-being. The empirical analysis consists of the development of a structural equations exploratory model of activity participation and happiness using data from a cross-sectional survey of a sample of commuters. The model reveals significant correlations between happiness and behavior for different types of activities: higher propensity of activity participation is associated with greater activity happiness and greater satisfaction with travel to the activity. The theoretical analysis consists of the development of a modeling framework and measures for the incorporation of well-being within activity-based travel demand models. The motivation is that activity pattern models have been specified in ad-hoc ways in practice as a function of mobility, lifestyle, and accessibility variables. We postulate that well-being is the ultimate goal of activity patterns which are driven by needs and propose two extensions of activity pattern models. The first extension consists of the use of well-being measures as indicators of the utility of activity patterns (in addition to the usual choice indicators) within a random utility modeling framework. The second extension models conceptually the behavioral process of activity generation based on needs satisfaction. We present an example of an operational activity pattern model and propose well-being measures for enhancing it.New England University Transportation Cente

Incorporating social interaction into hybrid choice models

The aim of this paper is to develop a methodological framework for the incorporation of social interaction effects into choice models. The developed method provides insights for modeling the effect of social interaction on the formation of psychological factors (latent variables) and on the decision-making process. The assumption is based on the fact that the way the decision maker anticipates and processes the information regarding the behavior and the choices exhibited in her/his social environment, affects her/his attitudes and perceptions, which in turn affect her/his choices. The proposed method integrates choice models with decision makers’ psychological factors and latent social interaction. The model structure is simultaneously estimated providing an improvement over sequential methods as it provides consistent and efficient estimates of the parameters. The methodology is tested within the context of a household aiming to identify the social interaction effects between teenagers and their parents regarding walking-loving behavior and then the effect of this on mode to school choice behavior. The sample consists of 9,714 participants aged from 12 to 18 years old, representing 21 % of the adolescent population of Cyprus. The findings from the case study indicate that if the teenagers anticipate that their parents are walking lovers, then this increases the probability of teenagers to be walking-lovers too and in turn to choose walking to school. Generally, the findings from the application result in: (a) improvements in the explanatory power of choice models, (b) latent variables that are statistically significant, and (c) a real-world behavioral representation that includes the social interaction effect

Using Data From the Web to Predict Public Transport Arrivals Under Special Events Scenarios

The Internet has become the preferred resource to announce, search, and comment about social events such as concerts, sports games, parades, demonstrations, sales, or any other public event that potentially gathers a large group of people. These planned special events often carry a potential disruptive impact to the transportation system, because they correspond to nonhabitual behavior patterns that are hard to predict and plan for. Except for very large and mega events (e.g., Olympic games, football world cup), operators seldom apply special planning measures for two major reasons: The task of manually tracking which events are happening in large cities is labor-intensive; and, even with a list of events, their impact is hard to estimate, especially when more than one event happens simultaneously. In this article, we utilize the Internet as a resource for contextual information about special events and develop a model that predicts public transport arrivals in event areas. In order to demonstrate the feasibility of this solution for practitioners, we apply off-the-shelf techniques both for Internet data collection and for the prediction model development. We demonstrate the results with a case study from the city-state of Singapore using public transport tap-in/tap-out data and local event information obtained from the Internet. Keywords: Data mining; Demand Prediction; Public Transport; Smartcard; Urban Computing; Web Minin

Cognitive Cost in Route Choice with Real-Time Information: An Exploratory Analysis

Real-time traffic information is increasingly available to support route choice decisions by reducing the travel time uncertainty. However it is likely that a traveler cannot assess all available information on all alternative routes due to time constraints and limited cognitive capacity. This paper presents a model that is consistent with a general network topology and can potentially be estimated based on revealed preference data. It explicitly takes into account the information acquisition and the subsequent path choice. The decision to acquire information is assumed to be based on the cognitive cost involved in the search and the expected benefit defined as the expected increase in utility after the search. A latent class model is proposed, where the decision to search or not to search and the depth of the search are latent and only the final path choices are observed. A synthetic data set is used for the purpose of validation and ease of illustration. The data are generated from the postulated cognitive-cost model, and estimation results show that the true values of the parameters can be recovered with enough variability in the data. Two other models with simplifying assumptions of no information and full information are also estimated with the same set of data with significantly biased path choice utility parameters. Prediction results show that a smaller cognitive cost encourages information search on risky and fast routes and thus higher shares on those routes. As a result, the expected average travel time decreases and the variability increases. The no-information and full-information models are extreme cases of the more general cognitive-cost model in some cases, but not generally so, and thus the increasing ease of information acquisition does not necessarily warrant a full-information model

Kalman Filter Applications for Traffic Management

An on­line calibration approach for dynamic traffic assignment systems has been developed. The approach is general and flexible and makes no assumptions on the type of the DTA system, the models or the data that it can handle. Therefore, it is applicable to a wide variety of tools including simulation­based and analytical, as well as microscopic and macroscopic models. The objective of the on­line calibration approach is to introduce a systematic procedure that will use the available data to steer the model parameters to values closer to the realized ones. The output of the on­line calibration is therefore a set of parameter values that --when used as input for traffic estimation and prediction-- minimizes the discrepancy between the simulated (estimated and predicted) and the observed traffic conditions. The scope of the on­line calibration is neither to duplicate nor to substitute for the off­line calibration process. Instead, the two processes are complementary and synergistic in nature. The on­line calibration problem is formulated as a state­space model. State­space models have been extensively studied and efficient algorithms have been developed, such as the Kalman Filter for linear models. Because of the non­linear nature of the on­line calibration formulation, modified Kalman Filter methodologies have been presented. The most straightforward extension is the Extended Kalman Filter (EKF), in which optimal quantities are approximated via first order Taylor series expansion (linearization) of the appropriate equations. The Limiting EKF is a variation of the EKF that eliminates the need to perform the most computationally intensive steps of the algorithm on­line. The use of the Limiting EKF provides dramatic improvements in terms of computational performance. The Unscented Kalman Filter (UKF) is an alternative filter that uses a deterministic sampling approach. The computational complexity of the UKF is of the same order as that of the EKF. Empirical results suggest that joint on­line calibration of demand and supply parameters can improve estimation and prediction accuracy of a DTA system. While the results obtained from this real network application are promising, they should be validated in further empirical studies. In particular, the scalability of the approach to larger, more complex networks needs to be investigated. The results also suggest that --in this application-- the EKF has more desirable properties than the UKF (which may be expected to have superior performance over the EKF), while the UKF seems to perform better in terms of speeds than in terms of counts. Other researchers have also encountered situations where the UKF does not outperform the EKF, e.g. LaViola, J. J., Jr. (2003) and van Rhijn et al. (2005). The Limiting EKF provides accuracy comparable to that of the best algorithm (EKF), while providing order(s) of magnitude improvement in computational performance. Furthermore, the LimEKF algorithm is that it requires a single function evaluation irrespective of the dimension of the state vector (while the computational complexity of the EKF and UKF algorithms increases proportionally with the state dimension). This property makes this an attractive algorithm for large­scale applications