基于粒子群优化的有约束模型预测控制器

研究了模型预测控制(MPC)中解决带约束的优化问题时所用到的优化算法,针对传统的二次规划(QP)方法的不足,引入了一种带有混沌初始化的粒子群优化算法(CPSO),将其应用到模型预测控制中,用十解决同时带有输入约束和状态约束的控制问题.最后,引入了一个实际的带有约束的线性离散系统的优化控制问题,分别用二次规划和粒子群优化两种算法去解决,通过仿真结果的比较,说明了基于粒子群优化(PSO)的模型预测控制算法的优越性.     

Optimization of production time in the multi-pass milling process via a Robust Grey Wolf Optimizer

In order to optimize multi-pass milling process, selection of optimal values for the parameters of the process is of great importance. The mathematical model for optimization of multi-pass milling process is a multi-constrained nonlinear programing formulation which is hard to be solved. Therefore, a novel robust meta-heuristic algorithm named Robust Grey Wolf Optimizer (RGWO) is proposed. In order to develop a RGWO, a robust design methodology named Taguchi method is utilized to tune the parameters of the algorithm. Therefore, in contradiction to previous researches, there is no need to design costly experiments to obtain the optimal values of the parameters of the GWO. In addition, an efficient constraint handling approach is implemented to handle complex constraints of the problem. A real-world problem is adopted to show the effectiveness and efficiency of the proposed RGWO in optimizing the milling process within different strategies. The results indicated that the RGWO outperforms the other solution methods in the literature as well as two novel meta-heuristic algorithms by obtaining better and feasible solutions for all cutting strategies.

     

基于混沌粒子群优化的约束状态反馈预测控制算法

提出一种基于混沌粒子群优化的约束状态反馈预测控制算法,用于解决带有输入约束和状态约束的控制问题.将混沌粒子群优化引入到约束状态反馈预测控制的滚动优化过程中,增强了算法在约束范围内的局部搜索和全局搜索能力.通过对一个实际的带有约束的线性离散系统控制优化问题的解决,验证了基于混沌粒子群优化的状态反馈预测控制算法的可行性和有效性,与传统的二次规划算法的比较结果说明了此算法的优越性,证明了状态反馈预测控制系统良好的鲁棒性.     

一种基于混沌粒子群优化的OFDM系统资源分配算法

针对无线多用户正交频分复用（OFDM）系统中功率分配问题,提出一种基于效用函数最大化框架的资源分配算法.在实际网络环境中,此类最优化算法为非凸的,利用经典最优化方法很难解决.为此,将智能优化中的粒子群方法应用到非凸优化算法设计中,并针对粒子群优化容易陷入局部极值点的问题,将Logistic混沌搜索嵌入PSO算法中,提出混沌粒子群算法.与同类算法相比,所提出算法不仅有效解决了非凸性问题,而且可以使系统具有更好的性能.     

基于元胞粒子群算法的数控切削参数优化

针对数控切削参数优化问题的非线性和多约束性质,采用一种元胞粒子群算法（CPSO）进行优化。在基本粒子群算法（PSO）思想的基础上,引入邻居的概念,以搜索解空间的局部信息,并将粒子的信息交流范围扩展到种群外部,从而能搜索到更有希望的解空间;在罚函数机制的基础上,引入标志变量记录粒子是否曾经满足过所有约束条件,根据标志变量进行粒子个体极值与种群全局极值的更新。通过比较CPSO算法与其他算法取得的结果,验证该算法解决数控切削参数优化问题的有效性和优越性。     

Parameter optimization of a multi-pass milling process using non-traditional optimization algorithms

