The time-dependent pollution-routing problem

The Time-Dependent Pollution-Routing Problem (TDPRP) consists of routing a fleet of vehicles in order to serve a set of customers and determining the speeds on each leg of the routes. The cost function includes emissions and driver costs, taking into account traffic congestion which, at peak periods, significantly restricts vehicle speeds and increases emissions. We describe an integer linear programming formulation of the TDPRP and provide illustrative examples to motivate the problem and give insights about the tradeoffs it involves. We also provide an analytical characterization of the optimal solutions for a single-arc version of the problem, identifying conditions under which it is optimal to wait idly at certain locations in order to avoid congestion and to reduce the cost of emissions. Building on these analytical results we describe a novel departure time and speed optimization algorithm for the cases when the route is fixed. Finally, using benchmark instances, we present results on the computational performance of the proposed formulation and on the speed optimization procedure.     

航班快速恢复建模与仿真研究

随着民用航空的发展与竞争,航班延误不仅影响航空飞行的安全与正常,更与航空公司的运营效率、运营成本及乘客利益息息相关。针对某一恶劣天气影响,对某公司受影响航班进行重新调配,考虑到航班的备降、盘旋等待、延误、取消等多种状态,以总成本最小为目标函数,建立航班快速恢复模型,通过MATLAB运用遗传算法设计航班恢复算法进行求解,得出最经济的航班恢复方案。     

Mapping evacuation risk on transportation networks using a spatial optimization model

The focus of this paper is on the development of a methodology to identify network and demographic characteristics on real transportation networks which may lead to significant problems in evacuation during some extreme event, like a wildfire or hazardous material spill. We present an optimization model, called the critical cluster model, that can be used to identify small areas or neighborhoods which have high ratios of population to exit capacity. Although this model in its simplest form is a nonlinear, constrained optimization problem, a special integer-linear programming equivalent can be formulated. Special contiguity constraints are needed to keep identified clusters spatially connected. We present details on how this model can be solved optimally as well as discuss computational experience for several example transportation networks. We describe how this model can be integrated within a GIS system to produce maps of evacuation risk or vulnerability. This model is now being utilized in several research projects, in Europe and the US.     

The price of uncertainty in pavement infrastructure management planning: An integer programming approach

Currently there is a true dichotomy in the pavement maintenance and rehabilitation (M&R) literature. On the one hand, there are integer programming-based models that assume that parameters are deterministically known. On the other extreme, there are stochastic models, with the most popular class being based on the theory of Markov decision processes that are able to account for various sources of uncertainties observed in the real-world. In this paper, we present an integer programming-based alternative to account for these uncertainties. A critical feature of the proposed models is that they provide – a priori – probabilistic guarantees that the prescribed M&R decisions would result in pavement condition scores that are above their critical service levels, using minimal assumptions regarding the sources of uncertainty. By construction of the models, we can easily determine the additional budget requirements when additional sources of uncertainty are considered, starting from a fully deterministic model. We have coined this additional budget requirement the price of uncertainty to distinguish from previous related work where additional budget requirements were studied due to parameter uncertainties in stochastic models. A numerical case study presents valuable insights into the price of uncertainty and shows that it can be large.     

城市区域性单向交通系统研究

文章介绍了国内外单向交通的发展概况及实施条件,阐述了城市区域性单向交通设置的优势与劣势,并结合具体案例,分析了单向交通系统设置中的问题与对策,提出了实行单向交通的相关建议。     

An adaptive information fusion model to predict the short-term link travel time distribution in dynamic traffic networks

As intelligent transportation systems (ITS) approach the realm of widespread deployment, there is an increasing need to robustly capture the variability of link travel time in real-time to generate reliable predictions of real-time traffic conditions. This study proposes an adaptive information fusion model to predict the short-term link travel time distribution by iteratively combining past information on link travel time on the current day with the real-time link travel time information available at discrete time points. The past link travel time information is represented as a discrete distribution. The real-time link travel time is represented as a range, and is characterized using information quality in terms of information accuracy and time delay. A nonlinear programming formulation is used to specify the adaptive information fusion model to update the short-term link travel time distribution by focusing on information quality. The model adapts good information by weighing it higher while shielding the effects of bad information by reducing its weight. Numerical experiments suggest that the proposed model adequately represents the short-term link travel time distribution in terms of accuracy and robustness, while ensuring consistency with ambient traffic flow conditions. Further, they illustrate that the mean of a representative short-term travel time distribution is not necessarily a good tracking indicator of the actual (ground truth) time-dependent travel time on that link. Parametric sensitivity analysis illustrates that information accuracy significantly influences the model, and dominates the effects of time delay and the consistency constraint parameter. The proposed information fusion model bridges key methodological gaps in the ITS deployment context related to information fusion and the need for short-term travel time distributions.