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

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

点云技术在散货专业煤码头三维可视化中的应用

为了实现安全、可靠、真实的三维煤码头监控,通过GENESIS64软件平台导入3D建模,实现三维场景的展示。3D煤堆由先进的激光点云技术,产生海量测量点,使用点云灰度算法处理,再通过C#点云生成灰度图,在GENESIS64中生成真实的立体堆场画面。     

Energy-aware control for automated container terminals using integrated flow shop scheduling and optimal control

The performance of container terminals needs to be improved to handle the growth of transported containers and maintain port sustainability. This paper provides a methodology for improving the handling capacity of an automated container terminal in an energy-efficient way. The behavior of a container terminal is considered as consisting of a higher level and a lower level represented by discrete-event dynamics and continuous-time dynamics, respectively. These dynamics represent the behavior of a large number of terminal equipment. The dynamics need to be controlled. For controlling the higher level dynamics, a minimal makespan problem is solved. For this, the minimal time required by equipment for performing an operation at the lower level is needed. The minimal time for performing an operation at the lower level is obtained using Pontryagin’s Minimum Principle. The actual operation time allowed by the higher level for processing an operation at the lower level is subsequently determined by a scheduling algorithm at the higher level. Given an actual operation time, the lower level dynamics are controlled using optimal control to achieve minimal energy consumption while respecting the time constraint. Simulation studies illustrate how energy-efficient management of equipment for the minimal makespan could be obtained using the proposed methodology.     

云南省民航客运发展预测

民航运输是云南省在进行综合交通运输建设的重点之一,也是该省在未来十四五(2021-2025年)和十五五(2026-2030年)规划期间的研究热点。本文以云南省为研究范围,以省内民航客运为研究对象,选取省内主要的社会经济因素为影响因子,运用主成分分析法(PCA)、反向传播神经网络算法(BP神经网络算法)和回归分析法,构建了省内民航客运的预测模型,得出省内各主要机场在十四五末和十五五末的预计旅客吞吐量,对省政府在进行机场改扩建上有一定的指导意义。     

Locating emergency vehicles with an approximate queuing model and a meta-heuristic solution approach

In this paper, the location of emergency service (ES) vehicles is studied on fully connected networks. Queuing theory is utilized to obtain the performance metrics of the system. An approximate queuing model the (AQM) is proposed. For the AQM, different service rate formulations are constructed. These formulations are tested with a simulation study for different approximation levels. A mathematical model is proposed to minimize the mean response time of ES systems based on AQM. In the model, multiple vehicles are allowed at a single location. The objective function of the model has no closed form expression. A genetic algorithm is constructed to solve the model. With the help of the genetic algorithm, the effect of assigning multiple vehicles on the mean response time is reported.     

Mathematical model for optimising the sequence for clearing snow from the manoeuvring area during winter operations

This article considers the optimisation of the sequence for clearing snow from stretches of the manoeuvring area of an airport. This issue involves the optimisation of limited resources to remove snow from taxiways and runways thereby leaving them in an acceptable condition for operating aircraft. The airfield is divided into subsets of significant stretches for the purpose of operations and target times are established during which these are open to aircraft traffic. The document contains several mathematical models each with different functions, such as the end time of the process, the sum of the end times of each stretch and gap between the estimated and the real end times. During this process, we introduce different operating restrictions on partial fulfilment of the operational targets as applied to zones of special interest, or relating to the operation of the snow‐clearing machines. The problem is solved by optimisation based on linear programming. The article gives the results of the computational tests carried out on five distinct models of the manoeuvring area, which cover increasingly complex situations and larger areas. The mathematical model is particularised for the case of the manoeuvring area of Adolfo Suarez Madrid—Barajas Airport. Copyright © 2016 John Wiley & Sons, Ltd.

