Travel time variability and airport accessibility

We analyze the cost of access travel time variability for air travelers. Reliable access to airports is important since the cost of missing a flight is likely to be high. First, the determinants of the preferred arrival times at airports are analyzed. Second, the willingness to pay (WTP) for reductions in access travel time, early and late arrival time at the airport, and the probability to miss a flight are estimated, using a stated choice experiment. The results indicate that the WTPs are relatively high. Third, a model is developed to calculate the cost of variable travel times for representative air travelers going by car, taking into account travel time cost, scheduling cost and the cost of missing a flight using empirical travel time data. In this model, the value of reliability for air travelers is derived taking “anticipating departure time choice” into account, meaning that travelers determine their departure time from home optimally. Results of the numerical exercise show that the cost of access travel time variability for business travelers are between 0% and 30% of total access travel cost, and for non-business travelers between 0% and 25%. These numbers depend strongly on the time of the day.     

Travel time estimation from sparse floating car data with consistent path inference: A fixed point approach

Estimation of urban network link travel times from sparse floating car data (FCD) usually needs pre-processing, mainly map-matching and path inference for finding the most likely vehicle paths that are consistent with reported locations. Path inference requires a priori assumptions about link travel times; using unrealistic initial link travel times can bias the travel time estimation and subsequent identification of shortest paths. Thus, the combination of path inference and travel time estimation is a joint problem. This paper investigates the sensitivity of estimated travel times, and proposes a fixed point formulation of the simultaneous path inference and travel time estimation problem. The methodology is applied in a case study to estimate travel times from taxi FCD in Stockholm, Sweden. The results show that standard fixed point iterations converge quickly to a solution where input and output travel times are consistent. The solution is robust under different initial travel times assumptions and data sizes. Validation against actual path travel time measurements from the Google API and an instrumented vehicle deployed for this purpose shows that the fixed point algorithm improves shortest path finding. The results highlight the importance of the joint solution of the path inference and travel time estimation problem, in particular for accurate path finding and route optimization.     

Bottleneck model revisited: An activity-based perspective

The timing of commuting trips made during morning and evening peaks has typically been investigated using Vickrey’s bottleneck model. However, in the conventional trip-based approach, the decisions that commuters make during the day about their activity schedules and time use are not explicitly considered. This study extends the bottleneck model to address the scheduling problem of commuters’ morning home-to-work and evening work-to-home journeys by using an activity-based approach. A day-long activity-travel scheduling model is proposed for the simultaneous determination of departure times for morning and evening commutes, together with allocations of time during the day among travel and activities undertaken at home or at the workplace. The proposed model maximizes the total net utility of the home-based tour, which is the difference between the benefits derived from participating in activities and the disutility incurred by travel between activity locations. The properties of the model solution are analytically explored and compared with the conventional bottleneck model for a special case with constant marginal-activity utility. For the case with linear marginal-activity utility, we develop a heuristic procedure to seek the equilibrium scheduling solution. We also explore the effects of marginal-work utility (or the employees’ average wage level) and of flexible work-hour schemes on the scheduling problem in relation to the morning and evening commuting tours.     

Ground delay program planning under uncertainty in airport capacity

Abstract

This paper presents an algorithm for assigning flight departure delays under probabilistic airport capacity. The algorithm dynamically adapts to weather forecasts by revising, if necessary, departure delays. The proposed algorithm leverages state-of-the-art optimization techniques that have appeared in recent literature. As a case study, the algorithm is applied to assigning departure delays to flights scheduled to arrive at San Francisco International Airport in the presence of uncertainty in the fog clearance time. The cumulative distribution function of fog clearance time was estimated from historical data. Using daily weather forecasts to update the probabilities of fog clearance times resulted in improvement of the algorithm's performance. Experimental results also indicate that if the proposed algorithm is applied to assign ground delays to flights inbound at San Francisco International airport, overall delays could be reduced up to 25% compared to current level.     

A practical method to estimate the benefits of improved road network reliability: an application to departing air passengers

