Computing 4D near-optimal trajectories for dynamic air traffic flow management with column generation and branch-and-price

Abstract

The current air traffic system faces recurrent saturation problems. Numerous studies are dedicated to this issue, including the present research on a new dynamic regulation filter holding frequent trajectory optimisations in a real-time sliding horizon loop process. We consider a trajectory optimisation problem arising in this context, where a feasible four-dimensional (4D) trajectory is to be built and assigned to each regulated flight to suppress sector overloads while minimising the cost of the chosen policy. We model this problem with a mixed integer linear programme and solve it with a branch-and-price approach. The pricing sub-problem looks for feasible trajectories in a dynamic three-dimensional (3D) network and is solved with a specific algorithm based on shortest path labelling algorithms and on dynamic programming. Each algorithm is tested on real-world data corresponding to a complete traffic day in the European air traffic system; experimental results, including computing times measurement, validate the solution process.     

Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach

This paper proposes a global optimization algorithm for solving a mixed (continuous/discrete) transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both expansion of existing links and addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. In this paper, we first formulate the UE condition as a variational inequality (VI) problem, which is defined from a finite number of extreme points of a link-flow feasible region. The MNDP is approximated as a piecewise-linear programming (P-LP) problem, which is then transformed into a mixed-integer linear programming (MILP) problem. A global optimization algorithm based on a cutting constraint method is developed for solving the MILP problem. Numerical examples are given to demonstrate the efficiency of the proposed method and to compare the results with alternative algorithms reported in the literature.     

Prediction of ground vibration amplitudes due to urban railway traffic using quantitative and qualitative field data

The growth of railway transport in urban areas has lead to an increase in ground vibrations enhancing their negative environmental impact. Therefore is mandatory to predict and control ground vibrations. This work presents a methodology for the determination of prediction models of ground vibration amplitudes due to railway train circulation in urban environments. Using quantitative predictors (train speed and distance) and qualitative predictors (railway track type, dominant geology and building type), being the use of the latter predictors justified by the fact that, most frequently, quantitative parameters are very difficult to obtain in the urban environment due to their characterization. Thus, a detailed statistical study based on the proposal and validation of multiple linear regression models, is successfully applied in order to predict vibration amplitudes produced by railway train circulation, in the considered domain, as function of quantitative and qualitative predictors, easily obtained in field work. A multiple linear regression model for ground vibration prediction due to underground railway traffic has been presented for the Lisbon area.     

A mixed-integer linear program for optimizing sensor locations along freeway corridors

How to optimally allocate limited freeway sensor resources is of great interest to transportation engineers. In this paper, we focus on the optimal allocation of point sensors, such as loop detectors, to minimize performance measurement errors. Although it has been shown that the minimization problem can be intuitively formulated as a nonlinear program, the formulation is so complex that only heuristic approaches can be used to solve the problem. In this paper, we transform the nonlinear program into an equivalent mixed-integer linear model. The linearized model is shown to have a graphical interpretation and can be solved using resource constrained shortest path algorithms. A customized Branch-and-Bound technique is then proposed to solve the resource constrained shortest path problem. Numerical experiments along an urban freeway corridor demonstrate that this sensor location model is successful in allocating loop detectors to improve the accuracy of travel time estimation.     

用事件树分析法透析轨道交通事故机理——由上海十号线事故引发的探究

文章以上海地铁十号线追尾事故为例,运用系统工程事件树分析法,对轨道交通事故发生的动态过程及概率进行了定性和定量分析,并提出了相应的防范措施。     

The design of a terminal for dangerous goods

This paper aims at examining the possibility of setting up a model terminal for the transportation of dangerous goods. It should be designed in such a manner that its use would be possible for any kind of transportation.

This consideration has been prompted by the interface between transportation planning and technology, as well as by the tendency for harmonizing international recommendations pertaining to the transportation and handling of dangerous goods, especially during the last decades where unified transport has gained ground due to the advantages provided for the safe consignment of dangerous cargoes.

Since the large increase in terminal productivity is due to the heavy investments that were effected in terminal installations and to the modernization of the administration‐management of terminals, a mathematical simulation has been adopted to assist the determination of the capacity of a terminal for dangerous goods.

It is evident that different criteria and various assumptions have been taken into account in order to facilitate a deeper analysis, without ignoring the contribution of dangerous goods to the socio‐economic development.

From the outset of the study, it was already clear that the said process will make it possible to present—as a model—a simple but well defined situation for the purpose of drawing useful conclusions.