The effective optimization of machining process parameters affects dramatically the cost and production time of machined components as well as the quality of the final products. This paper presents optimization aspects of a multi-pass milling operation. The objective considered is minimization of production time (i.e. maximization of production rate) subjected to various constraints of arbor strength, arbor deflection, and cutting power. Various cutting strategies are considered to determine the optimal process parameters like the number of passes, depth of cut for each pass, cutting speed, and feed. The upper and lower bounds of the process parameters are also considered in the study. The optimization is carried out using three non-traditional optimization algorithms namely, artificial bee colony (ABC), particle swarm optimization (PSO), and simulated annealing (SA). An application example is presented and solved to illustrate the effectiveness of the presented algorithms. The results of the presented algorithms are compared with the previously published results obtained by using other optimization techniques.     

Cellular particle swarm optimization

This paper proposes a cellular particle swarm optimization (CPSO), hybridizing cellular automata (CA) and particle swarm optimization (PSO) for function optimization. In the proposed CPSO, a mechanism of CA is integrated in the velocity update to modify the trajectories of particles to avoid being trapped in the local optimum. With two different ways of integration of CA and PSO, two versions of CPSO, i.e. CPSO-inner and CPSO-outer, have been discussed. For the former, we devised three typical lattice structures of CA used as neighborhood, enabling particles to interact inside the swarm; and for the latter, a novel CA strategy based on “smart-cell” is designed, and particles employ the information from outside the swarm. Theoretical studies are made to analyze the convergence of CPSO, and numerical experiments are conducted to compare the proposed algorithm with different variants of PSO. According to the experimental results, the proposed method performs better than other variants of PSO on benchmark test functions.     

Co-evolutionary particle swarm optimization to solve constrained optimization problems

This paper presents a co-evolutionary particle swarm optimization (CPSO) algorithm to solve global nonlinear optimization problems. A new co-evolutionary PSO (CPSO) is constructed. In the algorithm, a deterministic selection strategy is proposed to ensure the diversity of population. Meanwhile, based on the theory of extrapolation, the induction of evolving direction is enhanced by adding a co-evolutionary strategy, in which the particles make full use of the information each other by using gene-adjusting and adaptive focus-varied tuning operator. Infeasible degree selection mechanism is used to handle the constraints. A new selection criterion is adopted as tournament rules to select individuals. Also, the infeasible solution is properly accepted as the feasible solution based on a defined threshold of the infeasible degree. This diversity mechanism is helpful to guide the search direction towards the feasible region. Our approach was tested on six problems commonly used in the literature. The results obtained are repeatedly closer to the true optimum solution than the other techniques.     

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

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

一种求解作业车间调度的文化粒子群算法*

提出了一种文化粒子群算法用于求解置换流水车间调度问题中的最小化最大完成时间。算法设置了群体空间和信念空间两类独立空间,群体空间采用自适应粒子群算法完成进化,信念空间通过更新函数来进行演化。算法中群体空间的粒子群不但通过跟踪个体极值和全局极值来更新自己,实现群体演化,而且通过不断与信念空间中的优秀个体交互,加快群体的收敛速度。该算法在不同规模的问题实例上与其他几个具有代表性的算法的比较结果表明,该算法具有较快的收敛速度,无论是在求解质量还是稳定性方面都优于比较的算法。     

Chaotic particle swarm optimization for assembly sequence planning

Assembly sequence planning of complex products is difficult to be tackled, because the size of the search space of assembly sequences is exponentially proportional to the number of parts or components of the products. Contrasted with the conventional methods, the intelligent optimization algorithms display their predominance in escaping from the vexatious trap. This paper proposes a chaotic particle swarm optimization (CPSO) approach to generate the optimal or near-optimal assembly sequences of products. Six kinds of assembly process constraints affecting the assembly cost are concerned and clarified at first. Then, the optimization model of assembly sequences is presented. The mapping rules between the optimization model and the traditional PSO model are given. The variable velocity in the traditional PSO algorithm is changed to the velocity operator (vo) which is used to rearrange the parts in the assembly sequences to generate the optimal or near-optimal assembly sequences. To improve the quality of the optimal assembly sequence and increase the convergence rate of the traditional PSO algorithm, the chaos method is proposed to provide the preferable assembly sequences of each particle in the current optimization time step. Then, the preferable assembly sequences are considered as the seeds to generate the optimal or near-optimal assembly sequences utilizing the traditional PSO algorithm. The proposed method is validated with an illustrative example and the results are compared with those obtained using the traditional PSO algorithm under the same assembly process constraints.     

