Bayesian predictive travel time methodology for advanced traveller information system

Travellers can benefit from the availability of point‐to‐point driving time estimates on a real time basis for making travel decisions such as route choice at strategic locations (e.g. junctions of major routes). This paper reports a predictive travel time methodology that features a Bayesian approach to fusing and updating information for use in advanced traveller information system. The methodology addresses the issue that data captured in real time on travel conditions becomes obsolete and has archival value only unless it is used as an input to a predictive travel time method for updating the information. The need for fusing real time data with other factors that influence travel time is defined and the concept of predictive travel time is discussed. The methodological framework and its components are advanced and an example application is provided for illustrating the fusion of data captured by infrastructure‐based and mobile technology with model‐based predictions in order to produce expected travel times. Copyright © 2010 John Wiley & Sons, Ltd.     

Optimal coordination of public-transit vehicles using operational tactics examined by simulation

This work focuses on improving transit-service reliability by optimally reducing the transfer time required in the operations of transit networks. Service reliability of public-transit operations is receiving increased attention as agencies are faced with immediate problems of proving credible service while attempting to reduce operating cost. Unreliable service has also been cited as the major deterrent to existing and potential passengers. Due to the fact that most of the public transit attributes are stochastic: travel time, dwell time, demand, etc., the passenger is likely to experience unplanned waiting times and ride times. One of the main components of service reliability is the use of transfers. Transfers have the advantages of reducing operational costs and introducing more flexible and efficient route planning. However its main drawback is the inconvenience of traveling multi-legged trips. This work introduces synchronized (timed) time-tables to diminish the waiting time caused by transfers. Their use, however, suffers from uncertainty about the simultaneous arrival of two (or more) vehicles at an existing stop. In order to alleviate the uncertainty of simultaneous arrivals, operational tactics such as hold, skip stop and short-turn can be deployed considering the positive and negative effects, of each tactic, on the total travel time. A dynamic programming model was developed for minimizing the total travel time resulting with a set of preferred tactics to be deployed. This work describes the optimization model using simulation for validation of the results attained. The results confirm the benefits of the model with 10% reduction of total travel time and more than 200% increase of direct transfers (transfers in which both vehicles arrive simultaneously to the transfer point).     

The role of volume-delay functions in forecasting and evaluating congestion charging schemes: the Stockholm case

This paper uses observations from before and during the Stockkholm congestion charging trial in order to validate and improve a transportation model for Stockholm. The model overestimates the impact of the charges on traffic volumes while at the same time it substantially underestimates the impact on travel times. These forecast errors lead to considerable underestimation of economic benefits which are dominated by travel time savings. The source of error lies in the static assignment that is used in the model. Making the volume-delay functions (VDFs) steeper only marginally improves the quality of forecast but strongly impacts the result of benefit calculations. We therefore conclude that the dynamic assignment is crucial for an informed decision on introducing measures aimed at relieving congestion. However, in the absence of such a calibrated dynamic model for a city, we recommend that at least a sensitivity analysis with respect to the slope of VDFs is performed.     

Integrated airline planning: Robust update of scheduling and fleet balancing under demand uncertainty

The airline schedule planning problem is defined as the sequence of decisions that need to be made to obtain a fully operational flight schedule. Historically, the airline scheduling problem has been sequentially solved. However, there have already been many attempts in order to obtain airline schedules in an integrated way. But due to tractability issues it is nowadays impossible to determine a fully operative and optimal schedule with an integrated model which accounts for all the key airline related aspects such as competitive effects, stochastic demand figures and uncertain operating conditions. Airlines usually develop base schedules, which are obtained much time in advance to the day of operations and not accounting for all the related uncertainty. This paper proposes a mathematical model in order to update base schedules in terms of timetable and fleet assignments while considering stochastic demand figures and uncertain operating conditions, and where robust itineraries are introduced in order to ameliorate miss-connected passengers. The proposed model leads to a large-scale problem which is difficult to be solved. Therefore, a novel improved and accelerated Benders decomposition approach is proposed. The analytical work is supported with case studies involving the Spanish legacy airline, IBERIA. The presented approach shows that the number of miss-connected passengers may be reduced when robust planning is applied.     

