应力约束下车架的结构拓扑优化设计

根据汽车车架的结构及受力特点，建立了汽车车架结构拓扑优化模型，对薄板结构的极限应力分析表明，应力约束下汽车车架结构拓扑优化可用薄板结构尺寸优化方法的数学模型来描述，并用修改的满应力法求解。文中的数值结果表明这个方法是有效的算法。     

贵港至梧州航道发展的制约因素及对策简析

文章基于贵港至梧州航道的发展现状,从航道发展规划、流量、船闸门坎水深、桥梁通航净空高度等方面分析了制约贵港至梧州航道发展的主要因素,提出了针对性的解决对策,为贵港至梧州航道整治与提升工作提供思路。     

单频GPS进行高精度线路测量和有轨车辆定位的有效方法

轨道线路测量和有轨车辆的定位常采用GPS定位技术。利用GPS单频接收机实现高精度快速定位的关键是提高GPS单频相位模糊度解算的效率和成功率。基于轨道线路垂直方向变化不大和有轨车辆沿一定线路行驶的特点,提出一种有效的单频相位模糊度解算方法。对GPS单频接收机提供的定位观测值进行粗差探测、修正和剔除等数据预处理,用低噪声和低多路径效应的载波相位观测值对码伪距观测值进行平滑处理,再用附加约束的方法估计双差模糊度实数解,以此为基础进行模糊度搜索固定。算例显示,该方法可提高模糊度实数解估计的精度和可靠性,缩小模糊度的搜索空间,使模糊度解算效率和成功率得到提高,有利于单频GPS接收机在高精度的线路测量和有轨车辆的定位中得到更广泛的应用。     

轮轨接触几何分析及其在Maple下的实现

为满足列车动力学仿真对轮轨接触点位置的精度要求,采用解析方法建立轮轨空间接触几何的约束方程组,并给出其在二维轮轨接触几何情形时的简化形式.以S1002车轮踏面和UIC60钢轨为例,基于符号计算平台Maple软件对该约束方程组进行求解,得到轮轨接触几何参数.结果表明:二维轮轨接触时的滚动半径差、接触角差、接触点在车轮踏面...     

运用Capital Integrator CWS自动生成导线的方法

本文介绍了运用Capital Integrator中的CWS(综合布线)进行汽车线束中导线自动布线的方法,从车辆配置选项的维护、原理图的设计、拓扑图设计以及导线合成约束规则的制定到最后的导线生成进行了全面阐述,并着重对约束规则的制定进行了说明,通过使用该方法可大大提高设计工作效率并提高设计质量。     

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.     

利用CSP技术辅助汽车驾驶室内布置方案设计

本文半约束满足问题用于驾驶室内布置方案设计问题求解，提出了驾驶室内各对象之间的约束描述及分层，建立了约束网络及求解策略，并提出了目标方案修改决策。     

Integrated scheduling of m-truck,m-drone,and m-depot constrained by time-window,drop-pickup,and m-visit using constraint programming

The idea of deploying unmanned aerial vehicles, also known as drones, for final-mile delivery in logistics operations has vitalized this new research stream. One conceivable scenario of using a drone in conjunction with a traditional delivery truck to distribute parcels is discussed in earlier literature and termed the parallel drone scheduling traveling salesman problem (PDSTSP). This study extends the problem by considering two different types of drone tasks: drop and pickup. After a drone completes a drop, the drone can either fly back to depot to deliver the next parcels or fly directly to another customer for pickup. Integrated scheduling of multiple depots hosting a fleet of trucks and a fleet of drones is further studied to achieve an operational excellence. A vehicle that travels near the boundary of the coverage area might be more effective to serve customers that belong to the neighboring depot. This problem is uniquely modeled as an unrelated parallel machine scheduling with sequence dependent setup, precedence-relationship, and reentrant, which gives us a framework to effectively consider those operational challenges. A constraint programming approach is proposed and tested with problem instances of m-truck, m-drone, m-depot, and hundred-customer distributed across an 8-mile square region.     

An efficient algorithm for smoothing airspace congestion by fine-tuning take-off times

Current technological advances in communications and navigation have improved air traffic management (ATM) with new decision support tools to balance airspace capacity with user demands. Despite agreements achieved in flying reference business trajectories (RBTs) among different stakeholders, tight spatio-temporal connectivity between trajectories in dense sectors can cause perturbations that might introduce time or space deviations into the original RBTs, thus potentially affecting other 4D trajectories. In this paper, several challenging results are presented by properly tuning the Calculated Take-Off Times (CTOTs) as a tool for mitigating the propagation of perturbations between trajectories that can readily appear in dense sectors. Based on the identification of “collective microregions”, a tool for predicting potential spatio-temporal concurrence events between trajectories over the European airspace was developed, together with a CTOT algorithm to sequence the departures that preserve the scheduled slots while relaxing tight trajectory interactions. The algorithm was tested by considering a realistic scenario (designed and analyzed in the STREAM project (Stream, 2013)) to evaluate relevant ATM KPIs that provide aggregated information about the sensitivity of the system to trajectory interactions, taking into account the system dynamics at a network level. The proposed approach contributes to enhancing the ATM capacity of airports to mitigate network perturbations.     

基于车次径路约束下的客运径路生成算法优化

针对目前客票径路计算中径路信息与实际旅客出行径路之间存在的差异性,从分析径路生成的计算模型出发,结合铁路通票业务背景,提出一种车次约束机制下的径路生成计算方法。算法以选择性集中存储为径路存取方式,实现径路公共信息的全路共享与车站特殊径路的分布式存取,有效压缩径路信息存储空间,提高径路选择效率;以车站-车次邻接表为基本数据结构,将铁路路网图改进为列车约束下的列车可达图,保证车站生成个性化径路的合理性和有效性;算法摒弃原有径路计算只计算本站至全路各个结算站间最短K路径的方法,分车站特殊径路计算和公共径路计算两步实现径路的计算,从根本上保证径路计算的有效性,解决通票径路与列车走行径路不符问题,实现了对现有径路生成算法的优化。