This paper develops and applies a practical method to estimate the benefits of improved reliability of road networks. We present a general methodology to estimate the scheduling costs due to travel time variability for car travel. In contrast to existing practical methods, we explicitly consider the effect of travel time variability on departure time choices. We focus on situations when only mean delays are known, which is typically the case when standard transport models are used. We first show how travel time variability can be predicted from mean delays. We then estimate the scheduling costs of travellers, taking into account their optimal departure time choice given the estimated travel time variability. We illustrate the methodology for air passengers traveling by car to Amsterdam Schiphol Airport. We find that on average planned improvements in network reliability only lead to a small reduction in access costs per trip in absolute terms, mainly because most air passengers drive to the airport outside peak hours, when travel time variability tends to be low. However, in relative terms the reduction in access costs due to the improvements in network reliability is substantial. In our case we find that for every 1 Euro reduction in travel time costs, there is an additional cost reduction of 0.7 Euro due to lower travel time variability, and hence lower scheduling costs. Ignoring the benefits from improved reliability may therefore lead to a severe underestimation of the total benefits of infrastructure improvements.     

Time-dependent fuzzy random location-scheduling programming for hazardous materials transportation

The tremendous use of hazardous materials has promoted the economic development, which also brings about a growing risk causing a widespread concern. In this work, we consider a location-scheduling problem on hazardous materials transportation under the assumption that transportation risks are time-dependent fuzzy random variables. First, we formulate a scheduling optimization model and design a fuzzy random simulation based genetic algorithm to optimize the departure time and dwell times for each depot–customer pair. Then we establish an expected value model and design a modified particle swarm optimization algorithm to minimize the en route risks and site risks. Finally, numerical examples are given to illustrate the effectiveness of the proposed models and algorithms.     

Influence of peak spreading and departure time choice on evaluation of its measures

Intelligent transport systems provide various means to improve capacity and travel time in road networks. Evaluation of the benefits of these improvements requires consideration of travellers' response to them. We consider a continuous‐time equilibrium model of departure time choice and identify a formula for the dynamic equilibrium departure rate profile. We develop the analysis to consider the effect on the cost incurred by travellers of ITS measures through their effects on each of the travel time in the absence of congestion, and the capacity for travel. This shows the importance in choice of departure time of travellers' values of time at each of the origin and destination of their journeys. We show the importance of these values of time in evaluation, and that if travellers value their time at both the origin and destination of their journeys, their responses will lead them to achieve a greater reduction in costs than would be achieved under free‐flow conditions.     

The cost of travel time variability: Three measures with properties

This paper explores the relationships between three types of measures of the cost of travel time variability: measures based on scheduling preferences and implicit departure time choice, Bernoulli type measures based on a univariate function of travel time, and mean-dispersion measures. We characterise measures that are both scheduling measures and mean-dispersion measures and measures that are both Bernoulli and mean-dispersion. There are no measures that are both scheduling and Bernoulli. We consider the impact of requiring that measures are additive or homogeneous, proving also a new strong result on the utility rates in an additive scheduling measure. These insights are useful for selecting cost measures to use in applications.     

Transit scheduling

This paper provides an overview of the transit operational planning process with an emphasis on certain aspects of new methodologies in scheduling. The transit scheduling system usually consists of three interelated components: (1) creation of timetables; (2) scheduling vehicles to trips; and (3) assignment of drivers. These three components are described, but with a focus on the first component because of its importance from the user's perspective. The design of a transit timetable is discussed from both a practical and an analytical viewpoint. A methodology is presented on the construction of alternative computerized public timetables, based on procedures that improve the correspondence of vehicle departure times with passenger demand. The vehicle scheduling procedure is viewed through the minimization of the number of vehicles required to carry out a fixed or variable timetable. Finally, different approaches to the crew assignment component are briefly discussed. The overview and methodologies presented in the paper suggest that most scheduling tasks can be performed automatically or in a conversational man-computer mode. The adoption of new scheduling procedures will undoubtedly increase the efficiency of each of the three components of the transit scheduling system.     

Optimal shipment decisions for an airfreight forwarder: Formulation and solution methods

