机械臂最优运动规划问题的混合求解

提出一种基于GA和SQP求解机械臂最优运动规划问题的混合算法．首先采用B样条函数逼近关节运动轨迹，将最优控制问题转化为有约束的非线性规划问题，然后引入基于种群的GA算法，给出全局最优解的初始估计；最后利用序列二次规划(SQP)得到高精度全局最优解．仿真结果表明该方法优于单纯的GA或SQP方法。     

基于PSO的预测控制及在聚丙烯中的应用

输入输出受限非线性系统的预测控制问题,可以看作是一个难以直接求解的约束非线性优化问题。针对预测控制在解决此类优化问题时,存在易收敛到局部极小或者非可行解,对初始值敏感等缺点,提出了一种基于微粒群优化方法的非线性预测控制算法。采用微粒群优化算法（PSO）作为模型预测控制的滚动优化方法,在线实时求解最优控制律。将PSO与序贯二次规划（SQP）算法进行对比仿真实验,求解两个标准函数优化问题,结果表明PSO能够快速有效地求得全局最小点,而SQP则很容易陷入局部极小点。将该算法应用于丙烯聚合反应过程的温度控制中,仿真结果显示了该方法的有效性。     

基于SQP和自适应搜索的混沌粒子群算法

针对基本粒子群优化算法（PSO）算法易陷入局部最优的缺点,提出混沌自适应粒子群-序列二次规划算法（CAPSO-SQP）。在基本PSO算法的基础上,加入混沌搜索和自适应惯性权重提高全局收敛能力,并在PSO算法每一代的迭代过程中,引入SQP策略,加快局部搜索并提高对约束优化问题的计算可靠性。测试函数仿真结果表明,CAPSO-SQP算法计算精度高,稳定性好,收敛速度快。将所提出算法应用于悬臂梁结构优化设计,求解结果表明算法在结构优化计算方面的可行性,而且相对于CPSO算法求解更加准确,具有较高的计算可靠性和实用价值。     

基于智能水滴算法置换流水线调度问题的研究

生产调度问题是制造系统中最基本、最重要和最困难的问题之一.提出了一种新颖的群智能优化算法即智能水滴算法求解置换流水线问题.智能水滴算法是群智能算法领域的最新研究成果,该算法模拟了自然界水系统通过和其周围环境的相互作用而形成河流水道的过程.分析了智能水滴算法的基本原理和数学模型.应用MAT-LAB7.0,对Car1-Car6以及Rec01和Rec13问题进行了仿真测试,并将智能水滴算法和微粒群算法相比较,仿真结果表明了智能水滴算法求解生产调度问题的可行性和有效性.     

基于列队竞争算法的多杂质水网络集成优化

对于多杂质的用水和水处理集成优化问题,建立了以总费用最小为目标的混合整数非线性规划(MINLP)模型,并提出了一种将列队竞争算法(Line-up competition algorithm,LCA)和序列二次规划(Sequential Quadratic Programming,SQP)法相结合的求解策略。其中,用LCA优化整数变量,而用SQP法优化连续变量,通过这两种方法的交替求解来逼近最优解。将所提出的计算方法对文献中的2个典型实例进行了求解,求解结果优于文献。实例计算表明,本文所提出的计算方法是有效的。     

结合罚函数与序列二次规划的[lp]范数优化方法

结合罚函数法与序列二次规划（SQP）方法研究了[lp]范数优化的求解算法。分析了基于SQP方法的[lp]范数优化算法,探讨了初值选取对算法收敛性的影响;针对SQP方法受迭代初值的限制,引入罚函数优化方法对迭代初值作预估计,使其进入可行域,采用SQP方法求解计算。实验结果表明,结合罚函数与SQP方法的[lp]范数优化算法对稀疏信号有较优的重构效果。     

基于信赖域二次规划的非线性模型预测控制优化算法

