Optimal transit fare in a bimodal network under demand uncertainty and bounded rationality

This paper investigates the optimal transit fare in a simple bimodal transportation system that comprises public transport and private car. We consider two new factors: demand uncertainty and bounded rationality. With demand uncertainty, travelers are assumed to consider both the mean travel cost and travel cost variability in their mode choice decision. Under bounded rationality, travelers do not necessarily choose the travel mode of which perceived travel cost is absolutely lower than the one of the other mode. To determine the optimal transit fare, a bi‐level programming is proposed. The upper‐level objective function is to minimize the mean of total travel cost, whereas the lower‐level programming adopts the logit‐based model to describe users' mode choice behaviors. Then a heuristic algorithm based on a sensitivity analysis approach is designed to solve the bi‐level programming. Numerical examples are presented to illustrate the effect of demand uncertainty and bounded rationality on the modal share, optimal transit fare and system performance. Copyright © 2013 John Wiley & Sons, Ltd.     

Sensitivity analysis for energy demand estimation of electric vehicles

We present a sensitivity analysis for a mechanical model, which is used to estimate the energy demand of battery electric vehicles. This model is frequently used in literature, but its parameters are often chosen incautiously, which can lead to inaccurate energy demand estimates. We provide a novel prioritization of parameters and quantify their impact on the accuracy of the energy demand estimation, to enable better decision making during the model parameter selection phase. We furthermore determine a subset of parameters, which has to be defined, in order to achieve a desired estimation accuracy. The analysis is based on recorded GPS tracks of a battery electric vehicle under various driving conditions, but results are equally applicable for other BEVs. Results show that the uncertainty of vehicle efficiency and rolling friction coefficient have the highest impact on accuracy. The uncertainty of power demand for heating and cooling the vehicle also strongly affects the estimation accuracy, but only at low speeds. We also analyze the energy shares related to each model component including acceleration, air drag, rolling and grade resistance and auxiliary energy demand. Our work shows that, while some components make up a large share of the overall energy demand, the uncertainty of parameters related to these components does not affect the accuracy of energy demand estimation significantly. This work thus provides guidance for implementing and calibrating an energy demand estimation based on a longitudinal dynamics model.     

Reducing the passenger travel time in practice by the automated construction of a robust railway timetable

Automatically generating timetables has been an active research area for some time, but the application of this research in practice has been limited. We believe this is due to two reasons. Firstly, some of the models in the literature impose artificial upper bounds on time supplements. This causes a high risk of generating infeasibilities. Secondly, some models that leave out these upper bounds often generate solutions that contain some very large time supplements because these supplements are not penalised in the objective function. The reason is that these objective functions often do not completely correspond to the true goal of a timetable. We solve both problems by minimising our objective function: total passenger travel time, expected in practice. Since this function evaluates and indirectly steers all time related decision variables in the system, we do not need to further restrict the ranges of any of these variables. As a result, our model does not suffer from infeasibilities generated by such artificial upper bounds for supplements.Furthermore, some measures are taken to significantly speed up the solver times of our model. These combined features result in our model being solved more quickly than previous models. As a result, our method can be used for timetabling in practice. We demonstrate our claims by optimising, in about two hours only, the timetable of all 196 hourly passenger trains in Belgium. Assuming primary delay-distributions with an average of 2% on the minima of each activity, the optimised timetable reduces expected passenger time in practice, as evaluated on the macroscopic level, by 3.8% during peak hours. This paper demonstrates that we added two important missing steps to make cyclic timetabling for passengers really useable in practice: (i) the addition of the objective function of expected passenger time in practice and (ii) the reduction of computation time by addition of well chosen additional constraints.     

Distribution-free travel time reliability assessment with probability inequalities

An assumption that pervades the current transportation system reliability assessment literature is that probability distributions of the sources of uncertainty are known explicitly. However, this distribution may be unavailable (inaccurate) in reality as we may have no (insufficient) data to calibrate the distribution. In this paper we relax this assumption and present a new method to assess travel time reliability that is distribution-free in the sense that the methodology only requires that the first N moments (where N is a user-specified positive integer) of the travel time to be known and that the travel times reside in a set of bounded and known intervals. Because of our modeling approach, all sources of uncertainty are automatically accounted for, as long as they are statistically independent. Instead of deriving exact probabilities on travel times exceeding certain thresholds via computationally intensive methods, we develop semi-analytical probability inequalities to quickly (i.e. within a fraction of a second) obtain upper bounds on the desired probability. Numerical experiments suggest that the inclusion of higher order moments can potentially significantly improve the bounds. The case study also demonstrates that the derived bounds are nontrivial for a large range of travel time values.     