Continuum topology optimization with non-probabilistic reliability constraints based on multi-ellipsoid convex model

Using a quantified measure for non-probab ilistic reliability based on the multi-ellipsoid convex model, the topology optimization of continuum structures in presence of uncertain-but-bounded parameters is investigated. The problem is formulated as a double-loop optimization one. The inner loop handles evaluation of the non-probabilistic reliability index, and the outer loop treats the optimum material distribution using the results from the inner loop for checking feasibility of the reliability constraints. For circumventing the numerical difficulties arising from its nested nature, the topology optimization problem with reliability constraints is reformulated into an equivalent one with constraints on the concerned performance. In this context, the adjoint variable schemes for sensitivity analysis with respect to uncertain variables as well as design variables are discussed. The structural optimization problem is then solved by a gradient-based algorithm using the obtained sensitivity. In the present formulation, the uncertain-but bounded uncertain variations of material properties, geometrical dimensions and loading conditions can be realistically accounted for. Numerical investigations illustrate the applicability and the validity of the present problem statement as well as the proposed numerical techniques. The computational results also reveal that non-probabilistic reliability-based topology optimization may yield more reasonable material layouts than conventional deterministic approaches. The proposed method can be regarded as an attractive supplement to the stochastic reliability-based topology optimization.     

结合局部优化算法的改进粒子群算法研究

提出了结合局部优化算法的改进粒子群算法（Combination Particle Swarm Optimization,CPSO）,粒子群算法虽然通过群体规模来规避早熟,但缺乏局部快速搜索能力,因此将局部优化算法与改进粒子群算法相结合,并尝试不同的局部优化算法,例如牛顿法、最速下降法,通过典型函数优化实验表明,与其他改进粒子群算法相比,CPSO具有较强的寻优能力,鲁棒性和较快的收敛速度;实验也表明不同的局部优化算法在不同的特征函数上体现出不同的优势。     

A GRASP based solution approach to solve cardinality constrained portfolio optimization problems

In the current work, a solution methodology which combines a meta-heuristic algorithm with an exact solution approach is presented to solve cardinality constrained portfolio optimization (CCPO) problem. The proposed method is comprised of two levels, namely, stock selection and proportion determination. In stock selection level, a greedy randomized adaptive search procedure (GRASP) is developed. Once the stocks are selected the problem reduces to a quadratic programming problem. As GRASP ensures cardinality constraints by selecting predetermined number of stocks and quadratic programming model ensures the remaining problem constraints, no further constraint handling procedures are required. On the other hand, as the problem is decomposed into two sub-problems, total computational burden on the algorithm is considerably reduced. Furthermore, the performance of the proposed algorithm is evaluated by using benchmark data sets available in the OR Library. Computational results reveal that the proposed algorithm is competitive with the state of the art algorithms in the related literature.     

基于DCA-PSO算法的均值-VaR投资组合优化

投资组合决策面临现实证券市场中的大量数据,是一个复杂的组合优化问题,属于NP难问题,传统的算法难以有效求解。文化算法和粒子群算法是新近出现的两种仿生智能算法,将新提出的动态文化粒子群算法用于求解均值-VaR模型,用罚函数方法处理模型中的不等式约束,选取沪市和深市的十六支股票作为备选股票进行实证分析,数值结果表明该算法可以高效、合理地解决投资组合优化问题。     

求解约束优化问题的改进自适应mu约束处理技术

