A rolling horizon algorithm for auto-carrier transportation

This paper introduces a rolling horizon algorithm to plan the delivery of vehicles to automotive dealers by a heterogeneous fleet of auto-carriers. The problem consists in scheduling the deliveries over a multiple-day planning horizon during which requests for transportation arrive dynamically. In addition, the routing of the auto-carriers must take into account constraints related to the loading of the vehicles on the carriers. The objective is to minimize the sum of traveled distances, fixed costs for auto-carrier operation, service costs, and penalties for late deliveries. The problem is solved by a heuristic that first selects the vehicles to be delivered in the next few days and then optimizes the deliveries by an iterated local search procedure. A branch-and-bound search is used to check the feasibility of the loading. To handle the dynamic nature of the problem, the complete algorithm is applied repeatedly in a rolling horizon framework. Computational results on data from a major European logistics service provider show that the heuristic is fast and yields significant improvements compared to the sequential solution of independent daily problems.     

A generic data assimilation framework for vehicle trajectory reconstruction on signalized urban arterials using particle filters

With trajectory data, a complete microscopic and macroscopic picture of traffic flow operations can be obtained. However, trajectory data are difficult to observe over large spatiotemporal regions—particularly in urban contexts—due to practical, technical and financial constraints. The next best thing is to estimate plausible trajectories from whatever data are available. This paper presents a generic data assimilation framework to reconstruct such plausible trajectories on signalized urban arterials using microscopic traffic flow models and data from loops (individual vehicle passages and thus vehicle counts); traffic control data; and (sparse) travel time measurements from whatever source available. The key problem we address is that loops suffer from miss- and over-counts, which result in unbounded errors in vehicle accumulations, rendering trajectory reconstruction highly problematic. Our framework solves this problem in two ways. First, we correct the systematic error in vehicle accumulation by fusing the counts with sparsely available travel times. Second, the proposed framework uses particle filtering and an innovative hierarchical resampling scheme, which effectively integrates over the remaining error distribution, resulting in plausible trajectories. The proposed data assimilation framework is tested and validated using simulated data. Experiments and an extensive sensitivity analysis show that the proposed method is robust to errors both in the model and in the measurements, and provides good estimations for vehicle accumulation and vehicle trajectories with moderate sensor quality. The framework does not impose restrictions on the type of microscopic models used and can be naturally extended to include and estimate additional trajectory attributes such as destination and path, given data are available for assimilation.     

Method for investigating intradriver heterogeneity using vehicle trajectory data: A Dynamic Time Warping approach

After first extending Newell’s car-following model to incorporate time-dependent parameters, this paper describes the Dynamic Time Warping (DTW) algorithm and its application for calibrating this microscopic simulation model by synthesizing driver trajectory data. Using the unique capabilities of the DTW algorithm, this paper attempts to examine driver heterogeneity in car-following behavior, as well as the driver’s heterogeneous situation-dependent behavior within a trip, based on the calibrated time-varying response times and critical jam spacing. The standard DTW algorithm is enhanced to address a number of estimation challenges in this specific application, and a numerical experiment is presented with vehicle trajectory data extracted from the Next Generation Simulation (NGSIM) project for demonstration purposes. The DTW algorithm is shown to be a reasonable method for processing large vehicle trajectory datasets, but requires significant data reduction to produce reasonable results when working with high resolution vehicle trajectory data. Additionally, singularities present an interesting match solution set to potentially help identify changing driver behavior; however, they must be avoided to reduce analysis complexity.     

Multiple criteria optimization method for the vehicle assignment problem in a bus transportation company

A vehicle assignment problem (VAP) in a road, long‐haul, passenger transportation company with heterogeneous fleet of buses is considered in the paper. The mathematical model of the VAP is formulated in terms of multiobjective, combinatorial optimization. It has a strategic, long‐term character and takes into account four criteria that represent interests of both passengers and the company's management. The decision consists in the definition of weekly operating frequency (number of rides per week) of buses on international routes between Polish and Western European cities. The VAP is solved in a step‐wise procedure. In the first step a sample of efficient (Pareto‐optimal) solutions is generated using an original metaheuristic method called Pareto Memetic Algorithm (PMA). In the second step this sample is reviewed and evaluated by the Decision Maker (DM). In this phase an interactive, multiple criteria analysis method with graphical facilities, called Light Beam Search (LBS), is applied. The method helps the DM to define his/her preferences, direct the search process and select the most satisfactory solution.     

A new methodology for vehicle trajectory reconstruction based on wavelet analysis