Guaranteed prediction and estimation of the state of a road network

The paper presents an algorithm for the prediction and estimation of the state of a road network comprising freeways and arterials, described by a Cell Transmission Model (CTM). CTM divides the network into a collection of links. Each link is characterized by its fundamental diagram, which relates link speed to link density. The state of the network is the vector of link densities. The state is observed through measurements of speed and flow on some links. Demand is specified by the volume of vehicles entering the network at some links, and by split ratios according to which vehicles are routed through the network. There is model uncertainty: the parameters of the fundamental diagram are uncertain. There is uncertainty in the demand around the nominal forecast. Lastly, the measurements are uncertain. The uncertainty in each model parameter, demand, and measurement is specified by an interval. Given measurements over a time interval [0, t] and a horizon τ ? 0, the algorithm computes a set of states with the guarantee that the actual state at time (t + τ) will lie in this set, consistent with the given measurements. In standard terminology the algorithm is a state prediction or an estimate accordingly as τ > 0 or =0. The flow exiting a link may be controlled by an open- or closed-loop controller such as a signal or ramp meter. An open-loop controller does not change the algorithm, indeed it may make the system more predictable by tightening density bounds downstream of the controller. In the feedback case, the value of the control depends on the estimated state bounds, and the algorithm is extended to compute the range of possible closed-loop control values. The algorithm is used in a proposed design of a decision support system for the I-80 integrated corridor.     

Liner ship route capacity utilization estimation with a bounded polyhedral container shipment demand pattern

This paper aims to estimate capacity utilization of a liner ship route with a bounded polyhedral container shipment demand pattern, arising in the liner container shipping industry. The proposed maximum and minimum liner ship route capacity utilization problems are formulated as a linear programming model and a min–max model, respectively. We examine two fundamental properties of the min–max model. These two nice properties enable us to develop two ε-optimal global optimization algorithms for solving the min–max model, which find a globally ε-optimal solution by iteratively cutting off the bounded polyhedral container shipment demand set with a cut. The latter algorithm overcomes non-convexity of the remaining feasible demand set generated by the former algorithm via a novel hyperplane cut. Each hyperplane cut can assure that the current vertex of the polyhedral demand set is cut off, whereas solutions that may improve the current one by more than a factor of ε are retained. Extensive numerical experiments for problems larger than those encountered in real applications demonstrate the computational efficacy of the latter algorithm.     

Incorporating institutional and spatial factors in the selection of the optimal locations of public electric vehicle charging facilities: A case study of Beijing,China

In this paper, we present a case study on planning the locations of public electric vehicle (EV) charging stations in Beijing, China. Our objectives are to incorporate the local constraints of supply and demand on public EV charging stations into facility location models and to compare the optimal locations from three different location models. On the supply side, we analyse the institutional and spatial constraints in public charging infrastructure construction to select the potential sites. On the demand side, interviews with stakeholders are conducted and the ranking-type Delphi method is used when estimating the EV demand with aggregate data from municipal statistical yearbooks and the national census. With the estimated EV demand, we compare three classic facility location models – the set covering model, the maximal covering location model, and the p-median model – and we aim to provide policy-makers with a comprehensive analysis to better understand the effectiveness of these traditional models for locating EV charging facilities. Our results show that the p-median solutions are more effective than the other two models in the sense that the charging stations are closer to the communities with higher EV demand, and, therefore, the majority of EV users have more convenient access to the charging facilities. From the experiments of comparing only the p-median and the maximal covering location models, our results suggest that (1) the p-median model outperforms the maximal covering location model in terms of satisfying the other’s objective, and (2) when the number of charging stations to be built is large, or when minor change is required, the solutions to both models are more stable as p increases.     

Optimization models for differentiating quality of service levels in probabilistic network capacity design problems