针对非线性预测控制如何在有限时域内有效的求解非凸非线性规划这一关键问题, 本文采用序列二次规划方法, 将非线性规划转化为一系列二次子规划求解. 首先根据非线性规划联立方法将系统状态和控制量同时作为优化变量, 得到以控制量步长为优化变量, 只包含不等式约束的子二次规划问题, 并用它取代原SQP子规划, 减小了子问题的规模; 随后采用基于信赖域二次规划的方法求解子规划问题, 保证每次迭代的可行性; 同时采用一种能够保持SQP问题Hessian矩阵稀疏结构的更新方法, 也在一定程度上降低了算法的复杂程度.最后的仿真结果表明了该方法的有效性.     

QPSO算法在训练支持向量机中的应用

训练支持向量机的本质问题就是求解二次规划问题，但对大规模的训练样本来说，求解二次规划问题困难很大。遗传算法和粒子群算法等智能搜索技术可以在较少的时间开销内给出问题的近似解。量子粒子群优化（QPSO）算法是在经典的微粒群算法的基础上所提出的一种有较高收敛性和稳定性的进化算法。将操作简单而收敛快速的QPSO算法运用于训练支持向量机，优化求解二次规划问题，为解决大规模的二次规划问题开辟了一条新的途径。     

量子粒子群优化算法在训练支持向量机中的应用

训练支持向量机的本质问题就是求解二次规划问题，但对大规模的训练样本来说，求解二次规划问题困难很大。遗传算法和粒子群算法等智能搜索技术可以在较少的时间开销内给出问题的近似解。量子粒子群优化（QPSO）算法是在经典的微粒群算法的基础上所提出的一种有较高收敛性和稳定性的进化算法。将操作简单而收敛快速的QPSO算法运用于训练支持向量机，优化求解二次规划问题．为解决大规模的二次规划问题开辟了一条新的途径。     

基于Volterra模型的预测控制及应用

由于工业实践的需要,非线性预测控制近年来受到广泛地关注.Volterra模型是一类特殊的非线性模型,非常适合描述工业过程中的无记忆非线性对象.传统的基于Volterra模型的控制器合成法及迭代计算预测控制器法计算量大,且不便于处理控制约束.非线性模型预测控制求解是典型的非线性规划问题,序列二次规划(sequential quadratic program,SQP)算法是求解非线性规划问题常用方法之一.针对Volterra非线性模型预测控制求解问题,本文将滤子法与一种信赖域SQP算法相结合,提出一种改进SQP算法用于基于非线性Volterra模型的带控制约束的多步预测控制求解,并分析了所提方法的收敛性.工业实例仿真结果证实了所提方法的可行性与有效性.     

A Chance Constrained Optimal Reserve Scheduling Approach for Economic Dispatch Considering Wind Penetration

The volatile wind power generation brings a full spectrum of problems to power system operation and management, ranging from transient system frequency fluctuation to steady state supply and demand balancing issue. In this paper, a novel wind integrated power system day-ahead economic dispatch model, with the consideration of generation and reserve cost is modelled and investigated. The proposed problem is first formulated as a chance constrained stochastic nonlinear programming (CCSNLP), and then transformed into a deterministic nonlinear programming (NLP). To tackle this NLP problem, a three-stage framework consists of particle swarm optimization (PSO), sequential quadratic programming (SQP) and Monte Carlo simulation (MCS) is proposed. The PSO is employed to heuristically search the line power flow limits, which are used by the SQP as constraints to solve the NLP problem. Then the solution from SQP is verified on benchmark system by using MCS. Finally, the verified results are feedback to the PSO as fitness value to update the particles. Simulation study on IEEE 30-bus system with wind power penetration is carried out, and the results demonstrate that the proposed dispatch model could be effectively solved by the proposed three-stage approach.      

Solving nonlinear optimal control problems using a hybrid IPSO-SQP algorithm