We study the freight forwarder’s shipment planning problem in an airfreight forwarding network where a set of cargo shipments have to be transported to given destinations. We provide mixed integer programming formulations that use piecewise-linear cargo rates and account for volume and weight constraints, flight departure/arrival times, as well as shipment-ready times.After exploring the solution of such models using CPLEX, we devise two solution methodologies to handle large problem sizes. The first is based on Lagrangian relaxation, where the problems decompose into a set of knapsack problems and a set of network flow problems. The second is a local branching heuristic that combines branching ideas and local search. The two approaches show promising results in providing good quality heuristic solutions within reasonable computational times, for difficult and large shipment consolidation problems.     

Travel time prediction and departure time adjustment behavior dynamics in a congested traffic system

This paper examines two heuristic rules proposed for describing urban commuters' predictions of travel time as well as the adjustments of departure time in response to unacceptable arrivals in their daily commute under limited information. It is based on the notion that the magnitude of the predicted travel time depends on each commuter's own experience, including recallable travel time, schedule delay, and difficulties in searching for a satisfactory departure time. An explanatory analysis is first performed to compare these two rules, based on the information provided by a set of commuters interacting over 24 days through a simulated traffic system. A more elaborate model specification which captures the dynamic interrelation between the commuter's cumulative and recent experience with the traffic system's performance is then proposed. The model parameters are estimated with explicit consideration of the serial correlation arising from repeated decisions by the same individuals and the contemporaneous interaction with other system users' decisions through the traffic system's performance.     

Dynamic models of commuter behavior: Experimental investigation and application to the analysis of planned traffic disruptions

This paper reviews the results of a series of experiments aimed at investigating the day-to-day dynamics of commuter behavior in congested traffic systems. The interactive experiments involve actual work commuters in a simulated traffic system, whereby commuters noncooperatively supply their decisions to a traffic simulation model that determines the resulting arrival times and associated trip times; these in turn form the basis of the commuters' decisions on the next day. Models are developed to predict the daily switching of departure time and/or route by individual commuters in response to experienced congestion in the system or to exogenously supplied information. These models are incorporated in a dynamic modelling framework for the analysis of the impacts of planned traffic disruptions, such as those associated with major highway repair and reconstruction activities.     

Future electricity demand from battery‐powered vehicles

An important decision faced by airline schedulers is how to adapt the flight schedule and aircraft assignment to unforeseen perturbations in an established schedule. In the face of unforeseen aircraft delays, schedulers have to decide which flights to delay, and when delays become excessive, which to cancel. Current scheduling models deal with simple decision problems of delay or cancellation, but not with both simultaneously. But in practice the optimal decision may involve results from the integration of both flight cancellations and delays. In Part I of this paper, a quadratic programming model for the integration decision problem is given. The model can formulate the integration of flight cancellations and delays as well as some special cases, such as the ferrying of surplus aircraft and the possibility of swapping different types of aircraft. In this paper, based on the special structure of the model, an effective algorithm is presented, sufficient computational experiments are conducted and some results are reported. These show that we can expect to obtain a sufficiently good solution in terms of reasonable CPU time.     

A new approach for improving the performance of freight train timetabling of a single-track railway system

A new approach for improving the performance of freight train timetabling for single-track railways is proposed. Using the idea of a fixed-block signaling system, we develop a matrix representation to express the occupation of inter- and intra-station tracks by trains illustrating the train blocking time diagram in its entirety. Train departure times, dwell times, and unnecessary stopping are adjusted to reduce average train travel time and single train travel time. Conflicts between successive stations and within stations are identified and solved. A fuzzy logic system is further used to adjust the range of train departure times and checks are made to determine whether dwell times and time intervals can be adjusted for passenger and freight trains at congested stations to minimize train waiting times. By combining manual scheduling expertise with the fuzzy inference method, timetable efficiency is significantly improved and becomes more flexible.     

Door-to-door travel times in RP departure time choice models: An approximation method using GPS data

