基于改进混沌粒子群算法的薄壁件铣削参数优化

为提高薄壁框体结构件铣削加工精度及加工效率,提出一种薄壁框体结构件铣削加工工艺参数 优化方法。针对标准粒子群算法存在易陷入局部最优解,且不能自适应调整权重系数等问题,将混沌算法与多 目标粒子群算法结合,建立了以铣削力和单位时间材料去除率为优化目标,以铣削 4 因素为优化变量,以机床 主轴转速、进给量、铣削深度和表面粗糙度为约束条件的多目标约束优化模型。利用有限元仿真准确计算每个 优化解的加工误差,将结果及时反馈到优化算法中,进而找到最优加工工艺参数组合。以典型薄壁结构侧壁铣 削为例,分别采用试验参数、标准粒子群优化参数和本文所提算法优化结果进行仿真模拟,对仿真结果进行分 析比较,证明了该方法的有效性。     

多操纵面飞机变参数动态控制分配策略

针对操纵面饱和时混合优化控制分配效率低的问题, 提出一种包含执行器动态的多操纵面变参数控制分配策略. 考虑执行器物理约束和动态特性, 构建多操纵面飞机控制分配模型. 以权系数变换矩阵为参数, 将非线性混合优化控制分配律线性化. 分别建立忽略和包含执行器动态的变参数控制分配线性矩阵不等式优化模型, 并研究控制分配系统对参数变化的灵敏度. 仿真结果验证了变参数动态控制分配策略的有效性.

     

连续时间多胞线性变参数系统变增益H∞/H2输出反馈控制

针对一类同时具有参数不确定性和外界干扰的非线性系统,提出了一种连续时间多胞线性变参数(LPV)系统变增益H_∞/H_2输出反馈控制方法.首先,对连续时间多胞LPV系统的变增益混合目标(H_∞/H_2指标和区域极点约束)输出反馈控制器综合方法进行了数学描述;其次,引入新的结构化松弛矩阵变量和参数依赖Lyapunov函数,将满足期望性能的混合目标鲁棒动态输出反馈控制问题转化为线性矩阵不等式框架内的有限维凸优化问题,进一步降低了所设计LPV控制器的保守性.最后,以四分之一车辆模型主动悬架系统为研究对象进行仿真,仿真结果验证了本文控制器的有效性.     

非线性约束规划的极大熵多目标进化算法

解非线性约束规划的困难在于如何处理问题的约束,从问题的约束条件出发构造了一个新的极大熵函数,利用此函数将原非线性约束规划问题转化成了两个目标的多目标优化问题。通过对搜索操作和参数的合理设计给出了一种新的极大熵多目标进化算法。计算机仿真表明该算法对带约束的非线性优化问题求解是非常有效的。     

免疫遗传算法的混合动力汽车多目标优化

以混合动力汽车传动系统参数与控制策略参数为优化变量,以最小燃油消耗和尾气排放量（CO+HC+NOx）为优化目标,以动力性能与电池荷电状态平衡作为约束条件,建立多目标优化模型,并使用权重系数法将多目标函数优化问题转化为单目标问题。提出了基于免疫遗传算法优化混合动力汽车参数的优化方法,该算法采用实数编码,通过调用ADVISOR的后台函数,建立联合优化仿真模型。仿真结果表明,该算法可有效降低车辆的燃油消耗,减少CO与HC排放量,能够较好地解决带有约束的混合动力汽车的多目标多参数优化问题,可以获得一组具有低油耗与低污染物排放的传动系统与控制策略参数,供决策者选择。     

光伏并网逆变器LCL滤波器参数设计方法

LCL型光伏并网滤波器参数设计好坏直接影响其滤波性能、成本及电网是否容易发生谐振.针对LCL并网滤波器参数设计不易的问题,提出一种LCL滤波器参数设计方法.方法首先根据LCL滤波器并网条件下的谐波模型,分析其滤波特性及谐波电流与各滤波器参数的关系;然后按LCL滤波器设计要求确定各参数上下界,用熵值权重法把多个优化目标转化成单目标优化模型;最后通过灰狼算法寻滤波器各参数最优值.通过具体设计实例,在Matlab中搭建不同LCL滤波器设计方案的仿真模型.对比结果表明,所提方法设计的滤波器滤波效果更好,且更经济,验证了设计方法的可行性.     

多目标动态规划时段轮换并行算法

针对SIMD和MIMD结构的并行机提出多目标动态规划时段轮换并行算法,多目标动 态规划的时段轮换迭代算法,将全过程优化问题转化成子过程优化问题,然后在子过程非劣解 集中寻找全过程非劣解.这样,将多目标动态规划内存不足的问题转化成时间问题,然后利用 并行机超高速运算的优势来有效地解决内存不足问题.通过时间复杂性、加速比分析及实例. 说明了算法的有效性及优越性.     