Modelling public transport on‐board congestion: comparing schedule‐based and agent‐based assignment approaches and their implications

Transit systems are subject to congestion that influences system performance and level of service. The evaluation of measures to relieve congestion requires models that can capture their network effects and passengers' adaptation. In particular, on‐board congestion leads to an increase of crowding discomfort and denied boarding and a decrease in service reliability. This study performs a systematic comparison of alternative approaches to modelling on‐board congestion in transit networks. In particular, the congestion‐related functionalities of a schedule‐based model and an agent‐based transit assignment model are investigated, by comparing VISUM and BusMezzo, respectively. The theoretical background, modelling principles and implementation details of the alternative models are examined and demonstrated by testing various operational scenarios for an example network. The results suggest that differences in modelling passenger arrival process, choice‐set generation and route choice model yield systematically different passenger loads. The schedule‐based model is insensitive to a uniform increase in demand or decrease in capacity when caused by either vehicle capacity or service frequency reduction. In contrast, nominal travel times increase in the agent‐based model as demand increases or capacity decreases. The marginal increase in travel time increases as the network becomes more saturated. Whilst none of the existing models capture the full range of congestion effects and related behavioural responses, existing models can support different planning decisions. Copyright © 2016 John Wiley & Sons, Ltd.     

Optimal stop spacing and headway of congested transit system considering realistic wait times

Abstract

This paper revisits the classical transit scheduling problem and investigates the relationship between stop spacing and headway, considering realistic wait time and operable transit capacity. Headway and stop spacing are important determinants for planning a transit system, which influence the service level as well as the cost of operation. A mathematical model is developed, and the objective function is user travel time which is minimized by the optimized stop spacing and headway, subject to the constraints of operable fleet size and route capacity. Optimal stop spacing and headway solutions are obtained in a numerical example. Sensitivity analysis is conducted, and the effect of model parameters on user travel time is explored.     

Passenger Perspectives in Railway Timetabling: A Literature Review

When looking at railway planning, a discrepancy exists between planners who focus on the train operations and publish fixed railway schedules, and passengers who look not only at the schedules but also at the entirety of their trip, from access to waiting to on-board travel and egress. Looking into this discrepancy is essential, as assessing railway performances by merely measuring train punctuality would provide an unfair picture of the level of service experienced by passengers. Firstly, passengers’ delays are often significantly larger than the train delays responsible for the passengers to be late. Secondly, trains’ punctuality is often strictly related to too tight schedules that in turn might translate into knock-on delays for longer dwelling times at stations, trip delays for increased risk of missing transfer connections, and uncertain assessment of the level of service experienced, especially with fluctuating passenger demand. A key aspect is the robustness of railway timetables. Empirical evidence indicates that passengers give more importance to travel time certainty than travel time reductions, as passengers associate an inherent disutility with travel time uncertainty. This disutility may be broadly interpreted as an anxiety cost for the need for having contingency plans in case of disruptions, and may be looked at as the motivator for the need for delay-robust railway timetables. Interestingly, passenger-oriented optimisation studies considering robustness in railway planning typically limit their emphasis on passengers to the consideration of transfer maintenance. Clearly, passengers’ travel behaviour is far more complex and multi-faceted and thus several other aspects should be considered, as becoming more and more evident from passenger surveys. The current literature review starts by looking at the parameters that railway optimisation/planning studies are focused on and the key performance indicators that impact railway planning. The attention then turns to the parameters influencing passengers’ perceptions and travel experiences. Finally, the review proposes guidelines on how to reduce the gap between the operators’ railway planning and performance measurement on the one hand and the passengers’ perception of the railway performance on the other hand. Thereby, the conclusions create a foundation for a more passenger-oriented railway timetabling ensuring that passengers are provided with the best service possible with the resources available.     

Essential elements in tactical planning models for container liner shipping

Tactical planning models for liner shipping problems such as network design and fleet deployment usually minimize the total cost or maximize the total profit subject to constraints including ship availability, service frequency, ship capacity, and transshipment. Most models in the literature do not consider slot-purchasing, multi-type containers, empty container repositioning, or ship repositioning, and they formulate the numbers of containers to transport as continuous variables. This paper develops a mixed-integer linear programming model that captures all these elements. It further examines from the theoretical point of view the additional computational burden introduced by incorporating these elements in the planning model. Extensive numerical experiments are conducted to evaluate the effects of the elements on tactical planning decisions. Results demonstrate that slot-purchasing and empty container repositioning have the largest impact on tactical planning decisions and relaxing the numbers of containers as continuous variables has little impact on the decisions.     