This paper develops various chance-constrained models for optimizing the probabilistic network design problem (PNDP), where we differentiate the quality of service (QoS) and measure the related network performance under uncertain demand. The upper level problem of PNDP designs continuous/discrete link capacities shared by multi-commodity flows, and the lower level problem differentiates the corresponding QoS for demand satisfaction, to prioritize customers and/or commodities. We consider PNDP variants that have either fixed flows (formulated at the upper level) or recourse flows (at the lower level) according to different applications. We transform each probabilistic model into a mixed-integer program, and derive polynomial-time algorithms for special cases with single-row chance constraints. The paper formulates benchmark stochastic programming models by either enforcing to meet all demand or penalizing unmet demand via a linear penalty function. We compare different models and approaches by testing randomly generated network instances and an instance built on the Sioux–Falls network. Numerical results demonstrate the computational efficacy of the solution approaches and derive managerial insights.     

The treatment of uncertainty in the dynamic origin–destination estimation problem using a fuzzy approach

Regardless of existing types of transportation and traffic model and their applications, the essential input to these models is travel demand, which is usually described using origin–destination (OD) matrices. Due to the high cost and time required for the direct development of such matrices, they are sometimes estimated indirectly from traffic measurements recorded from the transportation network. Based on an assumed demand profile, OD estimation problems can be categorized into static or dynamic groups. Dynamic OD demand provides valuable information on the within-day fluctuation of traffic, which can be employed to analyse congestion dissipation. In addition, OD estimates are essential inputs to dynamic traffic assignment (DTA) models. This study presents a fuzzy approach to dynamic OD estimation problems. The problems are approached using a two-level model in which demand is estimated in the upper level and the lower level performs DTA via traffic simulation. Using fuzzy rules and the fuzzy C-Mean clustering approach, the proposed method treats uncertainty in historical OD demand and observed link counts. The approach employs expert knowledge to model fitted link counts and to set boundaries for the optimization problem by defining functions in the fuzzification process. The same operation is performed on the simulation outputs, and the entire process enables different types of optimization algorithm to be employed. The Box-complex method is utilized as an optimization algorithm in the implementation of the approach. Empirical case studies are performed on two networks to evaluate the validity and accuracy of the approach. The study results for a synthetic network and a real network demonstrate the robust performance of the proposed method even when using low-quality historical demand data.     

Asymmetric responses of highway travel demand to changes in fuel price: An explanation via fuel price uncertainty

Previous research has examined asymmetric effects of fuel price uncertainty on energy demand. If we consider that energy demand is related to travel demand, the changes in fuel prices may have asymmetric effects on highway travel demand via fuel price uncertainty. In other words, when in general fuel price is steadily rising, the highway traffic volume decreases by a small percentage. On the other hand, the highway traffic volume increases by a large percentage when fuel prices are falling. We hypothesize that the uncertainty in fuel prices generates this kind of asymmetric effect on highway traffic volume in Korea. We use the Korean monthly fuel price and highway traffic volume data from 2001 to 2009, and define the intra-month (weekly) fuel price changes as monthly fuel price volatility which is a proxy for monthly fuel price uncertainty. We found that the direction of the change in fuel prices had asymmetric effects on highway travel demand and that the fuel price uncertainty led drivers to respond asymmetrically to the changes in fuel prices.     

The recoverable robust facility location problem

This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be recovered promptly and at low cost in the second stage. In contrast to some related modeling approaches from the literature, this new recoverable robust model is more general in terms of the considered data uncertainty; it can address situations in which uncertainty may be present in any of the following four categories: provider-side uncertainty, receiver-side uncertainty, uncertainty in-between, and uncertainty with respect to the cost parameters.For this novel problem, a sophisticated branch-and-cut framework based on Benders decomposition is designed and complemented by several non-trivial enhancements, including scenario sorting, dual lifting, branching priorities, matheuristics and zero-half cuts. Two large sets of instances that incorporate spatial and demographic information of countries such as Germany and US (transportation) and Bangladesh and the Philippines (disaster management) are introduced. They are used to analyze in detail the characteristics of the proposed model and the obtained solutions as well as the effectiveness, behavior and limitations of the designed algorithm.     

Short/medium-term prediction for the aviation emissions in the en route airspace considering the fluctuation in air traffic demand