A common way to determine values of travel time and schedule delay is to estimate departure time choice models, using stated preference (SP) or revealed preference (RP) data. The latter are used less frequently, mainly because of the difficulties to collect the data required for the model estimation. One main requirement is knowledge of the (expected) travel times for both chosen and unchosen departure time alternatives. As the availability of such data is limited, most RP-based scheduling models only take into account travel times on trip segments rather than door-to-door travel times, or use very rough measures of door-to-door travel times. We show that ignoring the temporal and spatial variation of travel times, and, in particular, the correlation of travel times across links may lead to biased estimates of the value of time (VOT). To approximate door-to-door travel times for which no complete measurement is possible, we develop a method that relates travel times on links with continuous speed measurements to travel times on links where relatively infrequent GPS-based speed measurements are available. We use geographically weighted regression to estimate the location-specific relation between the speeds on these two types of links, which is then used for travel time prediction at different locations, days, and times of the day. This method is not only useful for the approximation of door-to-door travel times in departure time choice models, but is generally relevant for predicting travel times in situations where continuous speed measurements can be enriched with GPS data.     

How flexible is flexible? Accounting for the effect of rescheduling possibilities in choice of departure time for work trips

In departure time studies it is crucial to ascertain whether or not individuals are flexible in their choices. Previous studies have found that individuals with flexible work times have a lower value of time for late arrivals. Flexibility is usually measured in terms of flexible work start time or in terms of constraints in arrival time at work. Although used for the same purpose, these two questions can convey different types of information. Moreover, constraints in departure time are often related not only to the main work activity, but to all daily activities. The objective of this paper is to investigate the effect of constraints in work and in other daily trips/activities on the willingness to shift departure time and the willingness to pay for reducing travel time and travel delay. We set up a survey to collect detailed data on the full 24-hour out-of-home activities and on the constraints for each of these activities. We then built a stated preference experiment to infer preferences on departure time choice, and estimated a mixed logit model, based on the scheduling model, to account for the effects of daily activity schedules and their constraints. Our results show that measuring flexibility in terms of work start time or constraints at work does not provide exactly the same information. Since one-third of the workers with flexible working hours in the survey indicated that they have restrictions on late work-arrival times, their willingness to pay will be overestimated (almost doubled) if flexibility information is asked only in terms of fixed/flexible working hours. This clearly leads to different conclusion in terms of demand sensitivity to reschedule to a later departure time. We also found that having other activities and constraints during the day increases the individuals’ willingness to pay to avoid being late at work, where the presence of constraints on daily activities other than work is particularly relevant for individuals with no constraints at work. The important impact of these findings is that if we neglect the presence of constraints, as is common practise in transport models, it will generally lead to biased value-of-time estimates. Results clearly show that the shift in the departure time, especially towards a late departure time, is strongly overestimated (the predicted shift is more than double) when the effect of non-work activities and their constraints is not accounted for.     

Integrated optimization on train scheduling and preventive maintenance time slots planning

We address the problem of simultaneously scheduling trains and planning preventive maintenance time slots (PMTSs) on a general railway network. Based on network cumulative flow variables, a novel integrated mixed-integer linear programming (MILP) model is proposed to simultaneously optimize train routes, orders and passing times at each station, as well as work-time of preventive maintenance tasks (PMTSs). In order to provide an easy decomposition mechanism, the limited capacity of complex tracks is modelled as side constraints and a PMTS is modelled as a virtual train. A Lagrangian relaxation solution framework is proposed, in which the difficult track capacity constraints are relaxed, to decompose the original complex integrated train scheduling and PMTSs planning problem into a sequence of single train-based sub-problems. For each sub-problem, a standard label correcting algorithm is employed for finding the time-dependent least cost path on a time-space network. The resulting dual solutions can be transformed to feasible solutions through priority rules. Numerical experiments are conducted on a small artificial network and a real-world network adapted from a Chinese railway network, to evaluate the effectiveness and computational efficiency of the integrated optimization model and the proposed Lagrangian relaxation solution framework. The benefits of simultaneously scheduling trains and planning PMTSs are demonstrated, compared with a commonly-used sequential scheduling method.     

Tarmac delay policies: A passenger-centric analysis

