India’s air traffic: towards an empirical framework for systems analysis

The paper explores patterns of flows within India’s Air Traffic System through the lens of carriers’ networks and route structures between 2006 and 2014. Through observations of frequency distributions and their distinct patterns an analytic framework is derived heuristically by means of classification and aggregation. The well-known skewed traffic distribution which spatially concentrates traffic around relatively few airports serves as the starting point for decomposing the air traffic system (ATS) into its constituent route types. Airline operations along distinct route classes allows for classifying individual carrier’s network features as an embedded part of the system. Discussion of their role includes a spatial component. Inferences about development paths – past, present, future – of the Indian commercial ATS can be made.     

A constraint programming model with time uncertainty for cooperative flight departures

The lack of a proper integration of strategic Air Traffic Management decision support tools with tactical Air Traffic Control interventions usually generates a negative impact on the Reference Business Trajectory adherence, and in consequence affects the potential of the Trajectory-Based Operations framework. In this paper, a new mechanism relaying on Reference Business Trajectories as a source of data to reduce the amount of Air Traffic Controller interventions at the tactical level while preserving Air Traffic Flow Management planned operations is presented. Artificial Intelligence can enable Constraint Programming as it is a powerful paradigm for solving complex, combinatorial search problems. The proposed methodology takes advantage of Constraint Programming and fosters adherence of Airspace User’s trajectory preferences by identifying tight interdependencies between trajectories and introducing a new mechanism to improve the aircraft separation at concurrence events considering time uncertainty. The underlying philosophy is to capitalize present degrees of freedom between layered Air Traffic Management planning tools, when sequencing departures at the airports by considering the benefits of small time stamp changes in the assigned Calculated Take-Off Time departures and to enhance Trajectory-Based Operations concepts.     

南海“浅深水”海域经典TLP平台整体运动性能分析

干式采油树应用于海上油气开发具有特定的优势,张力腿平台(TLP)作为重要的浮式干树开发平台具有广泛的应用。联系到我国海上油田具体特点及TLP平台所具有的诸多优势,未来TLP平台将是中国南海油气开发不可或缺的平台类型之一。本文针对经典TLP在中国南海北部“浅深水”(水深330m)油田千年一遇环境下整体运动性能与张力腱系统响应情况进行了研究,对TLP平台进行了全耦合时域计算分析,并对平台运动、张力腱响应及平台甲板气隙等进行了分析校核。分析结果表明：千年一遇生存条件下,平台张力腱系统安全;平台水平偏移较大,对立管设计挑战较大;平台甲板气隙较为临界,存在甲板上浪风险。     

Coordinated multi-aircraft 4D trajectories planning considering buffer safety distance and fuel consumption optimization via pure-strategy game

In this paper, we consider a coordinated multi-aircraft 4D (3D space plus time) trajectories planning problem which is illustrated by planning 4D trajectories for aircraft traversing an Air Traffic Control (ATC) sector. The planned 4D trajectories need to specify each aircraft’s position at any time, ensuring conflict-free and reducing fuel and delay costs, with possible aircraft maneuvers such as speed adjustment and flight level change. Different from most existing literature, the impact of buffer safety distance is also under consideration, and conflict-free is guaranteed at any given time (not only at discrete time instances). The problem is formulated as a pure-strategy game with aircraft as players and all possible 4D trajectories as strategies. An efficient maximum improvement distributed algorithm is developed to find equilibrium at which every aircraft cannot unilaterally improve further, without enumerating all possible 4D trajectories in advance. Proof of existence of the equilibrium and convergence of the algorithm are given. A case study based on real air traffic data shows that the algorithm is able to solve 4D trajectories for online application with estimated 16.7% reduction in monetary costs, and allocate abundant buffer safety distance at minimum separation point. Scalability of the algorithm is verified by computational experiments.     

解决VV120型空压机润滑油乳化问题的对策

VV120型空压机润滑油乳化,现已成为北京城市轨道交通八通线SFM型列车风源系统的顽症.除空压机自身因素外,列车风源系统的设计思路值得商榷.建议在列车现有框架通过裁减MCS型压力继电器的数量,改变空压机工作制式,修正整定值控制压力,以期达到根治润滑油乳化的目的.     

西安市交通拥堵和空气污染的成因和政策研究

近年来,西安市交通拥堵和空气污染问题突出。文章旨在分析这两大问题的现状、成因以及现行政策的效果。对于改善拥堵和空气污染,限行政策在短期内有显著效果,燃煤整治明显改善了空气质量。而从长远来看,正面效果会随着机动车数量的增长而逐渐消失。文章将有助于政府进一步针对拥堵和雾霾的长期政策研究。     

基于商用车气囊减震系统的舒适性研究

随着社会的发展,商用卡车的减震系统从最初的机械减震发展到后来流行的气囊减震,全浮式、半浮式、四点悬浮气囊结构等,说明人们对商用车的舒适性要求越来越高。文章研究全浮式气囊减震系统在商用车领域中的设计应用,舒适性要求仅通过理论计算很难获得最佳状态,应通过理论、实验相结合方式持续优化。在设计验证阶段,需要对实车进行初步测量,计算出固有参数,再通过一些特殊手段计算出相应数据作为输入,经过分析筛选出有效数据,进行分析,使用初版参数样件进行装车,最后通过不断的实际路试进行验证修正原输入参数,最终确定最佳匹配参数并固化下来用于量产。     

环境因素对战时野战机场开设影响的模糊分析

分析了野战机场环境对后勤保障影响的问题。以场务保障为例,提出了影响飞行场务保障实施的因素集,从量化角度运用模糊相似优先比决策法对几个野战机场方案对场务保障实施影响情况进行了排序。在直观地看出各个野战机场方案对场务保障支持情况基础上,说明了各个方案中影响场务保障因素的利弊,从而可以针对各个方案有的放矢地制定未来应急场务保障预案,实现场务保障快速、高效的目标。经推广研究,可以得出野战机场选址对空军后勤保障的影响,增强制定战时后勤保障预案的针对性。     

航班延误统计指标体系及延误等级评估研究

针对我国现行航班统计方法存在的缺陷,基于对航班运行全过程以及在此过程中空管、航空公司、机场等单位工作职责的分析,构建了科学系统的航班延误统计指标体系,同时设计了航班延误等级综合评估的模型。上述统计指标体系及评估方法经国内某航空公司实际试用表明,与目前民航所使用的航班正常性统计标准比较,该方法能够更加真实、准确地跟踪航班整个运行阶段的延误状况,较好地反应了航班的实际运行情况,能有效地支持航空公司运行管理部门的延误控制和公司决策层的宏观管理。     

Optimal shipment decisions for an airfreight forwarder: Formulation and solution methods

We study the freight forwarder’s shipment planning problem in an airfreight forwarding network where a set of cargo shipments have to be transported to given destinations. We provide mixed integer programming formulations that use piecewise-linear cargo rates and account for volume and weight constraints, flight departure/arrival times, as well as shipment-ready times.After exploring the solution of such models using CPLEX, we devise two solution methodologies to handle large problem sizes. The first is based on Lagrangian relaxation, where the problems decompose into a set of knapsack problems and a set of network flow problems. The second is a local branching heuristic that combines branching ideas and local search. The two approaches show promising results in providing good quality heuristic solutions within reasonable computational times, for difficult and large shipment consolidation problems.