Highlights
• Optimal sequence for clearing snow from the manoeuvring area of an airport.
• Contains optimising algorithms solved using CPLEX LP‐based tree search.
• Restrictions on partial fulfilment of operational targets applied to subsets of significant stretches, used for planning the operation of snow‐clearing machines.
• Model applied to the case of the manoeuvring area of Adolfo Suárez Madrid Barajas Airport.
• Conclusions are given on the results of the computational tests carried out. There are five models of the manoeuvring area which cover increasingly complex situations and larger areas.

     

Modification of the Highway Capacity Manual two‐lane highway analysis procedure for Spanish conditions

The US Highway Capacity Manual (HCM) methodology is used in Spain to evaluate traffic operation and quality of service. The effect of passing manoeuvre on two‐lane highway operational performance is considered through adjustment factors to average travel speeds and percent time spent following. The procedure is largely based on simulations in TWOPAS and passing behaviours observed during US calibrations in the 1970s. It is not clear whether US driving behaviour and vehicles' performance are comparable with Spanish conditions. The objective of this research is to adapt the HCM 2010 methodology to Spanish driver behaviour, for base conditions (i.e. no passing restrictions). To do so, TWOPAS was calibrated and validated based on current Spanish passing field data. The calibration used a genetic algorithm. The case study included an ideal two‐lane highway with varying directional traffic flow rate, directional split and percentage of trucks. The updated methodology for base conditions is simpler than the current HCM 2010 and does not rely on interpolation from tables. Copyright © 2016 John Wiley & Sons, Ltd.     

Analyzing the theoretical capacity of railway networks with a radial-backbone topology

In this work we propose a mechanism to optimize the capacity of the main corridor within a railway network with a radial-backbone or X-tree structure. The radial-backbone (or X-tree) structure is composed of two types of lines: the primary lines that travel exclusively on the common backbone (main corridor) and radial lines which, starting from the common backbone, branch out to individual locations. We define possible line configurations as binary strings and propose operators on them for their analysis, yielding an effective algorithm for generating an optimal design and train frequencies. We test our algorithm on real data for the high speed line Madrid–Seville. A frequency plan consistent with the optimal capacity is then proposed in order to eliminate the number of transfers between lines as well as to minimize the network fleet size, determining the minimum number of vehicles needed to serve all travel demand at maximum occupancy.     

高速公路场景下的电子稳像技术研究

为了去除高速公路监控视频中自身位置不稳定的事物给全局运动矢量估计带来误差,先通过Canny算子检测图像中的直线,并根据车道边界的特征筛选出道路边界,确定道路区域。再检测道路区域内的Harris角点信息,并与背景图中道路区域内的角点位置进行匹配,从而得到全局运动矢量,并计算出稳定的图像。实验表明,该算法能够满足高速公路场景下的稳像需求。     

Prioritizing road extension projects with interdependent benefits under time constraint

Since transportation projects are costly and resources are limited, prioritizing or sequencing the projects is imperative. This study was inspired by a client who asked: “I have tens of approved road extension projects, but my financial resources are limited. I cannot construct all the projects simultaneously, so can you help me prioritize my projects?” To address this question, the benefits and costs of all the possible scenarios must be known. However, the impacts (or benefit) of road extension projects are highly interdependent, and in sizable cases cannot be specified thoroughly. We demonstrate that the problem is analogous to the Traveling Salesman Problem (TSP). Dynamic change in travel demand during construction is another aspect of the complexity of the problem. The literature is yet to provide efficient methods for large cases. To this end, we developed a heuristic methodology in which the variation of travel demand during the construction period is considered. We introduce a geometrical objective function for which a solution-finding policy based on “gradient maximization” is developed. To address the projects’ interdependency, a special neural network (NN) model was devised. We developed a search engine hybridized of Ant Colony and Genetic Algorithm to seek a solution to the TSP-like problem on the NN based on gradient maximization. The algorithm was calibrated and applied to real data from the city of Winnipeg, Canada, as well as two cases based on Sioux-Falls. The results were reliable and identification of the optimum solution was achievable within acceptable computational time.