A dynamic linear model for the estimation of time‐varying origin–destination matrices from link counts

We propose a dynamic linear model (DLM) for the estimation of day‐to‐day time‐varying origin–destination (OD) matrices from link counts. Mean OD flows are assumed to vary over time as a locally constant model. We take into account variability in OD flows, route flows, and link volumes. Given a time series of observed link volumes, sequential Bayesian inference is applied in order to estimate mean OD flows. The conditions under which mean OD flows may be estimated are established, and computational studies on two benchmark transportation networks from the literature are carried out. In both cases, the DLM converged to the unobserved mean OD flows when given sufficient observations of traffic link volumes despite assuming uninformative prior OD matrices. We discuss limitations and extensions of the proposed DLM. Copyright © 2017 John Wiley & Sons, Ltd.     

A parking model hierarchy

The last decade has seen considerable developments in computer assisted design procedures which enable planners to investigate the impacts of changes in the transport system. These developments have become more available to analysts through the introduction of microcomputers and computer graphics. Unfortunately, the impacts of parking on the transport have not been incorporated explicitly in many of these models since their prime concern is the movement of traffic. Parking system design and policy analysis can, however, benefit greatly from these developments in computer technology and availability. The design of parking systems can be improved and the investigation of policy impacts can be trialed or refined prior to their introduction using microcomputer packages. This paper outlines some developments in these areas. More specifically, it outlines a hierarchy or microcomputer models and information systems that can investigate parking policy and study the level of service provided by parking systems.     

Measuring the energy efficiency for airlines under the pressure of being included into the EU ETS

In 2008, European Union (EU) announced that from 2012, each international flight taking off and landing in EU would be given an emission permit. Therefore, the period of 2008–2012 can be regarded as a buffer period for global airlines. Although EU formally decides to exclude non‐EU airlines from the EU Emission Trading System on March 4, 2014, it is necessary to investigate the impacts of the policy on airline energy efficiency in this period. Airline energy efficiency is divided into three stages—operations stage, service stage, and sales stage—and Greenhouse gas emission is treated as an undesirable output of service stage. Two models, network range‐adjusted measure model with weak disposability and network range‐adjusted measure model with strong disposability, are established to evaluate the efficiencies of 22 international airlines from 2008 to 2012. The results show that (i) most airlines' efficiencies have decreased in the period, and the EU Emission Trading System is not effective for the efficiency improvement; (ii) the average efficiency of European airlines is almost the same as that of non‐European airlines; and (iii) the model with weak disposability is more reasonable in distinguishing efficiency differences, while strong disposability is a more reasonable way in treating undesirable outputs. Copyright © 2016 John Wiley & Sons, Ltd.     

Train design features affecting boarding and alighting of passengers

Accurately predicting train dwell time is critical to running an effective and efficient service. With high‐density passenger services, large numbers of passengers must be able to board and alight the train quickly – and within scheduled dwell times. Using a specially constructed train mock‐up in a pedestrian movement laboratory, the experiments outlined in this paper examine the impact of train carriage design factors such as door width, seat type, platform edge doors and horizontal gap on the time taken by passengers to board and alight. The findings illustrate that the effectiveness of design features depends on whether there are a majority of passengers boarding or alighting. An optimum door width should be between 1.7 and 1.8 m. The use of a central pole and platform edge doors produced no major effects, but a 200 mm horizontal gap could increase the movement of passengers. There is no clear effect of the type of seats and neither the standbacks between 50, 300 and 500 mm. Further research will look for the relationship between the dwell time and the characteristics of passengers such as personal space. Copyright © 2017 John Wiley & Sons, Ltd.     

Urban traffic flow prediction: a spatio‐temporal variable selection‐based approach

Short‐term traffic flow prediction in urban area remains a difficult yet important problem in intelligent transportation systems. Current spatio‐temporal‐based urban traffic flow prediction techniques trend aims to discover the relationship between adjacent upstream and downstream road segments using specific models, while in this paper, we advocate to exploit the spatial and temporal information from all available road segments in a partial road network. However, the available traffic states can be high dimensional for high‐density road networks. Therefore, we propose a spatio‐temporal variable selection‐based support vector regression (VS‐SVR) model fed with the high‐dimensional traffic data collected from all available road segments. Our prediction model can be presented as a two‐stage framework. In the first stage, we employ the multivariate adaptive regression splines model to select a set of predictors most related to the target one from the high‐dimensional spatio‐temporal variables, and different weights are assigned to the selected predictors. In the second stage, the kernel learning method, support vector regression, is trained on the weighted variables. The experimental results on the real‐world traffic volume collected from a sub‐area of Shanghai, China, demonstrate that the proposed spatio‐temporal VS‐SVR model outperforms the state‐of‐the‐art. Copyright © 2015 John Wiley & Sons, Ltd.     

Optimizing one‐way traffic network reconfiguration and lane‐based non‐diversion routing for evacuation

Unfortunately, situations such as flood, hurricanes, chemical accidents, and other events occur frequently more and more. To improve the efficiency and practicality of evacuation management plan, an integrated optimization model of one‐way traffic network reconfiguration and lane‐based non‐diversion routing with crossing elimination at intersection for evacuation is constructed in this paper. It is an integrated model aiming at minimizing the network clearance time based on Cell Transmission Model. A hybrid algorithm with modified genetic algorithm and tabu search method is devised for approximating optimal problem solutions. To verify the effectiveness of the proposed model and solving method, two cases are illustrated in this paper. Through the first example, it can be seen that the proposed model and algorithm can effectively solve the integrated problems, and compared with the objective value of the original network, the network clearance time of the final solution reduces by 47.4%. The calculation results for the realistic topology and size network of Ningbo in China, which locates on the east coast of the Pacific Ocean, justify the practical value of the model and solution method, and solutions under different settings of reduction amount of merging cell capacity embody obvious differences. Copyright © 2015 John Wiley & Sons, Ltd.     

A GIS‐based traffic analysis zone design: technique

The main purpose of this paper is to develop an efficient method to design traffic analysis zones (TAZs), which is necessary for implementing a planning process with Geographic Information System (GIS) for Transportation (GIS‐T), using statistical spatial data analyses and GIS technology. The major roles of GIS in this method are: (1) to produce basic spatial units (BSUs) with topological data structure; (2) to integrate various procedures during the TAZ generation including computer program routines; and (3) to visualize the output of each TAZ generation. One of the most significant reasons for obtaining well‐defined TAZs is the fact that they are defined at the outset of transportation demand modeling, used from trip generation to trip assignment, and will ultimately affect transportation policy decisions.

Toward obtaining well‐defined TAZs, this paper concentrates on two important constraints: homogeneity and contiguity. Iterative partitioning technique is adopted to promote the optimum homogeneity of generated TAZs, while a contiguity checking algorithm is developed to ensure contiguous TAZs are generated by the iterative partitioning technique.