Vehicle trajectories with high spatial and temporal resolution are known as the most ideal source of data for developing innovative microscopic traffic models. Aside from the method applied for collecting the vehicle trajectories, such data are more or less error-infected. The ever-increasing noise amplitude during the process of deriving the data (such as speed and acceleration) required for developing models, might change or even hide the structure of data and lead to useful information being overlooked. This highlights the importance of presenting the efficient methods which are adequate to remove noise and enhance the quality of vehicle trajectory data. Accordingly, in this paper a simple two-step technique based on wavelet analysis has been recommended for filtering errors and reconstructing trajectory data. Primarily, by using wavelet transform a special treatment was employed to identify and modify the outliers. Next, the noise in trajectory data was eliminated by applying the wavelet-based filter. The results of applying the proposed method to the synthetic noise-infected trajectory and the NGSIM dataset reveal how appropriate its performance is compared with other methodologies in terms of quantitative criteria.     

A Bayesian network approach for population synthesis

Agent-based micro-simulation models require a complete list of agents with detailed demographic/socioeconomic information for the purpose of behavior modeling and simulation. This paper introduces a new alternative for population synthesis based on Bayesian networks. A Bayesian network is a graphical representation of a joint probability distribution, encoding probabilistic relationships among a set of variables in an efficient way. Similar to the previously developed probabilistic approach, in this paper, we consider the population synthesis problem to be the inference of a joint probability distribution. In this sense, the Bayesian network model becomes an efficient tool that allows us to compactly represent/reproduce the structure of the population system and preserve privacy and confidentiality in the meanwhile. We demonstrate and assess the performance of this approach in generating synthetic population for Singapore, by using the Household Interview Travel Survey (HITS) data as the known test population. Our results show that the introduced Bayesian network approach is powerful in characterizing the underlying joint distribution, and meanwhile the overfitting of data can be avoided as much as possible.     

Naturalistic driving data collection to investigate into the effects of road geometrics on track behaviour

Road designers assume that drivers will follow the road alignment with trajectories centred in the lane, and move at the design speed parallel to the road centreline (i.e., the horizontal alignment). Therefore, they assume that if the horizontal alignment indicates the “designed trajectory”, the driving path indicates the “operating trajectory”. However, at present, they do not have the necessary tools to measure the relationship between the designed alignment and possible vehicle trajectories.The paper has two objectives: (a) to develop an understanding of the root causes of differences between road alignment and vehicle trajectories; and (b) to define and calibrate a model that estimates the local curvature of trajectories on the basis of the designed horizontal alignment.The two objectives were pursued by carrying out a naturalistic survey using vehicles equipped with high precision GPS in real-time kinematics (RTK) mode driven by test drivers on road sections of known geometric characteristics. The results provide an insight into the effects of road geometrics on driver behaviour, thus anticipating possible driving errors or unexpected/undesired behaviours, information which can then be used to correct possible inconsistencies when making decisions at the design stage.     

Determining optimal frequency and vehicle capacity for public transit routes: A generalized newsvendor model

The level of service on public transit routes is very much affected by the frequency and vehicle capacity. The combined values of these variables contribute to the costs associated with route operations as well as the costs associated with passenger comfort, such as waiting and overcrowding. The new approach to the problem that we introduce combines both passenger and operator costs within a generalized newsvendor model. From the passenger perspective, waiting and overcrowding costs are used; from the operator’s perspective, the costs are related to vehicle size, empty seats, and lost sales. Maximal passenger average waiting time as well as maximal vehicle capacity are considered as constraints that are imposed by the regulator to assure a minimal public transit service level or in order to comply with other regulatory considerations. The advantages of the newsvendor model are that (a) costs are treated as shortages (overcrowding) and surpluses (empty seats); (b) the model presents simultaneous optimal results for both frequency and vehicle size; (c) an efficient and fast algorithm is developed; and (d) the model assumes stochastic demand, and is not restricted to a specific distribution. We demonstrate the usefulness of the model through a case study and sensitivity analysis.     

A fuzzy method for predicting the demand for rail freight transportation

The demand for rail freight transportation is a continuously changing process over space and time and is affected by many quantitative and qualitative factors. In order to develop a more rational transport planning process to be followed by railway organizations, there is a need to accurately forecast freight demand under a dynamic and uncertain environment. In conventional linear regression analysis, the deviations between the observed and the estimated values are supposed to be due to observation errors. In this paper, taking a different perspective, these deviations are regarded as the fuzziness of the system's structure. The details of fuzzy linear regression method are put forward and discussed in the paper. Based on an analyzes of the characteristics of the rail transportation problem, the proposed model was successfully applied to a real example from China. The results of that application are also presented here.     