针对当前的约束处理技术存在易陷入局部最优解、难以满足等式约束和多控制参数的问题,在mu约束处理技术的基础上,以梯度下降法和多目标拥挤距离为理论依据,设计反映种群约束违反度分布信息的omega参数,它可以自适应地调节约束违反度阈值mu的松弛进而有效地解决约束问题.此外,改进了mu阈值比较准则以提高种群的多样性.经对CEC2017的标准约束优化问题(Constraint optimization problems,COP)进行求解,并与其他先进算法相比较,结果表明,改进的mu约束处理技术能够高效地处理含等式约束的COP.     

Using augmented Lagrangian particle swarm optimization for constrained problems in engineering">Using augmented Lagrangian particle swarm optimization for constrained problems in engineering

The comparatively new stochastic method of particle swarm optimization (PSO) has been applied to engineering problems especially of nonlinear, non-differentiable, or non-convex type. Its robustness and its simple applicability without the need for cumbersome derivative calculations make PSO an attractive optimization method. However, engineering optimization tasks often consist of problem immanent equality and inequality constraints which are usually included by inadequate penalty functions when using stochastic algorithms. The simple structure of basic particle swarm optimization characterized by only a few lines of computer code allows an efficient implementation of a more sophisticated treatment of such constraints. In this paper, we present an approach which utilizes the simple structure of the basic PSO technique and combines it with an extended non-stationary penalty function approach, called augmented Lagrange multiplier method, for constraint handling where ill conditioning is a far less harmful problem and the correct solution can be obtained even for finite penalty factors. We describe the basic PSO algorithm and the resulting method for constrained problems as well as the results from benchmark tests. An example of a stiffness optimization of an industrial hexapod robot with parallel kinematics concludes this paper and shows the applicability of the proposed augmented Lagrange particle swarm optimization to engineering problems.     

Reliability optimization of topology communication network design using an improved ant colony optimization

Network design problem is a well-known NP-hard problem which involves the selection of a subset of possible links or a network topology in order to minimize the network cost subjected to the reliability constraint. To overcome the problem, this paper proposes a new efficiency algorithm based on the conventional ant colony optimization (ACO) to solve the communication network design when considering both economics and reliability. The proposed method is called improved ant colony optimizations (IACO) which introduces two addition techniques in order to improve the search process, i.e. neighborhood search and re-initialization process. To show its efficiency, IACO is applied to test with three different topology network systems and its results are compared with those obtained results from the conventional approaches, i.e. genetic algorithm (GA), tabu search algorithm (TSA) and ACO. Simulation results, obtained these test problems with various constraints, shown that the proposed approach is superior to the conventional algorithms both solution quality and computational time.     

基于改进PSO算法的嵌套环式微陀螺结构优化设计

摘要：改变嵌套环陀螺的结构设计会引起陀螺性能发生很大的改变,但由于其结构复杂,参数众多,导致陀螺在仿真过程中计算量过大,难以探索陀螺多参数变量对陀螺性能的影响规律,针对这一问题提出了一种基于改进PSO算法的嵌套环陀螺结构优化设计方法。该方法在传统PSO算法寻优的基础上,引入极值扰动来避免算法陷入局部极值,并针对嵌套环陀螺进行了一定的条件约束,解决了多参数在总和固定情况下的优化问题。改进后的优化算法以机械热噪声为目标函数,在波音设计的陀螺模型基础上对其间隙分布进行了优化实验,并与未优化前进行了性能对比,结果表明,改进后的优化算法使嵌套环陀螺性能显著提高,结构优化设计更加高效简洁,适用于嵌套环陀螺进行各种多参数的优化问题。     

改进差分进化算法在可靠性冗余分配问题中的应用

提出一种改进差分进化算法(IDE),以解决系统可靠性冗余分配问题.在罚函数法的基础上,对约束处理方法进行改进. 新约束处理方法在搜索过程中不需要在每一步都计算惩罚函数值,加快了寻优速度.具有良好的通用性,可以引入到其他智能优化算法中.将改进的算法用于求解4类典型的系统可靠性冗余分配问题,实验结果表明了所提出的改进算法具有很好的寻优精度和收敛速度.