This paper proposes a novel short/medium-term prediction method for aviation emissions distribution in en route airspace. An en route traffic demand model characterizing both the dynamics and the fluctuation of the actual traffic demand is developed, based on which the variation and the uncertainty of the short/medium-term traffic growth are predicted. Building on the demand forecast the Boeing Fuel Flow Method 2 is applied to estimate the fuel consumption and the resulting aviation emissions in the en route airspace. Based on the traffic demand prediction and the en route emissions estimation, an aviation emissions prediction model is built, which can be used to forecast the generation of en route emissions with uncertainty limits. The developed method is applied to a real data set from Hefei Area Control Center for the en route emission prediction in the next 5 years, with time granularities of both months and years. To validate the uncertainty limits associated with the emission prediction, this paper also presents the prediction results based on future traffic demand derived from the regression model widely adopted by FAA and Eurocontrol. The analysis of the case study shows that the proposed method can characterize well the dynamics and the fluctuation of the en route emissions, thereby providing satisfactory prediction results with appropriate uncertainty limits. The prediction results show a gradual growth at an average annual rate of 7.74%, and the monthly prediction results reveal distinct fluctuation patterns in the growth.     

A model and optimization-based heuristic for the operational aircraft maintenance routing problem

This paper investigates the Operational Aircraft Maintenance Routing Problem (OAMRP). Given a set of flights for a specific homogeneous fleet type, this short-term planning problem requires building feasible aircraft routes that cover each flight exactly once and that satisfy maintenance requirements. Basically, these requirements enforce an aircraft to undergo a planned maintenance at a specified station before accumulating a maximum number of flying hours. This stage is significant to airline companies as it directly impacts the fleet availability, safety, and profitability. The contribution of this paper is twofold. First, we elucidate the complexity status of the OAMRP and we propose an exact mixed-integer programming model that includes a polynomial number of variables and constraints. Furthermore, we propose a graph reduction procedure and valid inequalities that aim at improving the model solvability. Second, we propose a very large-scale neighborhood search algorithm along with a procedure for computing tight lower bounds. We present the results of extensive computational experiments that were carried out on real-world flight networks and attest to the efficacy of the proposed exact and heuristic approaches. In particular, we provide evidence that the exact model delivers optimal solutions for instances with up to 354 flights and 8 aircraft, and that the heuristic approach consistently delivers high-quality solutions while requiring short CPU times.     

Sensitivity-based uncertainty analysis of a combined travel demand model

Travel demand forecasting is subject to great uncertainties. A systematic uncertainty analysis can provide insights into the level of confidence on the model outputs, and also identify critical sources of uncertainty for enhancing the robustness of the travel demand model. In this paper, we develop a systematic framework for quantitative uncertainty analysis of a combined travel demand model (CTDM) using the analytical sensitivity-based method. The CTDM overcomes limitations of the sequential four-step procedure since it is based on a single unifying rationale. The analytical sensitivity-based method requires less computational effort than the sampling-based method. Meanwhile, the uncertainties stemming from inputs and parameters can be treated separately so that the individual and collective effects of uncertainty on the outputs can be clearly assessed and quantified. Numerical examples are finally used to demonstrate the proposed sensitivity-based uncertainty analysis method for the CTDM.     

Container vessel fleet deployment for liner shipping with stochastic dependencies in shipping demand

The problem of optimal container vessels deployment is one of great significance for the liner shipping industry. Although the pioneering work on this problem dates back to the early 1990s, only until recently have researchers started to acknowledge and account for the significant amount of uncertainty present in shipping demand in real world container shipping. In this paper, new analytical results are presented to further relax the input requirements for this problem. Specifically, only the mean and variance of the maximum shipping demand are required to be known. An optional symmetry assumption is shown to further reduce the feasible region and deployment cost for typical confidence levels. Moreover, unlike previous work that tends to ignore stochastic dependencies between the shipping demands on the various routes (that are known to exist in the real world), our models account for such dependencies in the most general setting to date. A salient feature of our modeling approach is that the exact dependence structure does not need to be specified, something that is hard, if not simply impossible, to determine in practice. A numerical case study is provided to illustrate the proposed models.     

Guidance for transport planning and policymaking in the face of an uncertain future