A hybrid algorithm by integrating an improved particle swarm optimization (IPSO) with successive quadratic programming (SQP), namely IPSO-SQP, is proposed for solving nonlinear optimal control problems. The particle swarm optimization (PSO) is showed to converge rapidly to a near optimum solution, but the search process will become very slow around global optimum. On the contrary, the ability of SQP is weak to escape local optimum but can achieve faster convergent speed around global optimum and the convergent accuracy can be higher. Hence, in the proposed method, at the beginning stage of search process, a PSO algorithm is employed to find a near optimum solution. In this case, an improved PSO (IPSO) algorithm is used to enhance global search ability and convergence speed of algorithm. When the change in fitness value is smaller than a predefined value, the searching process is switched to SQP to accelerate the search process and find an accurate solution. In this way, this hybrid algorithm may find an optimum solution more accurately. To validate the performance of the proposed IPSO-SQP approach, it is evaluated on two optimal control problems. Results show that the performance of the proposed algorithm is satisfactory.     

Sequential quadratic programming enhanced backtracking search algorithm

In this paper, we propose a new hybrid method called SQPBSA which combines backtracking search optimization algorithm (BSA) and sequential quadratic programming (SQP). BSA, as an exploration search engine, gives a good direction to the global optimal region, while SQP is used as a local search technique to exploit the optimal solution. The experiments are carried on two suits of 28 functions proposed in the CEC-2013 competitions to verify the performance of SQPBSA. The results indicate the proposed method is effective and competitive.     

基于SQP局部搜索的蝙蝠优化算法

针对基本蝙蝠算法存在寻优精度不高,后期收敛速度较慢和易陷入局部最优等问题,提出一种基于序贯二次规划（Sequential Quadratic Programming,SQP）的蝙蝠优化算法。该算法应用佳点集理论构造初始种群,增强了初始种群的遍历性;为避免算法陷入早熟收敛,引入柯西变异算子对种群中精英个体进行变异操作,增加种群多样性;在迭代后期,对最优个体进行SQP局部搜索,提高蝙蝠算法的局部深度搜索能力,保证个体在靠近全局最优值时能够寻优到全局最优解,加快种群进化速度。通过仿真实验结果证明,改进后的蝙蝠算法性能优越,具有良好的寻优精度和收敛速度。     

A multi-objective optimization based solution for the combined economic-environmental power dispatch problem

The combined economic-environmental dispatch issue is multidimensional, non-linear, non-convex and highly constrained problem. It involves multiple and often conflicting optimization criteria for which no unique optimal solution can be determined with respect to all criteria. In this paper a multi-objective optimization based solution to the combined economic-environmental power dispatch is proposed. The derivation of the optimal solution is based on the weighted sum method for which improvements are made in direction of penalty function integration. For that purpose a modified dynamic normalization is suggested. A penalization method based on membership functions is introduced in order to calculate the constraint violations. The objective of the proposed method is gaining an optimal solution for the dynamic combined economic-environmental dispatch problem associated to real power systems. Therefore, the algorithm is applied on different test power systems. The obtained results are analyzed and compared with various optimization techniques presented in the literature. The results demonstrate the efficiency of the proposed method in finding solutions toward global optimum.     

Nonconvex/nonsmooth economic load dispatch using modified time‐varying particle swarm optimization

In this paper, a modified time‐varying particle swarm optimization (MTVPSO) is proposed for solving nonconvex economic load dispatch problems. It is a variant of the traditional particle swarm optimization (PSO) algorithm. In an MTVPSO, novel acceleration coefficients for cognitive and social components are presented as linear time‐varying parameters in the velocity update equation of the PSO algorithm. In the early stages of the optimization process, it improves the global search capability of particles and directs the global optima at the end stage. Additionally, a linearly decreased inertia weight is introduced in an MTVPSO, instead of a fixed constant value, which helps improve the diversity of the population. Through this modification mechanism in PSO, the proposed algorithm has a higher probability of avoiding local optima, and it is likely to find global optima more quickly. Six complex benchmark functions have been used to validate the effectiveness of the proposed algorithm. Furthermore, to demonstrate its efficiency, feasibility, and fastness, six different cases (3‐, 6‐, 13‐, 15‐, and 40‐unit systems and one large‐scale Korean power 140‐unit system) of the economic load dispatch problem are solved by an MTVPSO. The results of the proposed algorithm have been compared with state‐of‐the‐art algorithms. It was found that the proposed MTVPSO can deliver better results in terms of solution quality, convergence characteristics, and robustness.     