A land use and transportation integration method for land use allocation and transportation strategies in China

In this paper, we will first review literature of the land use and transportation interaction and then develop a new land use allocation methodology called Three Stages-Two-Feedback Method (Integration Method) for both land use allocation and the transportation policy options with a practical implementation. Then we apply this method in an urban general planning project in China with more than 1.2 million populations. In this project, we evaluated three land use allocation strategies and three transportation policy options using two application tools (with and without feedbacks) using this method implemented in a land use planning system UPlan and a transportation planning system Emme. The results show that the use of the feedback method (Application Two) results in a vehicle distance reduction and the increase in the service coverage area of transit bus stops at the same time. Due to the use of transportation accessibility and the congestion measures with a MSA implementation, the accessibility measure shows a convergent process over iterations. This nice feature can be used for alternative comparisons. Future research subjects are also discussed.     

Development of computerized vehicle scheduling system for specialized transportation: delaware case

A computer‐aided vehicle scheduling system is developed for Delaware's state‐wide specialized transportation system for elderly and handicapped persons. This paper presents the model, computer program package, system implementation, evaluation and the lessons learned from the project. The project which spanned two and a half years consists of five phases: (1) examine the manual method of vehicle scheduling (prior to the computerization); (2) develop a scheduling model; (3) develop a computer program package for the operation of the model; (4) install and operate the system; and (5) evaluate the system performance. The scheduling model consolidates passengers by block of time, origin and destination zones and along the direction of vehicle travel, first; second, minimizes the empty vehicle travel; and, lastly, assigns drivers to route considering assignment priority among the types of drivers and passengers. The product of the model is a set of driver log‐sheets which specify the sequence of passenger pick‐ups and drop‐offs. The computer program package includes necessary auxiliary data management functions such as registration of trip reservation, operating statistics and parameter value changes, as well as the execution of the model. It also allows the dispatcher to override the computer generated log‐sheet based on his discretion. The system has been operational for more than one year and it has brought about a number of changes in the operation and the role of the dispatcher. A before‐and‐after comparison of the operation and the lessons learned are also shown.     

On the assessment of vehicle trajectory data accuracy and application to the Next Generation SIMulation (NGSIM) program data

Trajectories drawn in a common reference system by all the vehicles on a road are the ultimate empirical data to investigate traffic dynamics. The vast amount of such data made freely available by the Next Generation SIMulation (NGSIM) program is therefore opening up new horizons in studying traffic flow theory. Yet the quality of trajectory data and its impact on the reliability of related studies was a vastly underestimated problem in the traffic literature even before the availability of NGSIM data. The absence of established methods to assess data accuracy and even of a common understanding of the problem makes it hard to speak of reproducibility of experiments and objective comparison of results, in particular in a research field where the complexity of human behaviour is an intrinsic challenge to the scientific method. Therefore this paper intends to design quantitative methods to inspect trajectory data. To this aim first the structure of the error on point measurements and its propagation on the space travelled are investigated. Analytical evidence of the bias propagated in the vehicle trajectory functions and a related consistency requirement are given. Literature on estimation/filtering techniques is then reviewed in light of this requirement and a number of error statistics suitable to inspect trajectory data are proposed. The designed methodology, involving jerk analysis, consistency analysis and spectral analysis, is then applied to the complete set of NGSIM databases.     

Granger-causality between transportation and GDP: A panel data approach

This paper investigates the Granger-causality relationship between income and transportation of EU-15 countries using a panel data set covering the period 1970–2008. In the study, inland freight transportation per capita in ton-km (TRP), inland passenger transportation per capita in passenger-km (PAS), and road sector gasoline fuel consumption per capita in kg of oil equivalent (GAS) are used as transportation proxies and GDP per capita is used as measure of income. Our findings indicate that the dominant type of Granger-causality is bidirectional. Instances of one-way or no Granger-causality were found to correspond with countries with the lowest income per capita ranks in 1970 and/or in 2008. Although we conclude that there is an endogenous relationship between income and transportation, this is not observed until after an economy has completed its transition in terms of economic development.     

Methods for pre-processing smartcard data to improve data quality