A comparison of accuracy and cost of attribute data in analysis of transit service areas using GIS

User oriented transit service is designed to meet the particular needs of a selected group of travelers. Transit Routes are located to provide convenient linkages between user's origin and destination in such a way that out-of-vehicle time, such as access and transfer time, is minimized. Planning transit routes requires understanding demographics, land use and travel patterns in an area. The dynamic nature of these systems necessitates regular review and analysis to insure that the transit system continues to meet the needs of the area it serves. Geographic Information Systems (GIS) provide a flexible framework for planning and analyzing transit routes and stops. Socioeconomic, demographic, housing, land use, and traffic data may be modeled in a GIS to identify efficient and effective corridors to locate routes. Part of the route location and analysis problem requires estimating population within the service area of a route. A route's service area is defined using walking distance or travel time. The problem of identifying service areas for park and ride or auto/bus users is not considered here, but assumed analogous to walk/bus trips. This paper investigates the accuracy and costs associated with the use of different attribute data bases to perform service area analysis for transit routes using GIS. A case study is performed for Logan, Utah, where a new fixed route service is operated. The case study illustrates the use of census data, postal data, data collected from aerial photographs, and data collected during a field survey using the network area analysis technique for transit service area analysis. This comparison allows us to describe the amount of error introduced by various spatial modeling techniques of data bases representing a variety of aggregation levels.     

Performance measure for reliable travel time of emergency vehicles

Travel time is very critical for emergency response and emergency vehicle (EV) operations. Compared to ordinary vehicles (OVs), EVs are permitted to break conventional road rules to reach the destination within shorter time. However, very few previous studies address the travel time performance of EVs. This study obtained nearly 4-year EV travel time data in Northern Virginia (NOVA) region using 76,000 preemption records at signalized intersections. First, the special characteristics of EV travel time are explored in mean, median, standard deviation and also the distribution, which display largely different characteristics from that of OVs in previous studies. Second, a utility-based model is proposed to quantify the travel time performance of EVs. Third, this paper further investigates two important components of the utility model: benchmark travel time and standardized travel time. The mode of the distribution is chosen as benchmark travel time, and its nonlinear decreasing relationship with the link length is revealed. At the same time, the distribution of standardized travel time is fitted with different candidate distributions and Inv. Gaussian distribution is proved to be the most suitable one. Finally, to validate the proposed model, we implement the model in case studies to estimate link and route travel time performance. The results of route comparisons also show that the proposed model can support EV route choice and eventually improve EV service and operations.     

Incorporating crowding into the San Francisco activity-based travel model

Information produced by travel demand models plays a large role decision making in many metropolitan areas, and San Francisco is no exception. Being a transit first city, one of the most common uses for San Francisco??s travel model SF-CHAMP is to analyze transit demand under various circumstances. SF-CHAMP v 4.1 (Harold) is able to capture the effects of several aspects of transit provision including headways, stop placement, and travel time. However, unlike how auto level of service in a user equilibrium traffic assignment is responsive to roadway capacity, SF-CHAMP Harold is unable to capture any benefit related to capacity expansion, crowding??s effect on travel time nor or any of the real-life true capacity limitations. The failure to represent these elements of transit travel has led to significant discrepancies between model estimates and actual ridership. Additionally it does not allow decision-makers to test the effects of policies or investments that increase the capacity of a given transit service. This paper presents the framework adopted into a more recent version of SF-CHAMP (Fury) to represent transit capacity and crowding within the constraints of our current modeling software.     

An activity-based approach for scheduling multimodal transit services