求解电力系统经济调度问题的改进粒子群优化算法

电力系统经济调度问题是电力系统中的一个重要的研究课题,针对该问题,提出一种改进粒子群优化(ODPSO)算法.改进算法在搜索前期,采用广义的反向学习策略,使算法能够快速地靠近较优的搜索区域,从而提高收敛速度;在搜索后期,借鉴差分进化算法的进化机制设计改进的变异和交叉策略,对当前种群的最优粒子进行更新,从而提高种群的多样性,进而协助算法获得全局最优解.为了验证改进粒子群优化算法的有效性,对CEC2006提出的22个基准约束测试函数进行仿真,结果表明改进算法相比其他算法在寻优精度和稳定性上更具优势.最后,将改进算法应用于考虑机组爬坡速率约束、机组禁行区域约束以及电力平衡约束的两个电力系统经济调度问题,取得了令人满意的结果.     

新颖的全局和声搜索算法在经济性调度中的应用

提出采用新颖的全局和声搜索算法来解决经济调度问题,并设计了一种新颖的处理系统约束的方法;介绍了经济调度问题数学模型、新颖的全局和声搜索算法实现过程及其应用方法。实验结果表明,采用新颖的全局和声搜索算法所获得的最优值要明显好于采用进化算法、粒子群算法所获得的最优值,新颖的全局和声搜索算法为解决经济性调度问题提供了一种新的解决方案。     

Chaotic electromagnetism-like mechanism algorithm for economic load dispatch of power system

Chaotic electromagnetism-like mechanism algorithm (CEMA) is first proposed in this paper, which is the integration of electromagnetism-like mechanism algorithm (EMA) and chaos theory. EMA simulates the attraction and repulsion mechanism for particles in the electromagnetic field. Every solution is a charged particle, and it moves to optimum solution according to certain criteria which need several steps. To enrich the searching behaviour and to avoid being trapped into local optimum, chaotic dynamics is incorporated into EMA. CEMA possesses excellent global optimal performance, simple programming realisation and good convergence, and it is used in economic load dispatch of power systems. Through performance comparison, it is obvious that the solution is superior to other optimisation algorithms. It can be applied to other research problems in power systems.     

Solving Multi-Area Environmental/Economic Dispatch by Pareto-Based Chemical-Reaction Optimization Algorithm

In this study, we present a Pareto-based chemical-reaction optimization (PCRO) algorithm for solving the multi-area environmental/economic dispatch optimization problems. Two objectives are minimized simultaneously, i.e., total fuel cost and emission. In the proposed algorithm, each solution is represented by a chemical molecule. A novel encoding mechanism for solving the multi-area environmental/economic dispatch optimization problems is designed to dynamically enhance the performance of the proposed algorithm. Then, an ensemble of effective neighborhood approaches is developed, and a self-adaptive neighborhood structure selection mechanism is also embedded in PCRO to increase the search ability while maintaining population diversity. In addition, a grid-based crowding distance strategy is introduced, which can obviously enable the algorithm to easily converge near the Pareto front. Furthermore, a kinetic-energy-based search procedure is developed to enhance the global search ability. Finally, the proposed algorithm is tested on sets of the instances that are generated based on realistic production. Through the analysis of experimental results, the highly effective performance of the proposed PCRO algorithm is favorably compared with several algorithms, with regards to both solution quality and diversity.