流水车间成组工件调度问题的多目标优化算法

针对优化目标是最小化全部提前/拖期和机器调整次数的多目标流水车间成组工件调度问题,提出了一种改进的变权重进化算法结合延迟调整算法的联合优化方法。首先采用改进的变权重进化算法对加工排序进行寻优;其次,在给定调度序列的情况下采用延迟调整算法对加工时刻进行优化。仿真实验表明,所设计的算法能够有效地求解该类问题。     

解约束规划问题的新型多目标粒子群优化算法

给出了一种求解约束规划问题的新解法。新方法将约束规划问题转化成两个目标优化问题,并对转化后的多目标优化问题设计了一种新型多目标粒子群优化算法(MOPSO)。数据实验表明该算法对带约束的规划问题求解是非常有效的。     

改进NSGA-Ⅱ算法及其在切削加工参数优化中的应用

针对NSGA-Ⅱ算法种群收敛分布不均匀,全局搜索能力差,易陷入局部最优等不足,引入正交交叉策略与混合变异算子,提出一种改进的NSGA-Ⅱ算法。在测试函数上对改进NSGA-Ⅱ算法与传统NSGA-Ⅱ算法同时进行性能测试,结果表明改进的NSGA-Ⅱ算法无论是在收敛性还是多样性上均优于NSGA-Ⅱ算法。将改进算法与传统NSGA-Ⅱ算法同时应用于6061铝合金精密车削加工参数多目标优化设计中,研究结果表明改进NSGA-Ⅱ算法收敛精度更高,收敛速度更快,优化结果更加逼近全局最优解,在求解切削加工参数多目标优化问题时更加有效。     

用变长度染色体遗传算法优化加工路径的方法

加工路径优化问题属于一类特殊的旅行商问题（TSP）,针对此问题将加工路径细分为点、线段、曲线段及闭合曲线等加工要素,并提出一种基于变长度染色体遗传算法的优化方法。该方法将每个点编码为一个二元组用以表示各种加工要素,其交叉和变异操作能对一些线进行分割和合并,使加工路径能得到更大程度的优化。仿真结果表明,该方法具有良好的优化效果,可以显著地缩短辅助运动路径的长度。     

基于CPSO的混合核函数SVM参数优化及应用

支持向量机(SVM)建模的拟合精度和泛化能力取决于相关参数的选取,目前SVM中的参数的寻优一般只针对惩罚系数和核参数,而混合核函数的引入,使SVM增加了一个可调参数.针对混合核函数SVM的多参数选择问题,提出利用具有较强全局搜索能力的混沌粒子群(CPSO)优化算法对混合核函数SVM建模过程中的重要参数进行优化调整,每一...     

数字滤波器设计的文化量子算法

有限脉冲响应(FIR)和无限脉冲响应(IIR)数字滤波器的设计实质可看作是多参数优化问题。为实现高效的数字滤波器,首先将滤波器的设计转化为滤波器参数的约束优化问题,然后提出文化量子(CQ)算法在参数空间进行并行搜索以获得滤波器设计的最优参数值。提出的文化量子算法结合文化原理,在量子种群空间更新中使用了量子旋转门的知识进化机制,是一种可用于实数解优化的快速多维搜索算法。计算机仿真实验表明在对FIR和IIR数字滤波器设计时,文化量子算法的收敛速度和性能都优于粒子群,量子粒子群以及自适应量子粒子群优化等算法,证明了该方法的有效性和优越性。     

Digital twin-driven surface roughness prediction and process parameter adaptive optimization

In the process of parts machining, the real-time state of equipment such as tool wear will change dynamically with the cutting process, and then affect the surface roughness of parts. The traditional process parameter optimization method is difficult to take into account the uncertain factors in the machining process, and cannot meet the requirements of real-time and predictability of process parameter optimization in intelligent manufacturing. To solve this problem, a digital twin-driven surface roughness prediction and process parameter adaptive optimization method is proposed. Firstly, a digital twin containing machining elements is constructed to monitor the machining process in real-time and serve as a data source for process parameter optimization; Then IPSO-GRNN (Improved Particle Swarm Optimization-Generalized Regression Neural Networks) prediction model is constructed to realize tool wear prediction and surface roughness prediction based on data; Finally, when the surface roughness predicted based on the real-time data fails to meet the processing requirements, the digital twin system will warn and perform adaptive optimization of cutting parameters based on the currently predicted tool wear. Through the development of a process-optimized digital twin system and a large number of cutting tests, the effectiveness and advancement of the method proposed in this paper are verified. The organic combination of real-time monitoring, accurate prediction, and optimization decision-making in the machining process is realized which solves the problem of inconsistency between quality and efficiency of the machining process.     

Pocketing toolpath computation using an optimization method

