Modeling and Simulation of Wake Safety Interval for Paired Approach Based on CFD

In order to relieve the stress caused by the surge of flight flow, Closely Spaced Parallel Runways (CSPRs) have been built in many hub airports, and a paired approach mode has been applied to CSPRs in some countries. This paper proposes a method for optimizing the wake separation between aircrafts which utilizes a paired approach, aiming at reducing longitudinal separation by using computational fluid dynamics technology. Firstly, the model of the wake vortex field of the paired lead aircraft is constructed. Secondly, the numerical simulation preparation for the characteristics of the wake vortex field is completed through the computational pretreatment of the model. Thirdly, a calculation model of wake safety interval based on paired approach operation is established. Finally, the proposed method shows its superiority comparing with other methods. This method realized visual analysis of wake vortex through optimization modeling based on computational fluid dynamics, contributing to increasing the capacity of the runway and improving the operation efficiency of an aerodrome.

Comparative Study of AMPL, Pyomo and JuMP Optimization Modeling Languages on a Flood Control Problem Example

The purpose of this work is a comparative study of three languages (environments) of optimization modeling: AMPL, Pyomo and JuMP. The comparison will be based on three implementations of an optimal discrete-time flood control problem formulated as a nonlinear programming problem. The codes for individual models and differences between them will be presented and discussed. Various aspects will be taken into account, e.g. simplicity and intuitiveness of implementation.

Comparative Study of AMPL, Pyomo and JuMP Optimization Modeling Languages on a Network Linear Programming Problem Example

The purpose of this work is a comparative study of three languages (environments) of optimization modeling: AMPL, Pyomo and JuMP. The comparison will be based on three implementations of the shortest path problem formulated as a linear programming problem. The codes for individual models and differences between them will be presented and discussed. Various aspects will be taken into account, such as: simplicity and intuitiveness of implementation, availability of specific data structures for a LP network problems, etc.