舰艇编队信息融合中模糊C-均值算法改进研究

在分析舰艇编队信息处理融合的基础上,提出舰艇编队信息融合体系结构、模型和实现框架。针对原C-均值算法在处理数据时的不合理性,提出了改进的模拟C-均值算法,提高分类效果,满足信息融合的实时要求和可靠性要求。     

浅谈新常态下海员的现状与可持续发展

海员是我国从海洋大国向海洋强国转变的中流砥柱,他们为发展国民经济、保证航运安全和扩大对外开放做出了巨大的贡献。但是从当前形势来分析,我国对海员的教育培训力度和关怀力度却远远跟不上海洋经济的发展。文中主要指出我国海员目前所面临的发展现状,结合国外海员的发展模式及可吸取的经验,对我国海员的可持续发展做出较为全面的策略探讨。     

Development and calibration of a long-distance passenger traffic assignment model

This paper studies the assignment of long-distance passenger traffic on a highway corridor network. First, we propose a traditional model for the long-distance traffic assignment considering interactions with local commuter traffic. It addresses the effect of local networks on highway corridors. An iterative algorithm is developed to solve for the exact solution. Then, to address the potential computational issues that arise therein, a decomposition method is proposed by introducing a new concept of corridor elasticity. An assignment procedure for long-distance passenger traffic is developed accordingly. Numerical tests show that the proposed decomposition method makes significant improvements in computational performance at a small loss of optimality. This decomposition method well approximates the exact assignment from the traditional formulation, especially when the highway corridors are near-saturation. The proposed decomposition method appears practical for application.     

考虑横向漂移的船舶路径跟踪自抗扰控制

针对船舶运动系统中内部动态不确定和外部干扰等问题,进行了欠驱动船舶路径跟踪的自抗扰方法研究。利用Backstepping设计参考航向角,并通过线性扩张状态观测器对流干扰和横向运动引起的横向漂移进行估计。其次,根据自抗扰算法对航向进行控制,采用线性扩张状态观测器对外界干扰及内部不确定项进行估计。最后仿真结果表明,在风流干扰下所设计的控制器仍能使船准确地跟踪上参考路径,验证了所提控制方案的有效性。     

基于BP网络的球鼻首参数化优化

本文以某集装箱船为研究对象,对降速航行后的球鼻首进行优化。采用Catia建立船体三维模型,为了产生不同形状的球鼻首,选取球鼻特征参数来描述其基本结构;采用拉丁超立方试验抽样方法得到12组不同形状的球鼻首,提出运用非线性拟合能力较强的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.     

可持续交通——各方观点和长期挑战

从交通研究者和实践者的角度出发,以可持续交通这一概念为中心展开讨论。可持续交通宽泛地反映了可持续发展在交通领域的原则。随着可持续性这一概念的外延逐渐扩大,在它的定义、应用和价值取向上出现了不同观点。着重讨论可持续交通,以及如何理解和运用可持续交通,包括:1)将可持续性或者可持续发展作为一个整体的概念,包括关于可持续性的不同方法和定义之间的冲突;2)对可持续交通以及交通领域对其理解的探索;3)使用指标来实现可持续性的应用。然后识别了通往可持续交通之路的若干挑战,包括缺乏清晰定义、可持续性的固有冲突、可持续发展的跨领域本质、各种工作框架和指标体系、可持续发展的政治因素和交通领域实践中的不同观点。基于在该课题上的研究积累,总结解决这些问题的工作框架,提出因地制宜、注重结果、整体的方法来解决可持续交通中的挑战。     

Methods to reduce dimensionality and identify candidate solutions in multi-objective signal timing problems

Adjusting traffic signal timings is a practical way for agencies to manage urban traffic without the need for significant infrastructure investments. Signal timings are generally selected to minimize the total control delay vehicles experience at an intersection, particularly when the intersection is isolated or undersaturated. However, in practice, there are many other potential objectives that might be considered in signal timing design, including: total passenger delay, pedestrian delays, delay inequity among competing movements, total number of stopping maneuvers, among others. These objectives do not tend to share the same relationships with signal timing plans and some of these objectives may be in direct conflict. The research proposes the use of a new multi-objective optimization (MOO) visualization technique—the mosaic plot—to easily quantify and identify significant tradeoffs between competing objectives using the set of Pareto optimal solutions that are normally provided by MOO algorithms. Using this tool, methods are also proposed to identify and remove potentially redundant or unnecessary objectives that do not have any significant tradeoffs with others in an effort to reduce problem dimensionality. Since MOO procedures will still be needed if more than one objective remains and MOO algorithms generally provide a set of candidate solutions instead of a single final solution, two methods are proposed to rank the set of Pareto optimal solutions based on how well they balance between the competing objectives to provide a final recommendation. These methods rely on converting the objectives to dimensionless values based on the optimal value for each specific objectives, which allows for direct comparison between and weighting of each. The proposed methods are demonstrated using a simple numerical example of an undersaturated intersection where all objectives can be analytically obtained. However, they can be readily applied to other signal timing problems where objectives can be obtained using simulation outputs to help identify the signal timing plan that provides the most reasonable tradeoff between competing objectives.     

An optimal data-splitting algorithm for aircraft scheduling on a single runway to maximize throughput

In this research, we present a data-splitting algorithm to optimally solve the aircraft sequencing problem (ASP) on a single runway under both segregated and mixed-mode of operation. This problem is formulated as a 0–1 mixed-integer program (MIP), taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting, with the objective of maximizing the total throughput. Varied scenarios of large scale realistic instances of this problem, which is NP-hard in general, are computationally difficult to solve with the direct use of commercial solver as well as existing state-of-the-art dynamic programming method. The design of the algorithm is based on a recently introduced data-splitting algorithm which uses the divide-and-conquer paradigm, wherein the given set of flights is divided into several disjoint subsets, each of which is optimized using 0–1 MIP while ensuring the optimality of the entire set. Computational results show that the difficult instances can be solved in real-time and the solution is efficient in comparison to the commercial solver and dynamic programming, using both sequential, as well as parallel, implementation of this pleasingly parallel algorithm.