基于神经网络和遗传算法的系泊线长度参数优化

摘 要: 针对多成分系泊线三段长度如何取值的问题,采用一种基于神经网络和遗传算法对深海多成分锚泊系统长度进行优化。应用AQWA软件计算多点系泊FPSO,其时域结果直接用于训练BP神经网络。从而利用神经网络的非线性映射功能构建替代锚泊时域计算网络,大大缩短了优化所需的时间。以FPSO最小平面运动值为目标函数,锚链破断强度作为约束条件,采用遗传算法优化系泊长度。计算结果表明,与传统设计的锚泊长度相比,优化后FPSO在各个浪向下纵荡横荡值均能减少20%以上。 关键词:系泊;神经网络;遗传算法;优化     

基于稳性实时计算技术的船舶破损智能扶正系统研究

基于船舶稳性实时计算技术研究船舶实时状态三维模型数字化算法用于快速计算船舶的大倾角稳性、破舱稳性和平衡浮态。参考遗传算法研究船舶破损智能扶正方案生成算法来实现智能生成扶正方案功能。然后运用上述两种核心算法设计船舶破损智能扶正系统软件,为船舶在突发破损事故时提供一套包含压载水调拨措施与步骤建议的智能扶正方案,提高船舶破损事故的处理能力。     

基于改进GA优化的水下机器人航向鲁棒控制

基于某型号水下机器人水平面线性化模型,针对水下机器人系统存在的多种不确定因素,工作环境复杂多变的问题,采用混合灵敏度法设计水下机器人航向鲁棒控制器。在设计中,通过罚函数小生境遗传适应度值作为桥梁建立起遗传寻优与混合灵敏度参数之间的关系,构成多目标优化问题寻优加权函数。实验结果表明,所用方法可在保证系统较强鲁棒性的同时,又能兼顾时域指标和混合灵敏度加权函数频域要求,获得综合性能指标最优的鲁棒控制器,控制效果较好。     

EDA-VNS混合算法在求解同序Flow-shop问题中的应用

EDA（Estimation Distribution Algorithms,分布估计算法）是进化计算领域新兴起的一类随机优化算法,和遗传算法从微观上模拟生物进化的机理不同,EDA是从宏观上对生物群体整体分布的建模和模拟。由于EDA对微观概念上的搜索不太理想,文章将一种VNS（Variable Neighborhood Search,变邻域搜索）算法与EDA结合来完成对问题解的搜索。经过试验验证,EDA-VNS混合算法在求解同序Flow-shop问题比遗传算法有较好的性能。     

Application of genetic algorithms for joint optimization of signal setting parameters and dynamic traffic assignment for the real network data

This paper presents the joint optimization of signal setting parameters and dynamic user equilibrium (DUE) traffic assignment for the congested urban road network. The simulation-based approach is employed to obtain the DUE condition for the case of multiple-origin multiple-destination traffic flows. The dynamic traffic assignment simulation program (DTASP), developed in C language is used to assign the traffic dynamically on the road network, whereas method of successive averages (MSA) is modified and used to arrive at the DUE condition. The artificial intelligence technique of genetic algorithms (GAs) is applied to obtain the optimal signal setting parameters and path flow distribution factor for DUE condition. The methodology developed in such a way that joint optimization of signal setting parameters with DUE is obtained. The proposed method is applied to the real network data of Fort Area of Mumbai city comprising of 17 nodes and 56 unidirectional links with 72 Origin–Destination pairs, where all the 17 nodes are signalized intersections. The traffic flow condition for the optimized signal setting parameters is considerably improved compared to the existing signal settings. The results prove that the GA is an effective technique to solve the joint optimization problem for the real network data.     

基于海浪干扰滤波器的UUV近水面深度控制

针对UUV在近水面航行过程中海浪波动对深度计测量造成较大干扰进而影响深度控制效果的问题,设计一种带有海浪干扰滤波器的UUV深度控制方法。分析UUV海试中深度控制性能,选取合适的参数设计海浪干扰滤波器并验证了其滤波效果。考虑到PID控制器参数选择难的问题,采用遗传算法对其控制参数实现在线自整定。最后将实时海浪加入到UUV深度控制系统进行仿真实验,并将仿真结果与海试数据对比,结果表明本文提出的方法可有效的抑制海浪干扰,改善UUV近水面深度控制效果,具有一定的工程实际意义。     

基于遗传算法的舰船航速模糊控制研究

研究并建立了舰船航速控制系统的数学模型,并将模糊控制理论应用到该系统,提出了一种基于遗传算法的舰船航速模糊控制新方法。该方法较常规的模糊控制具有更优的控制性能,仿真实验结果表明该方法可行、有效。     

基于遗传算法的高速铁路行车调整模型

高速铁路采用“高中速列车共线运行”的运输模式,其行车调度具有高实时性和整体性两大特点。以列车计划运行图为优化目标,给出运行图之间的距离定义,建立列车运行调整数学模型,给出列车的发车时刻、股道数量、列车在区间的运行时分、追踪运行间隔时间、维修天窗时间5个约束条件表达式。按照遗传算法的原理,采用罚函数的方法对数学模型中的约束条件进行处理并建立适应度函数,采用整数编码方法对个体进行编码,并定义交叉算子和变异算子。基于遗传算法的调整算法流程开发列车运行调度仿真子系统。仿真结果表明:使用该模型可大大减轻调度人员的工作量,彻底摒弃了在计算机上手工拖动运行线确定列车运行时刻的调整方式,提高了列车运行调整的科学性。该模型已应用在高速铁路综合调度仿真系统中。     

利用残余力概念进行结构损伤识别

提出一种利用残余力进行结构损伤识别方法。用刚度损伤系数将有限元模型参数化来描述结构的损伤。用特征值和特征向量预测算法构造目标函数,利用两点交叉算子的二进制代码的遗传算法反复迭代优化刚度损伤系数,获得待测结构的损伤系数、损伤位置与损伤程度的信息。通过一个平面桁架对该方法进行验证,结果表明:利用残余力概念进行损伤识别所得结构的损伤系数与理论值很接近。该方法能够较准确地判断结构的损伤位置和损伤程度。     

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.