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.

     

多功能深水环保船建造检验要点综述

作为海上环境保护的专用船舶,深水环保船具有海面溢油回收、应急指挥、油污消除及对外消防等作业能力,主要用于我国深水海域石油勘探开采过程中测试井液/污油水的接收与返送。文章针对深水环保船新型设计,着重介绍船舶性能、动力定位、溢油回收等三大特点。此船舶是国内现有航速最快、主尺度最大、功能最先进、装备最齐全、载运能力最大及回收能力最强的多功能专用船舶,即将服役于东海与南海深水海域。     

汉语编程在MapX二次开发中的应用

交通地理信息系统因具有强大的信息服务和管理功能,越来越受到人们的重视。MapX作为GIS设计中一个常用的功能组件．其当前的主要编程环境是英文,这对于英文程度不高的汉语软件开发者来说无疑是个羁绊。因此,通过实例详细说明在易语言汉语编程开发环境下如何利用MapX开发GIS软件的方法,对于该组件的进一步推广应用具有一定的意义。     

陆上空箱调运模糊优化研究

应用模糊规划的方法建立了内陆空箱多式联运调运优化模型,研究多种运输方式下的内陆集装箱空箱调运问题。在调运优化模型的基础上给出了不同运输时间和不同运输费用下的成本最低的调运方案.旨在为船公司提供费用最低的内陆空集装箱调运方案,提高船公司的空箱管理水平。     

永磁操动机构的动态分析

给出了永磁操动机的基本原理及负载特性,分析了磁场耦合模型及工作过程中的电磁机理的对对合成磁场的电磁吸力,动态铁芯的运动方程及算法原理进行了研究。最后对永磁操动技术的优越性及特点,以及在我国应用前景进行了简单分析。     

基于MS-Fortran Powerstation V4.0的有限元分析系统BNAP

介绍新一代Fortran语言编译器 (MS FortranPowerstationV4 0 )的主要特点及其进行有限元分析系统开发的相关步骤 ,最后给出具体的应用示例 .     

Numerical investigation of turbulence near a sheared air–water interface. Part 1: Turbulence statistics beneath a flat water surface sheared by wind

Direct numerical simulation (DNS) and large eddy simulation (LES) of turbulent shear flow beneath a flat water surface with imposed wind shear stress are presented. The results of DNS indicate that there are clear differences, and also similarities, between wind-driven flow and the flow near a solid wall. The qualitative structures of turbulence are similar in both types of flow. Low-speed streaks are also present in wind-driven flow. On the other hand, profiles of the mean velocity and turbulence intensities in wind-driven flow are significantly different from those in flow near a solid wall. The differences are attributed to the lack of a viscous sublayer, and to the boundary condition which allows fluctuations of the tangential velocity components at the boundary. LES of the same flow was also carried out to evaluate subgrid-scale models. It was shown that the features of the flow observed in DNS are well simulated by all models tested, and that the discrepancies between DNS and LES with the dynamic mixed model are very small. Received: August 17, 2000 / Accepted: December 22, 2000     

�������·�������ģ�ͼ����㷨

在物流活动的商品配送运输中，由于受不确定因素的干扰，对配送车辆调度的适时性造成了很大影响，从而增加了配送成本和降低了配送的服务质量。本文考虑客户对配送时间的要求和车辆行驶时间的不确定性，建立了以车辆配送总行驶距离最小化为目标的机会约束规划模型，并构造了求解该模型的单亲遗传算法，通过实例对模型求解，结果表明，该算法是很有效的。     

基于动态规划的多目标的TBD算法

在弱目标检测领域中,动态规划法是一种有效的能量积累方法。文章针对低信噪比下的多目标检测问题,提出了一种基于动态规划的多目标检测前跟踪算法。该算法能够较有效地估计搜索空间中的目标个数,也能分离出每个目标的航迹。