This paper proposes a new method of pocketing toolpath computation based on an optimization problem with constraints. Generally, the calculated toolpath has to minimize the machining time and respect a maximal effort on the tool during machining. Using this point of view, the toolpath can be considered as the result of an optimization in which the objective is to minimize the travel time and the constraints are to check the forces applied to the tool. Thus a method based on this account and using an optimization algorithm is proposed to compute toolpaths for pocket milling. After a review of pocketing toolpath computation methods, the framework of the optimization problem is defined. A modeling of the problem is then proposed and a solving method is presented. Finally, applications and experiments on machine tools are studied to illustrate the advantages of this method.     

Application of ant colony optimization algorithm in process planning optimization

One objective of process planning optimization is to cut down the total cost for machining process, and the ant colony optimization (ACO) algorithm is used for the optimization in this paper. Firstly, the process planning problem, considering the selection of machining resources, operations sequence optimization and the manufacturing constraints, is mapped to a weighted graph and is converted to a constraint-based traveling salesman problem. The operation sets for each manufacturing features are mapped to city groups, the costs for machining processes (including machine cost and tool cost) are converted to the weights of the cities; the costs for preparing processes (including machine changing, tool changing and set-up changing) are converted to the ‘distance’ between cities. Then, the mathematical model for process planning problem is constructed by considering the machining constraints and goal of optimization. The ACO algorithm has been employed to solve the proposed mathematical model. In order to ensure the feasibility of the process plans, the Constraint Matrix and State Matrix are used in this algorithm to show the state of the operations and the searching range of the candidate operations. Two prismatic parts are used to compare the ACO algorithm with tabu search, simulated annealing and genetic algorithm. The computing results show that the ACO algorithm performs well in process planning optimization than other three algorithms.     

Multi-objective optimization of machining and micro-machining processes using non-dominated sorting teaching–learning-based optimization algorithm

Selection of optimum machining parameters is vital to the machining processes in order to ensure the quality of the product, reduce the machining cost, increasing the productivity and conserve resources for sustainability. Hence, in this work a posteriori multi-objective optimization algorithm named as Non-dominated Sorting Teaching–Learning-Based Optimization (NSTLBO) is applied to solve the multi-objective optimization problems of three machining processes namely, turning, wire-electric-discharge machining and laser cutting process and two micro-machining processes namely, focused ion beam micro-milling and micro wire-electric-discharge machining. The NSTLBO algorithm is incorporated with non-dominated sorting approach and crowding distance computation mechanism to maintain a diverse set of solutions in order to provide a Pareto-optimal set of solutions in a single simulation run. The results of the NSTLBO algorithm are compared with the results obtained using GA, NSGA-II, PSO, iterative search method and MOTLBO and are found to be competitive. The Pareto-optimal set of solutions for each optimization problem is obtained and reported. These Pareto-optimal set of solutions will help the decision maker in volatile scenarios and are useful for real production systems.     

The covariance intersection fusion estimation algorithm weighted by diagonal matrix based on genetic simulated annealing algorithm and machine learning

This paper is concerned with covariance intersection (CI) fusion for multi-sensor linear time-varying systems with unknown cross-covariance. Firstly, a CI fusion weighted by diagonal matrix (DCI) is proposed, and it is proved to be unbiased and robust and has higher accuracy than classical CI fusion. Secondly, the genetic simulated annealing (GSA) algorithm is used for multi-parameter optimization problem caused by diagonal matrix weights. Considering the serious time-consuming problem in optimization process of the GSA algorithm, Back Propagation (BP) network is used to obtain the optimal weights. Eventually, the DCI based on GSA algorithm and BP network is proposed. The proposed algorithm has higher accuracy and better stability than classic CI fusion algorithms. Simulation analyses verify the effectiveness and correctness of the conclusion.     

基于遗传算法的分段Chen系统的参数估计

对比研究了单种群遗传算法和多种群遗传算法在分段Chen系统参数估计中的应用,通过构造一个合适的适应度函数,将Chen系统的多参数估计问题转化成一个多参数的寻优问题,利用遗传算法全局寻优性对其进行计算。仿真结果表明,相对于采用单种群遗传算法估计分段Chen系统参数,多种群遗传算法在准确性、鲁棒性方面具有明显的优势。     

基于改进遗传算法的立体视觉系统标定

立体视觉系统的摄像机标定是一个多参数、非线性的复杂函数优化问题,传统优化方法很难解决。论文对标准遗传算法的编码方式进行了改进,经过改进后的遗传算法具有变量搜寻区间的自适应调整能力,在保持染色体编码长度不变的情况下,能同时满足变量搜索空间大小和编码精度的要求。利用改进了的遗传算法对双目视觉系统摄像机进行标定的结果表明,该算法能有效地实现高维寻优空间的近优解搜索。