Using the schedule-based approach, in which scheduled timetables are used to describe the movement of vehicles, a dynamic transit assignment model is formulated. Passengers are assumed to travel on a path with minimum generalized cost that consists of four components: in-vehicle time; waiting time; walking time; and a time penalty for each line change. A specially developed branch and bound algorithm is used to generate the time-dependent minimum path. The assignment procedure is conducted over a period in which both passenger demand and train headway are varying. This paper presents an overview of the research that has been carried out by the authors to develop the schedule-based transit assignment model, and offers perspectives for future research.

No abstract

In this paper, an aggregation approach is proposed for traffic flow prediction that is based on the moving average (MA), exponential smoothing (ES), autoregressive MA (ARIMA), and neural network (NN) models. The aggregation approach assembles information from relevant time series. The source time series is the traffic flow volume that is collected 24 h/day over several years. The three relevant time series are a weekly similarity time series, a daily similarity time series, and an hourly time series, which can be directly generated from the source time series. The MA, ES, and ARIMA models are selected to give predictions of the three relevant time series. The predictions that result from the different models are used as the basis of the NN in the aggregation stage. The output of the trained NN serves as the final prediction. To assess the performance of the different models, the naïve, ARIMA, nonparametric regression, NN, and data aggregation (DA) models are applied to the prediction of a real vehicle traffic flow, from which data have been collected at a data-collection point that is located on National Highway 107, Guangzhou, Guangdong, China. The outcome suggests that the DA model obtains a more accurate forecast than any individual model alone. The aggregation strategy can offer substantial benefits in terms of improving operational forecasting. Index Terms-Autoregressive moving average (ARIMA) model, data aggregation (DA), exponential smoothing (ES), moving average (MA), neural network (NN), time series, traffic flow prediction.

Asymptotic stability problem of a class of fuzzy cellular neural networks with unbounded distributed delays is studied. New stability criteria are derived by employing a Lyapunov-Krasovskii functional and using LMI approach. Numerical examples are provided to illustrate the effectiveness and less conservativeness of the developed techniques.

In this paper, reasonable paths in transit networks are defined as possible paths that satisfy the acceptable time criterion and transfer-walk criterion. A recursive algorithm for finding all of the reasonable paths in a transit network that does not involve a rapid increase in program run-time with network size is presented. Realistic transit networks in Hong Kong and Guangzhou were selected as case studies of the different phases of the development of a trip planning system. Transport planning practitioners and potential users were invited to test the system to evaluate its performance. The results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decisionmaking has been confirmed by the positive feedback that was obtained from survey questionnaires.

No abstract

Some asymptotic stability criteria are derived for systems of nonlinear functional differential equations with unbounded delays. The criteria are described as matrix equations or matrix inequalities, which are computationally flexible and efficient. The theories are then applied to the stabilization of time-delay systems via standard feedback control (SFC) or time-delayed feedback control (DFC). Several examples are given to illustrate the results.

No abstract