In recent years smartcards have been implemented in many transit systems around the world as a means by which passengers pay for travel. In addition to allowing speedier boardings there are many secondary benefits of smartcard systems including better understanding of travel patterns and behaviour of travellers. Such research is dependent on the smartcard correctly recording the boarding stop, and where available the alighting stop. It is also dependent on the smartcard system correctly aggregating individual rides into trips.This paper identifies causes for why smartcard systems may not correctly record such information. The first contribution of the paper is to propose a set of rules to aggregate individual rides into a single trip. This is critical in the research of activity based modelling as well as for correctly charging the passenger. The second contribution of the paper is to provide an approach to identify erroneous tap-out data, either caused by system problems or by the user. An approach to detecting this phenomenon is provided. The output from this analysis is then used to identify faulty vehicles or data supply using the “comparison against peers approach”. This third contribution of the paper identifies where transit agencies and operators should target resources to improve performance of their Automatic Vehicle Location systems. This method could also be used to identify users who appear to be tapping out too early.The approaches are tested using smartcard data from the Singapore public transport network from one week in April 2011. The results suggest that approximately 7.7% of all smartcard rides recorded the passenger as alighting one stop before the bus stop that they most probably alighted at. A further 0.7% of smartcard rides recorded the passenger as alighting more than one stop before the bus stop that they most probably alighted at. There was no evidence that smartcards overestimated the distance travelled by the passenger.     

Methods of analysis for vehicle soak time data

Vehicle soak time, the duration of time a vehicle’s engine is at rest prior to being started, and its distribution function are important transportation activity data inputs for mobile emissions inventory estimation due to their impacts on vehicle start and evaporative emissions. This paper provides vehicle emission researchers with an overview of statistical analysis methods relevant to analyzing vehicle soak time data. Many of these methods are already in use in emissions research and have appeared in the literature. These methods are reviewed and further details regarding the implementation and interpretation of these methods are provided. Statistical methods relevant to the analysis of soak time data that have yet to appear in the emissions literature, including kernel density estimation and generalized linear models, are also introduced. Advantages and disadvantages of the methods are compared and theoretical justification is provided. Issues of correlated observations and censored data are discussed. General guidelines for the analysis of soak time data, such as stratification by start type and geographical region, are established. Finally, a subset of the statistical methods discussed is used to analyze the US Environmental Protection Agency’s 3-city data.     

Assessing the importance of transportation activity data for urban emission inventories

The aim of this research is the implementation of a GPS-based modelling approach for improving the characterization of vehicle speed spatial variation within urban areas, and a comparison of the resulting emissions with a widely used approach to emission inventory compiling. The ultimate goal of this study is to evaluate and understand the importance of activity data for improving the road transport emission inventory in urban areas. For this purpose, three numerical tools, namely, (i) the microsimulation traffic model (VISSIM); (ii) the mesoscopic emissions model (TREM); and (iii) the air quality model (URBAIR), were linked and applied to a medium-sized European city (Aveiro, Portugal). As an alternative, traffic emissions based on a widely used approach are calculated by assuming a vehicle speed value according to driving mode. The detailed GPS-based modelling approach results in lower total road traffic emissions for the urban area (7.9, 5.4, 4.6 and 3.2% of the total PM10, NO_x, CO and VOC daily emissions, respectively). Moreover, an important variation of emissions was observed for all pollutants when analysing the magnitude of the 5th and 95th percentile emission values for the entire urban area, ranging from −15 to 49% for CO, −14 to 31% for VOC, −19 to 46% for NO_x and −22 to 52% for PM10. The proposed GPS-based approach reveals the benefits of addressing the spatial and temporal variability of the vehicle speed within urban areas in comparison with vehicle speed data aggregated by a driving mode, demonstrating its usefulness in quantifying and reducing the uncertainty of road transport inventories.     

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.     

Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach

This paper proposes a global optimization algorithm for solving a mixed (continuous/discrete) transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both expansion of existing links and addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. In this paper, we first formulate the UE condition as a variational inequality (VI) problem, which is defined from a finite number of extreme points of a link-flow feasible region. The MNDP is approximated as a piecewise-linear programming (P-LP) problem, which is then transformed into a mixed-integer linear programming (MILP) problem. A global optimization algorithm based on a cutting constraint method is developed for solving the MILP problem. Numerical examples are given to demonstrate the efficiency of the proposed method and to compare the results with alternative algorithms reported in the literature.     

Recent applications of big data analytics in railway transportation systems: A survey

Big data analytics (BDA) has increasingly attracted a strong attention of analysts, researchers and practitioners in railway transportation and engineering. This urges the necessity for a review of recent research development in this field. This survey aims to provide a comprehensive review of the recent applications of big data in the context of railway engineering and transportation by a novel taxonomy framework, proposed by Mayring (2003). The survey covers three areas of railway transportation where BDA has been applied, namely operations, maintenance and safety. Also, the level of big data analytics, types of big data models and a variety of big data techniques have been reviewed and summarized. The results of this study identify the existing research gaps and thereby directions of future research in BDA in railway transportation systems.