In this paper, we analyze the effectiveness of the 2010 Tarmac Delay Rule from a passenger-centric point of view. The Tarmac Delay Rule stipulates that aircraft lift-off, or an opportunity for passengers to deplane, must occur no later than 3 h after the cabin door closure at the gate of the departure airport; and that an opportunity for passengers to deplane must occur no later than 3 h after the touchdown at the arrival airport. The Tarmac Delay Rule aims to protect enplaned passengers on commercial aircraft from excessively long delays on the tarmac upon taxi-out or taxi-in, and monetarily penalizes airlines that violate the stipulated 3-h tarmac time limit. Comparing the actual flight schedule and delay data after the Tarmac Delay Rule was in effect with that before, we find that the Rule has been highly effective in reducing the frequency of occurrence of long tarmac times. However, another significant effect of the rule has been the rise in flight cancellation rates. Cancellations result in passengers requiring rebooking, and often lead to extensive delay in reaching their final destinations. Using an algorithm to estimate passenger delay, we quantify delays to passengers in 2007, before the Tarmac Delay Rule was enacted, and compare these delays to those estimated for hypothetical scenarios with the Tarmac Delay Rule in effect for that same year. Our delay estimates are calculated using U.S. Department of Transportation data from 2007. Through our results and several sensitivity analyses, we show that the overall impact of the current Tarmac Delay Rule is a significant increase in passenger delays, especially for passengers scheduled to travel on the flights which are at risk of long tarmac delays. We evaluate the impacts on passengers of a number of rule variations, including changes to the maximum time on the tarmac, and variations in that maximum by time-of-day. Through extensive scenario analyses, we conclude that a better balance between the conflicting objectives of reducing the frequency of long tarmac times and reducing total passenger delays can be achieved through a modified version of the existing rule. This modified version involves increasing the tarmac time limit to 3.5 h and only applying the rule to flights with planned departure times before 5pm. Finally, in order to implement the Rule more effectively, we suggest the tarmac time limit to be defined in terms of the time when the aircraft begin returning to the gate instead of being defined in terms of the time when passengers are allowed to deplane.     

A reference-dependent user equilibrium model for activity-travel scheduling

Existing user equilibrium models of activity-travel scheduling generally fall short in representing travelers’ decision-making processes. The majority have either implicitly or explicitly assumed that travelers follow the principle of utility maximization. This assumption ignores the fact that individuals may be loss–averse when making activity-travel decisions. Allowing for the situation that travelers possess accurate information of the urban-transportation system due to modern technologies, studies on reference-dependent decision-making under near-perfect information are receiving increasing attention. In view of traveler heterogeneity, individuals can be divided into multiple classes according to their reference points. In this paper, we propose a reference-dependent multi-class user equilibrium model for activity-travel scheduling, which can be reformulated as a variational inequality problem. Moreover, comparative analyses are conducted on the equilibrium states between utility-maximization (no reference) and reference-dependency of exogenous and endogenous references. A numerical example regarding combined departure-time and mode choice for commuting is conducted to illustrate the proposed model. The simulated results indicate that reference points and loss aversion attitudes have significant effects on the choice of departure time and mode.     

Joint modeling of evacuation departure and travel times in hurricanes

Hurricanes are costly natural disasters periodically faced by households in coastal and to some extent, inland areas. A detailed understanding of evacuation behavior is fundamental to the development of efficient emergency plans. Once a household decides to evacuate, a key behavioral issue is the time at which individuals depart to reach their destination. An accurate estimation of evacuation departure time is useful to predict evacuation demand over time and develop effective evacuation strategies. In addition, the time it takes for evacuees to reach their preferred destinations is important. A holistic understanding of the factors that affect travel time is useful to emergency officials in controlling road traffic and helps in preventing adverse conditions like traffic jams. Past studies suggest that departure time and travel time can be related. Hence, an important question arises whether there is an interdependence between evacuation departure time and travel time? Does departing close to the landfall increases the possibility of traveling short distances? Are people more likely to depart early when destined to longer distances? In this study, we present a model to jointly estimate departure and travel times during hurricane evacuations. Empirical results underscore the importance of accommodating an inter-relationship among these dimensions of evacuation behavior. This paper also attempts to empirically investigate the influence of social ties of individuals on joint estimation of evacuation departure and travel times. Survey data from Hurricane Sandy is used for computing empirical results. Results indicate significant role of social networks in addition to other key factors on evacuation departure and travel times during hurricanes.