This paper proposes a new activity-based transit assignment model for investigating the scheduling (or timetabling) problem of transit services in multi-modal transit networks. The proposed model can be used to generate the short-term and long-term timetables of multimodal transit lines for transit operations and service planning purposes. The interaction between transit timetables and passenger activity-travel scheduling behaviors is captured by the proposed model, as the activity and travel choices of transit passengers are considered explicitly in terms of departure time choice, activity/trip chain choices, activity duration choice, transit line and mode choices. A heuristic solution algorithm which combines the Hooke–Jeeves method and an iterative supply–demand equilibrium approach is developed to solve the proposed model. Two numerical examples are presented to illustrate the differences between the activity-based approach and the traditional trip-based method, together with comparison on the effects of optimal timetables with even and uneven headways. It is shown that the passenger travel scheduling pattern derived from the activity-based approach is significantly different from that obtained by the trip-based method, and that a demand-sensitive (with uneven headway) timetable is more efficient than an even-headway timetable.     

Application of the support vector machine and heuristic k-shortest path algorithm to determine the most eco-friendly path with a travel time constraint

This study aims to determine an eco-friendly path that results in minimum CO₂ emissions while satisfying a specified budget for travel time. First, an aggregated CO₂ emission model for light-duty cars is developed in a link-based level using a support vector machine. Second, a heuristic k-shortest path algorithm is proposed to solve the constrained shortest path problem. Finally, the CO₂ emission model and the proposed eco-routing model are validated in a real-world network. Specifically, the benefit of the trade-off between CO₂ emission reduction and the travel time budget is discussed by carrying out sensitivity analysis on a network-wide scale. A greater spare time budget may enable the eco-routing to search for the most eco-friendly path with higher probability. Compared to the original routes selected by travelers, the eco-friendly routes can save an average of 11% of CO₂ emissions for the trip OD pairs with a straight distance between 6 km and 9 km when the travel time budget is set to 10% above the least travel time. The CO₂ emission can also be reduced to some degree for other OD pairs by using eco-routing. Furthermore, the impact of market penetration of eco-routing users is quantified on the potential benefit for the environment and travel-time saving.     

Path flow estimator for planning applications in small communities

This paper presents an alternative planning framework to model and forecast network traffic for planning applications in small communities, where limited resources debilitate the development and applications of the conventional four-step travel demand forecasting model. The core idea is to use the Path Flow Estimator (PFE) to estimate current and forecast future traffic demand while taking into account of various field and planning data as modeling constraints. Specifically, two versions of PFE are developed: a base year PFE for estimating the current network traffic conditions using field data and planning data, if available, and a future year PFE for predicting future network traffic conditions using forecast planning data and the estimated base year origin–destination trip table as constraints. In the absence of travel survey data, the proposed method uses similar data (traffic counts and land use data) as a four-step model for model development and calibration. Since the Institute of Transportation Engineers (ITE) trip generation rates and Highway Capacity Manual (HCM) are both utilized in the modeling process, the analysis scope and results are consistent with those of common traffic impact studies and other short-range, localized transportation improvement programs. Solution algorithms are also developed to solve the two PFE models and integrated into a GIS-based software called Visual PFE. For proof of concept, two case studies in northern California are performed to demonstrate how the tool can be used in practice. The first case study is a small community of St. Helena, where the city’s planning department has neither an existing travel demand model nor the budget for developing a full four-step model. The second case study is in the city of Eureka, where there is a four-step model developed for the Humboldt County that can be used for comparison. The results show that the proposed approach is applicable for small communities with limited resources.     

Development and validation of a direct mode choice model

A direct discrete mode choice model is introduced using relative attributes of competing modes as well as socioeconomic characteristics of travelers. The model is calibrated and validated for two available historic databases in the Dallas–Fort Worth region. The validation is conducted against the outputs of a current nested logit model used by the regional planning organization as well as the observed values based on transit ridership surveys for a newly inaugurated commuter rail service. The calibrated model is applied after the introduction of this new transit mode. The results show that the estimated mode shares by the proposed model have a statistically better consistency with the observed values than the estimates of the conventional nested logit model. Unlike the logit model, the structure of the direct model based on relative attributes also has the advantage of not needing recalibration each time a new travel mode is introduced. The model is found to be easier to calibrate and produces more accurate results than the nested logit model, commonly used by many metropolitan planning organizations.     

How do passengers use travel time? A case study of Shanghai–Nanjing high speed rail