Uncertainty of outcome is widely recognised as a concern facing decision-makers and their advisors. In a number of spheres of policy, it appears uncertainty has intensified in the face of globalisation, economic instability, climate change, technological innovation and changing consumer preferences. How can planners and policymakers plan for an uncertain future? There is growing interest in, and use of, techniques that can help decision-making processes where deep uncertainty is involved. This paper is based upon one of the most recent international examples of a foresight exercise employed to examine uncertainty – specifically that which concerns uncertainty over the nature and extent of future demand for car travel. The principal focus of the paper is on the insights and guidance this examination of uncertainty brings forth for transport planning and policymaking. To accommodate deep uncertainty requires a flexible and open approach in terms of how policy and investment possibilities are formulated and judged. The paper argues for a focus upon the Triple Access System of spatial proximity, physical mobility and digital connectivity as a framework for policy and investment decisions that can harness flexibility and resilience. Uncertainty becomes an opportunity for decision-makers with the realisation that they are shaping the future rather than (only) responding to a predicted future. The paper outlines two forms of policymaking pathway: regime-compliant (in which adherence to trends and the nature of the world we have known pushes policy) and regime-testing (in which the nature of the world as we have known it is brought into question and vision pulls policy decisions). Stronger orientation towards regime-testing to assist in managing an uncertain future is advocated.     

Pick‐up locations and bus allocation for transit‐based evacuation planning with demand uncertainty

This paper develops a decision‐support model for transit‐based evacuation planning under demand uncertainty. Demand uncertainty refers to the uncertainty associated with the number of transit‐dependent evacuees. A robust optimization model is proposed to determine the optimal pick‐up points for evacuees to assemble, and allocate available buses to transport the assembled evacuees between the pick‐up locations and different public shelters. The model is formulated as a mixed‐integer linear program and is solved via a cutting plane scheme. The numerical example based on the Sioux Falls network demonstrates that the robust plan yields lower total evacuation time and is reliable in serving the realized evacuee demand. Copyright © 2012 John Wiley & Sons, Ltd.     

Dynamic process model of mass effects on travel demand

Whereas transportation planners commonly predict the negative impacts of mass transportation, there is increasing empirical evidence of the existence of positive mass effects, whereby increased use of a mode by the ‘mass’ will generally increase its attractiveness for future travellers. In this paper we consider the dynamic impact of such an effect on the problem of travel demand forecasting, with particular regards to social network effects. Our proposed modelling approach is inspired by literature from social physics, evolutionary game theory and marketing. For simplicity of exposition, our model is specified for a scenario in which (a) there is a binary choice between two mobility lifestyles, referred to as car-oriented and transit-oriented, and (b) there are two population groups, where one is the “leading” or “innovative” population group and the other the “following” or “imitating” population group. This latter distinction follows the rather well-known Bass model from the marketing literature (1969). We develop the transition probabilities and transition dynamics. We illustrate with a numerical case study that despite lower intrinsic utility for the transit lifestyle, significant changes towards this lifestyle can be achieved by considering congestion, service improvements and mass effects. We further illustrate that mass effects can be positive or negative. In all cases we explore the sensitivity of our conclusions to the assumed parameter values.     

Robust models for transportation service network design

In this paper robust models are presented for the transportation service network design problem, using the ferry service network design problem as an example application. The base assumption is that only the mean and an upper bound on the passenger demand are known. In one robust model, this information is supplemented by a lower bound on the demand, whereas in a second robust model, the assumption is made that the variance of the demand is known, in addition to the mean and upper bound. The relationship between the two models is investigated and characterized analytically. A case study using the ferry service in Hong Kong is provided to illustrate the models.     

Bottleneck congestion: Differentiating the coarse charge

The traditional bottleneck model for road congestion promotes the implementation of a triangular, and time varying, charge as the optimal solution for the road congestion externality. However, cognitive and technological barriers put a practical limit to the degree of differentiation real world implementations can handle. The traditional approach to accommodate for this concern has been a step toll, with the single step coarse charge as its simplest case.In this paper we study how efficiency of the coarse charge can be improved by differentiating its level and timing across groups of travellers. We use the traditional bottleneck model to analyse how the coarse charge can be differentiated over two groups of travellers assuming inelastic peak-hour demand.The results of our analysis indicate that differentiating the coarse charge across two groups of travellers considerably improves its efficiency without increasing cognitive effort and decision making costs for the individual traveller. A numeric illustration reveals a welfare gain of 69% of the first-best charge, up from 53% for the generic coarse charge. This increase is similar to what is obtained by moving from the coarse charge to a generic two step toll. Once different groups have been defined, one could in fact achieve the same gains by temporal separation of drivers, for example by use of licence plate numbers.The presented charging regime has a considerable degree of flexibility with respect to the share of travellers to attribute to each scheme, which further adds to its merits in practical applicability.