Traditional travel behavior theory regards travel time as a waste. Recent studies suggest that it carries a positive utility, among other reasons for the benefit of the activities conducted while traveling. However, most studies of travel time use have focused on conventional trains in developed countries. Few have systematically examined the permeation of information and communication technology (ICT) into travel time use and the correlates of activity participation in developing countries, particularly on high speed rail (HSR). Using a survey conducted on the Shanghai–Nanjing corridor (N = 901), this study examines how HSR passengers use their travel time and explores the correlates of the different types of activities of business and non-business travelers, respectively, through multivariate probit models. We found that 96% of the respondents use ICT during their HSR journey and that most passengers spend some of their travel time on work-related activities. Moreover, items carried and advance planning as well as work-related travel attributes contribute significantly to activity participation. However, the factors affecting time use of business and non-business travelers differ. HSR service design should facilitate passenger engagement in various activities and improvement of their travel experience. A stable internet connection, adequate power sockets, and a noise-free environment will promote both work and leisure activities on the HSR.     

A stochastic multimodal reliable network design problem under adverse weather conditions

This paper formulates a network design problem (NDP) for finding the optimal public transport service frequencies and link capacity expansions in a multimodal network with consideration of impacts from adverse weather conditions. The proposed NDP aims to minimize the sum of expected total travel time, operational cost of transit services, and construction cost of link capacity expansions under an acceptable level of variance of total travel time. Auto, transit, bus, and walking modes are considered in the multimodal network model for finding the equilibrium flows and travel times. In the proposed network model, demands are assumed to follow Poisson distribution, and weather‐dependent link travel time functions are adopted. A probit‐based stochastic user equilibrium, which is based on the perceived expected travel disutility, is used to determine the multimodal route of the travelers. This model also considers the strategic behavior of the public transport travelers in choosing their routes, that is, common‐line network. Based on the stochastic multimodal model, the mean and variance of total travel time are analytical estimated for setting up the NDP. A sensitivity‐based solution algorithm is proposed for solving the NDP, and two numerical examples are adopted to demonstrate the characteristics of the proposed model. Copyright © 2014 John Wiley & Sons, Ltd.     

A multiobjective hierarchical model for locating public facilities on a transportation network: A goal programming approach

This paper introduces a Multiobjective Hierarchical Model (MOHLM) for locating public facilities on a transportation network. The proposed model combines the multiobjective nature of the location-allocation problem with the hierarchical character of some public service systems, such as health care delivery. The model examines both maximum and total weighted travel time, facility utilization, and total travel time from the master facility to the attached subordinate facilities. An iterative goal programing algorithm is used to solve the problem. An example related to the location of health care facilities in a rural area of Greece is used to illustrate the application of the proposed model.     

A model and solution algorithm for dynamic deterministic user equilibrium assignment

Abstract

In this paper a route-based dynamic deterministic user equilibrium assignment model is presented. Some features of the linear travel time model are first investigated and then a divided linear travel time model is proposed for the estimation of link travel time: it addresses the limitations of the linear travel time model. For the application of the proposed model to general transportation networks, this paper provides thorough investigations on the computational issues in dynamic traffic assignment with many-to-many OD pairs and presents an efficient solution procedure. The numerical calculations demonstrate that the proposed model and solution algorithm produce satisfactory solutions for a network of substantial size with many-to-many OD pairs. Comparisons of assignment results are also made to show the impacts of incorporation of different link travel time models on the assignment results.     

Modelling discretionary travel in the presence of imperfect data

The use of mathematical models in transportation and regional planning is limited by the need to obtain reasonably accurate, complete data sets. In particular complete spatial coverage is required for the usual discrete origin-destination models. Because of the time and cost constraints of obtaining such data, those charged with decision making responsibilities may choose to do without information that could be provided by quantitative models. This paper presents a procedure for estimating origin-constrained flows in situations where complete data collection is difficult or impossible. To this end an abstract model of origin-constrained travel is formulated. The required urban fields are constructed using interpolation and/or approximation techniques applied to available data. The tractability of the general model is demonstrated in the case of estimating the energy consumed in travel to existing or proposed facilities. The ability of the model to function with incomplete data was tested by using it to predict travel to the major retail centers located in the Albany-Schenectady-Troy Metropolitan Area.